Publication:3772192: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 12:28, 5 February 2024
DOI10.2307/2273790zbMATH Open0634.03029OpenAlexW1982001540MaRDI QIDQ3772192FDOQ3772192
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273790
bounded arithmeticPresburger arithmeticmodels of arithmeticrecursively saturated modelsrecursive modelsarithmetic with bounded existential inductionParis-Wilkie's \(\Delta _ 0\)-hierarchy
Computable structure theory, computable model theory (03C57) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)
Cites Work
Cited In (22)
- Bounded recursively enumerable sets and degrees
- 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
- 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
- A note on recursive models of set theories
- Pell Equations and Weak Regularity Principles
- Parity Games and Propositional Proofs
- Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document}
- Algebraic combinatorics in bounded induction
- Real closures of models of weak arithmetic
- Diophantine induction
- Hilbert's tenth problem for weak theories of arithmetic
- Overspill and fragments of arithmetic
- Models of VTC0$\mathsf {VTC^0}$ as exponential integer parts
- On a Problem of J. Paris
- Fermat's last theorem and Bezout's theorem in GCD domains
- On the diophantine equation \(x^{10}{\pm{}}y^{10}=z^ 2\)
- The joint embedding property in normal open induction
- The Skolem-Bang theorems in ordered fields with an IP
- Well-behaved principles alternative to bounded induction
- Toward the limits of the Tennenbaum phenomenon
- Pell equations and exponentiation in fragments of arithmetic
This page was built for publication: Bounded existential induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3772192)