Remarks on applicative theories

DOI10.1016/j.apal.2005.05.007zbMath1088.03013OpenAlexW2014134602MaRDI QIDQ2566067

Andrea Cantini

Publication date: 22 September 2005

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2005.05.007

zbMATH Keywords

combinatory logicuntyped \(\lambda\)-calculusfirst-order predicate calculus

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Constructivism in mathematics. An introduction. Volume I
• Theories with self-application and computational complexity.
• Some results on extensionality in lambda calculus
• Proof theory. An introduction
• Totality in applicative theories
• Feasible Operations and Applicative Theories Based on λη
• A new method for establishing conservativity of classical systems over their intuitionistic version

This page was built for publication: Remarks on applicative theories