Mohlo by se vám také líbit

Více informací o knize On the complexity of stratified logics

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 203 bodů

Anotace knihy

Our primary motivation is the comparison of two different traditions used in implicit computational complexity to characterize the class FPTIME of the polynomial time computable functions. On one side, FPTIME can be captured by Intuitionistic Light Affine Logic (ILAL), a logic derived from Linear Logic, characterized by the structural invariant Stratification. On the other side, FPTIME can be captured by Safe Recursion on Notation (SRN), an algebra of functions based on Predicative Recursion, a restriction of the standard recursion schema used to define primitive recursive functions. Stratification and Predicative Recursion seem to share common underlying principles, whose study is the main subject of this work.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Information technology: general issues

• Plný název: On the complexity of stratified logics
• Autor: Luca Vercelli
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 176
• EAN: 9783639244366
• ISBN: 3639244362
• ID: 06832044
• Nakladatelství: VDM Verlag
• Hmotnost: 263 g
• Rozměry: 152 × 229 × 10 mm
• Datum vydání: 18. March 2010

Oblíbené z jiného soudku

---

---

---