A standard model of Peano arithmetic with no conservative elementary extension
From MaRDI portal
Publication:998319
DOI10.1016/j.apal.2008.07.005zbMath1156.03035MaRDI QIDQ998319
Publication date: 28 January 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2008.07.005
Peano arithmetic; conservative extension; second-order arithmetic; proper forcing; elementary end extensions
03F30: First-order arithmetic and fragments
03C62: Models of arithmetic and set theory
03F35: Second- and higher-order arithmetic and fragments
03C40: Interpolation, preservation, definability
03C55: Set-theoretic model theory
Related Items
An improper arithmetically closed Borel subalgebra of \(\mathcal P(\omega)\) mod FIN, Models of expansions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}${\mathbb N}$\end{document} with no end extensions, Proper and piecewise proper families of reals
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improper arithmetically closed Borel subalgebra of \(\mathcal P(\omega)\) mod FIN
- Ultrafilters and types on models of arithmetic
- Set theory. An introduction to independence proofs
- Model theory
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Scott's problem for Proper Scott sets
- Models of arithmetic and closed ideals
- On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers
- Conservative extensions of models of arithmetic
- Models and types of Peano's arithmetic
- Definability of measures and ultrafilters
- Models with second order properties II. Trees with no undefined branches
- A model of peano arithmetic with no elementary end extension
- Logic with the quantifier “there exist uncountably many”
- Embedding Trees in the Rationals
- Multiple Forcing
- Elementary extensions of models of set theory