Vercelli, L: On the complexity of stratified logics Relationship between stratified light logics and algebras of functions used to characterize polynomial time computable functions
-
- Englisch ausgewählt
Fr. 102.00
inkl. gesetzl. MwSt.,
Beschreibung
Produktdetails
Einband
Taschenbuch
Erscheinungsdatum
01.03.2010
Verlag
VDMSeitenzahl
176
Maße (L/B/H)
22/15/1.1 cm
Gewicht
278 g
Sprache
Englisch
ISBN
978-3-639-24436-6
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.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung