On the complexity of models of arithmetic

DOI10.2307/2273150zbMath0519.03056OpenAlexW2099293911MaRDI QIDQ3669417

Kenneth McAloon

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/2273150

zbMATH Keywords

first-order Peano arithmeticinitial segmentsrecursively enumerable extension of Peano arithmetic

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15)

Related Items

Bounded recursively enumerable sets and degrees ⋮ Models of arithmetic and categories with finiteness conditions ⋮ Toward the limits of the Tennenbaum phenomenon ⋮ Real closures of models of weak arithmetic ⋮ EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE ⋮ FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension ⋮ A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) ⋮ MARGINALIA ON A THEOREM OF WOODIN ⋮ On Gödel incompleteness and finite combinatorics ⋮ Diophantine induction ⋮ Definability, decidability, complexity ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC

Cites Work

• Experimental logics and \(\Delta^0_2\)-theories
• Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
• Some independence results for Peano arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of models of arithmetic