Arithmetical independence results using higher recursion theory

DOI10.2178/JSL/1080938820zbMath1067.03074OpenAlexW1963567417MaRDI QIDQ5313376

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

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

Related Items (1)

A theorem on partial conservativity in arithmetic

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Solovay's theorem cannot be simplified
• Unnamed Item
• Unnamed Item

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