English
Related papers

Related papers: Twins: non-isomorphic models forced to be isomorph…

200 papers

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every…

Logic · Mathematics 2007-05-23 Saharon Shelah

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid…

Logic · Mathematics 2007-05-23 Gunter Fuchs , Joel David Hamkins

Following the types-as-sets paradigm, we present a mechanized embedding of dependent function types with a hierarchy of universes into schematic first-order logic with equality, with axiom schemas of Tarski-Grothendieck set theory. We carry…

Logic in Computer Science · Computer Science 2026-03-16 Yunsong Yang , Simon Guilloud , Viktor Kunčak

In this article we introduce and study hyperclass-forcing (where the conditions of the forcing notion are themselves classes) in the context of an extension of Morse-Kelley class theory, called MK$^{**}$. We define this forcing by using a…

Logic · Mathematics 2015-10-15 Carolin Antos , Sy-David Friedman

Every mathematical structure has an elementary extension to a pseudo-countable structure, one that is seen as countable inside a suitable class model of set theory, even though it may actually be uncountable. This observation, proved easily…

Logic · Mathematics 2022-10-11 Joel David Hamkins

Recently the second author introduced combinatorial principles that characterize supercompactness for inaccessible cardinals but can also hold true for small cardinals. We prove that the proper forcing axiom PFA implies these principles…

Logic · Mathematics 2010-12-10 Matteo Viale , Christoph Weiß

We initiate a systematic study of the class of theories without the tree property of the second kind - NTP2. Most importantly, we show: the burden is "sub-multiplicative" in arbitrary theories (in particular, if a theory has TP2 then there…

Logic · Mathematics 2013-08-15 Artem Chernikov

We give model-independent arguments, valid in nearly any number of spacetime dimensions, that topological solitons and instantons satisfy Bogomol'nyi-type bounds and, when these bounds are saturated, satisfy self-duality equations. In the…

High Energy Physics - Theory · Physics 2009-10-22 Zvonimir Hlousek , Donald Spector

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…

Logic · Mathematics 2026-02-20 Asaf Karagila , Jonathan Schilhan

The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Johannes Greiner

We prove that for every tower $\mathcal T$ there are $\aleph_1$-dense $A$ and $B$ so that any ``reasonable" forcing notion $\mathbb{P}$ -- an adjective that includes all known ones -- for making $A$ and $B$ isomorphic will add a…

Logic · Mathematics 2025-10-14 Corey Bacal Switzer

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

Let $M$ be a transitive model of $ZFC$ and let ${\bf B}$ be a $M$-complete Boolean algebra in $M.$ (In general a proper class.) We define a generalized notion of forcing with such Boolean algebras, $^*$forcing. (A $^*$ forcing extension of…

Logic · Mathematics 2016-09-06 Garvin Melles

An inaccessible cardinal $\kappa$ is supercompact when $(\kappa, \lambda)$-ITP holds for all $\lambda\geq \kappa.$ We prove that if there is a model of $\ZFC$ with two supercompact cardinals, then there is a model of \ZFC where…

Logic · Mathematics 2011-12-15 Laura Fontanella

In the absence of the axiom of choice, the set-theoretic status of many natural statements about metrizable compact spaces is investigated. Some of the statements are provable in $\mathbf{ZF}$, some are shown to be independent of…

General Topology · Mathematics 2020-08-05 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

Part I: We would like to generalize imaginary elements, weight of ${\rm ortp}(a,M,N),{\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [Sh:c, Ch.III,V,\S4] to the context of good frames. This requires allowing the vocabulary to…

Logic · Mathematics 2023-05-04 Saharon Shelah

We show that if $cf(2^{\aleph_0})=\aleph_1,$ then any non-trivial $\aleph_1$-closed forcing notion of size $\leq 2^{\aleph_0}$ is forcing equivalent to $Add(\aleph_1, 1),$ the Cohen forcing for adding a new Cohen subset of $\omega_1.$ We…

Logic · Mathematics 2020-03-11 Mohammad Golshani , Saharon Shelah

Let T be an algebraically bounded theory. We consider the $L(\bar\delta)$-expansions of T by a tuple $\bar \delta$ of derivations (which may be commuting or not). We investigate the model completion of either of the above theories, whose…

Logic · Mathematics 2026-05-26 Fornasiero Antongiulio , Terzo Giuseppina