Incomparable ω1‐like models of set theory

DOI10.1002/malq.201500002zbMath1469.03107arXiv1501.01022OpenAlexW2601479774MaRDI QIDQ5108089

Gunter Fuchs, Joel David Hamkins, Victoria Gitman

Publication date: 29 April 2020

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.01022

Mathematics Subject Classification ID

Consistency and independence results (03E35) Models of arithmetic and set theory (03C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Recursively saturated \(\omega _ 1\)-like models of arithmetic
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• Elementary embeddings and infinitary combinatorics
• Blunt and topless end extensions of models of set theory
• On Certain Elementary Extensions of Models of Set Theory
• A Rather Classless Model
• Models with second order properties II. Trees with no undefined branches
• EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE
• UNCOUNTABLE REAL CLOSED FIELDS WITH PA INTEGER PARTS
• Elementary extensions of models of set theory

This page was built for publication: Incomparable ω₁‐like models of set theory