Regularity in models of arithmetic
DOI10.2307/2274109zbMATH Open0584.03044OpenAlexW2047460779MaRDI QIDQ3708802FDOQ3708802
Authors: George Mills, Jeff Paris
Publication date: 1984
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274109
Recommendations
- Theories of arithmetics in finite models
- Regular cuts in models of bounded arithmetic
- Arithmetically saturated models of arithmetic
- scientific article; zbMATH DE number 999649
- scientific article; zbMATH DE number 3914392
- scientific article; zbMATH DE number 7183906
- scientific article; zbMATH DE number 2236639
- scientific article; zbMATH DE number 3900751
- Tennenbaum's theorem for models of arithmetic
- Inconsistent models of arithmetic. I: Finite models
regularityPeano arithmeticaxiomatizationcutsfirst-order arithmeticsecond-order theoriesthere exist unboundedly many
Logic with extra quantifiers and operators (03C80) First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)
Cites Work
Cited In (9)
- Enriched regular theories
- Regular cuts in models of bounded arithmetic
- Some highly saturated models of Peano arithmetic
- Pell Equations and Weak Regularity Principles
- Inconsistent models of arithmetic. I: Finite models
- 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}
- Title not available (Why is that?)
- Model theory of the regularity and reflection schemes
- The stability spectrum for classes of atomic models
This page was built for publication: Regularity in models of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708802)