A feasible theory of truth over combinatory algebra

DOI10.1016/j.apal.2013.12.002zbMath1349.03085MaRDI QIDQ2637706

Sebastian Eberhard

Publication date: 14 February 2014

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.2013.12.002

zbMATH Keywords

applicative theories; truth theories; polytime computability

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03F50: Metamathematics of constructive systems

03F03: Proof theory in general (including proof-theoretic semantics)

Related Items

Unfolding Schematic Systems, Applicative theories for logarithmic complexity classes

Cites Work

• The provably terminating operations of the subsystem PETJ of explicit mathematics
• Functional interpretations of feasibly constructive arithmetic
• An axiomatic approach to self-referential truth
• Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium
• Theories with self-application and computational complexity.
• The unfolding of non-finitist arithmetic
• Logical frameworks for truth and abstraction. An axiomatic study
• UNFOLDING FINITIST ARITHMETIC
• Realisability in weak systems of explicit mathematics
• AXIOMS FOR DETERMINATENESS AND TRUTH
• Elementary explicit types and polynomial time operations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item