On the complexity of models of arithmetic

DOI10.2307/2273150zbMATH Open0519.03056OpenAlexW2099293911MaRDI QIDQ3669417FDOQ3669417

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Experimental logics and \(\Delta^0_2\)-theories
• Some independence results for Peano arithmetic
• Cambridge summer school in mathematical logic, held in Cambridge/England, August 1-21, 1971
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Bounded recursively enumerable sets and degrees
• 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\)
• An analysis of Tennenbaum's theorem in constructive type theory
• Hierarchical incompleteness results for arithmetically definable extensions of fragments of arithmetic
• On Gödel incompleteness and finite combinatorics
• Marginalia on a theorem of Woodin
• Real closures of models of weak arithmetic
• Models of arithmetic and categories with finiteness conditions
• Diophantine induction
• Definability, decidability, complexity
• Toward the limits of the Tennenbaum phenomenon
• Every countable model of set theory embeds into its own constructible universe

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

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