Call Us 080-41656200 (Mon-Sat: 10AM-8PM)
Free Shipping above Rs. 1499
Cash On Delivery*

On the complexity of stratified logics

 

Marketed By :  VDM Verlag Dr. Müller   Sold By :  Kamal Books International  
Delivery in :  10-12 Business Days

 

Check Your Delivery Options

 
Rs. 5,066

Availability: In stock

 
  • Product Description
 

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.

Product Specifications
SKU :COC47905
AuthorLuca Vercelli
LanguageEnglish
BindingPaperback
Number of Pages176
Publishing Year2010-03-18T00:00:00.000
ISBN978-3639244366
Edition1 st
Book TypeComputer networking & communications
Country of ManufactureIndia
Product BrandVDM Verlag Dr. Müller
Product Packaging InfoBox
In The Box1 Piece
Product First Available On ClickOnCare.com2015-04-08 00:00:00