Realisability in weak systems of explicit mathematics

DOI10.1002/MALQ.201020064zbMath1267.03057OpenAlexW2163590111MaRDI QIDQ3107339

Thomas Strahm, Daria Spescha

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

proof theoryrealizabilityapplicative theoriesFeferman's explicit mathematicsfeasible operations

Mathematics Subject Classification ID

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

Related Items (3)

A feasible theory of truth over combinatory algebra ⋮ Admissible closures of polynomial time computable arithmetic ⋮ The provably terminating operations of the subsystem PETJ of explicit mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The provably terminating operations of the subsystem PETJ of explicit mathematics
• A proof-theoretic characterization of the basic feasible functionals
• Polytime, combinatory logic and positive safe induction
• Theories with self-application and computational complexity.
• Systems of explicit mathematics with non-constructive \(\mu\)-operator. II
• Elementary explicit types and polynomial time operations

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