Admissible closures of polynomial time computable arithmetic

DOI10.1007/s00153-011-0238-7zbMath1222.03064OpenAlexW2092553530MaRDI QIDQ634777

Thomas Strahm, Dieter Probst

Publication date: 16 August 2011

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://boris.unibe.ch/9986/1/153_2011_Article_238.pdf

zbMATH Keywords

Kripke-Platek set theorysecond-order arithmeticpolynomial-time computable arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonclassical and second-order set theories (03E70) Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

The strength of extensionality. II: Weak weak set theories without infinity

Cites Work

• The strength of extensionality. II: Weak weak set theories without infinity
• The provably terminating operations of the subsystem PETJ of explicit mathematics
• A Conservation Result Concerning Bounded Theories and the Collection Axiom
• Realisability in weak systems of explicit mathematics
• Elementary explicit types and polynomial time operations
• Asymmetric Interpretations for Bounded Theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Admissible closures of polynomial time computable arithmetic