Arithmetical independence results using higher recursion theory

DOI10.2178/JSL/1080938820MaRDI QIDQ5313376zbMATH OpenOpenAlexFDO

Authors Andrew Arana

Publication date 29 August 2005

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/jsl/1080938820

zbMATH Keywords

independencemodels of arithmetic

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Models of arithmetic and set theory (03C62) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Recommendations

• Independent Recursive Axiomatizability in Arithmetic
• Independence Results for n-Ary Recursion Theorems
• Independent numerations of theories and recursive progressions
• Independent numerations of theories and of recursive progressions
• Arithmetic transfinite induction and recursive well-orderings
• An Independence Result for Intuitionistic Bounded Arithmetic
• Arithmetical transfinite induction and hierarchies of functions
• Lifting independence results in bounded arithmetic
• Arithmetical realizability and primitive recursive realizability
• A Remark on Independence Results for Sharply Bounded Arithmetic

Cites work

• Computable structures and the hyperarithmetical hierarchy
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Solovay's theorem cannot be simplified

Cited in

(3)

• Is independence an exception?
• A theorem on partial conservativity in arithmetic
• scientific article; zbMATH DE number 2144526 (Why is no real title available?)

This page was built for publication: Arithmetical independence results using higher recursion theory

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