Realisability in weak systems of explicit mathematics

DOI10.1002/MALQ.201020064MaRDI QIDQ3107339zbMATH OpenOpenAlexFDO

Authors Daria Spescha, Thomas Strahm

Publication date 23 December 2011

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.201020064

zbMATH Keywords

applicative theoriesfeasible operationsFeferman's explicit mathematicsproof theoryrealizability

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Proof theory in general (including proof-theoretic semantics) (03F03) Metamathematics of constructive systems (03F50)

Recommendations

• The provably terminating operations of the subsystem PETJ of explicit mathematics
• scientific article; zbMATH DE number 1418436
• Elementary explicit types and polynomial time operations
• Polynomial time operations in explicit mathematics
• A feasible theory of truth over combinatory algebra

Cites work

• A proof-theoretic characterization of the basic feasible functionals
• Elementary explicit types and polynomial time operations
• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 3568670 (Why is no real title available?)
• scientific article; zbMATH DE number 2222014 (Why is no real title available?)
• Polytime, combinatory logic and positive safe induction
• Systems of explicit mathematics with non-constructive -operator. II
• The provably terminating operations of the subsystem PETJ of explicit mathematics
• Theories with self-application and computational complexity.
• Weak theories of operations and types

Cited in

(7)

• A feasible theory of truth over combinatory algebra
• Weak theories of operations and types
• Realization Theory for Rational Systems: The Existence of Rational Realizations
• Realization of analysis into Explicit Mathematics
• Polynomial time operations in explicit mathematics
• Admissible closures of polynomial time computable arithmetic
• The provably terminating operations of the subsystem PETJ of explicit mathematics

This page was built for publication: Realisability in weak systems of explicit mathematics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107339)