Some notes on uncountable models of arithmetic
Fundamenta Mathematicae · 04.05.2026
DOI: 10.4064/fm250514-22-11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Fundamenta Mathematicae, online erschienen am 04.05.2026. Verfasst von Wei Wang.
Abstract (Originalsprache)
Historically, logicians have found it very difficult to understand the structure of uncountable models of arithmetic. I argue that if a model M of arithmetic has an element a with |[0,a]M|=ℵ0, then it resembles a countable model. As evidence, I present two theorems. The first states that if M is such a model with its standard system contained in some Scott set S and X∈S, then M admits an elementary extension N with X∈SSy(N)⊆S. The second states that if M is such a model and L is a finite lattice such that every countable M0 has an elementary extension N0 with Lt(N0/M0)≅L, then M can also be extended this way. An alternative proof of Ehrenfeucht’s lemma is also included.
Zitieren
APA
Wang, W. (2026). Some notes on uncountable models of arithmetic. Fundamenta Mathematicae. https://doi.org/10.4064/fm250514-22-11
Vancouver
Wang W. Some notes on uncountable models of arithmetic. Fundamenta Mathematicae. 2026. doi:10.4064/fm250514-22-11
BibTeX
@article{Wang2026,
author = {Wang, Wei},
title = {Some notes on uncountable models of arithmetic},
journal = {Fundamenta Mathematicae},
year = {2026},
doi = {10.4064/fm250514-22-11}
}
EUVIMED