On the complexity of models of arithmetic
From MaRDI portal
Publication:3669417
DOI10.2307/2273150zbMath0519.03056OpenAlexW2099293911MaRDI QIDQ3669417
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
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
This page was built for publication: On the complexity of models of arithmetic