scientific article; zbMATH DE number 1531922

MaRDI QIDQ4513965zbMATH OpenFDO

Authors Yue Yang, C. T. Chong

Publication date 4 June 2001

zbMATH Keywords

fragments of Peano arithmeticmodelsrecursive functionreverse computability theory

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Recursive functions and relations, subrecursive hierarchies (03D20) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Recommendations

• Computable Structure Theory
• scientific article; zbMATH DE number 424614
• Arithmetical definability and computational complexity
• scientific article; zbMATH DE number 2063217
• Arithmetic theories for computational complexity problems
• The computational content of arithmetical proofs
• Computable structures and the hyperarithmetical hierarchy
• scientific article; zbMATH DE number 3860379
• scientific article; zbMATH DE number 1467185
• Computability, finiteness and the standard model of arithmetic

Cited in

(7)

• Computable structures and the hyperarithmetical hierarchy
• Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts
• scientific article; zbMATH DE number 424614 (Why is no real title available?)
• The atomic model theorem and type omitting
• A Complete Axiomatization of Computer Arithmetic
• Techniques of computable set theory with applications to proof verification
• The minimal e-degree problem in fragments of Peano arithmetic

This page was built for publication:

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