# Tagged Questions

**4**

votes

**1**answer

242 views

### How do we know if Vaught's Conjecture is Absolute?

Please note that this might be some confusion on my part about the work surrounding Vaught's conjecture.
First of all, Vaught Conjecture states that if a first-order complete theory $T$ in a ...

**3**

votes

**1**answer

226 views

### What axioms (other than choice) have a taming effect on the ordering of cardinalities?

Axiom of choice arranges all cardinalities into a well-ordered chain but without it their ordering can be wild in general ZF models, e.g. two cardinalities may not even have inf or sup. However, ...

**2**

votes

**1**answer

138 views

### The number of countable models [duplicate]

Let $\mathcal{L}$ be a countable first order language. For a natural number n, can we find a complete $\mathcal{L}$-Theory $T$ which has exactly n non-isomorphic countable models ?

**7**

votes

**2**answers

337 views

### A “suitably generic” set of Cohen reals without forcing?

I was reading a paper by David Marker, whose main theorem was that if $T$ is a first-order theory which is not small, then $F_2\leq_B \cong_T$. That's not especially relevant to the question at hand, ...

**14**

votes

**1**answer

740 views

### Interactions between (set theory, model theory) and (algebraic geometry, algebraic number theory ,…)

Set theory and model theory have many applications outside of logic, in particular in algebra, topology, analysis, ...
On the other hand model theory, in particular after Hrushovski, found many ...

**5**

votes

**1**answer

176 views

### Scott sentence in models of set theory

Let $\mathfrak{M}$ be a countable transitive model of set theory.
Let $L$ be some countable language and $A$ be a countable (in $\mathfrak{M}$) $L$-structure.
My question is:
In $\mathfrak{M}$ can ...

**6**

votes

**0**answers

166 views

### Foundation scheme for $\Sigma_{n+1}$-formulas

I have trouble working out a proof in the second part of
Jean-Pierre Ressayre and Alex Wilkie. Modèles non standard en arithmétique et théorie des ensembles. Publications ...

**3**

votes

**2**answers

209 views

### Sufficient Condition for Defining $\in$

Consider the first order language $\mathcal{L}=\{\in,\in'\}$ with two binary relational symbols $\in , \in'$ and $ZFC$ as a $\{\in\}$-theory. If we define $\in'$ using $\{\in\}$-formula $\varphi(x,y)$ ...

**1**

vote

**1**answer

220 views

### A Special Pair of Formulas

Consider the first order language $\mathcal{L}=\{\in,\subseteq\}$ and $\{\in\}$-theory $\text{ZFC}$. Is there a formula $\psi (x,y) \in \{\subseteq\}-Form$ with the following ...

**8**

votes

**2**answers

294 views

### The (non-)absoluteness of second-order elementary equivalence

Elementary equivalence is set-theoretically absolute between any two transitive models of set theory; this is also true for the infinitary logics - e.g., $\mathcal{L}_{\omega_1\omega}$ - at least, ...

**1**

vote

**1**answer

348 views

### Compactness and completeness in Gödel logic

The standard proof of the completeness theorem in first-order Gödel logic is based
on a first-order countable language. I want to know that is there any proof of the completeness theorem in ...

**6**

votes

**1**answer

184 views

### Morley Phenomena for Special Families of Reals

Vaught's Conjecture is a dual form of Continuum Hypothesis in model theory. It asserts that for each complete consistent theory $T$ in a countable language if $I(T,\aleph_{0})>\aleph_{0}$ then ...

**1**

vote

**3**answers

293 views

### Can the structure of an ultrafilter determine the structure of its ultrapower?

Usually we work with ultrafilters as pure sets without any structure.
Q1. Is there any important notion of structure on an ultrafilter?
Q2. Is there any non-trivial notion of structure on ...

**10**

votes

**3**answers

849 views

### Is it ever a good idea to use Keisler-Shelah to show elementary equivalence?

The most useful way I know to show that two structures are elementarily equivalent is Ehrenfeucht-Fraisse games. These are quite nice and intuitive, and even when I can't use them to solve my problem ...

**5**

votes

**1**answer

189 views

### A ZFC construction to get a proper extension which is a $\omega_1$-model

In $V$, let me call a set theory structure A is a $\omega_1$ model if the $\omega_1$ of $A$ is the same as the $\omega_1$ in $V$ (up to isomorphism). The question I would like to ask is the following: ...

**8**

votes

**2**answers

232 views

### Vaught's conjecture for partial orders

In
``Steel, John R. On Vaught's conjecture. Cabal Seminar 76–77, pp. 193–208''
the following is proved:
Theorem. Let $\phi\in L_{\omega_1,\omega}.$ If every model of $\phi$ is a tree, then $\phi$ has ...

**4**

votes

**2**answers

288 views

### Forcing for Arbitrary First Order Theories

Forcing is a relative model construction method for models of $ZF$ as a particular first order theory using models of another first order theory (forcing companion) that in this case is the theory of ...

**2**

votes

**0**answers

95 views

### Stability of analytic Zariski structures

Noetherian Zariski structures are introduced by Hrushovski and Zilber.(1996)
An analytic Zariski structure is a generalization of Noetherian Zariski structures, introduced by Zilber and Peatfield.
...

**10**

votes

**1**answer

226 views

### Is “approximate categoricity” absolute?

Let $T$ be a countable first-order theory, and assume that $T$ has exactly one atomic model up to isomorphism in every uncountable cardinality. (By "atomic" I mean a model which omits the ...

**6**

votes

**1**answer

240 views

### Recursive ordinals and the minimal standard model of ZF

Does the minimal standard model of ZF contain all recursive ordinals or is it limited (probably by the proof theoretic ordinal of ZF as I suspect but cannot prove)?
Paul J. Cohen's definition of the ...

**3**

votes

**1**answer

137 views

### Outer Definability of a Class

Definition: Let $C$ be a class of sets and $\mathcal{L}$ a first order relational language. We say $C$ is "outer definable" by $\mathcal{L}$ if there is a first order theory $T$ and for each $n_{R}$ - ...

**2**

votes

**1**answer

216 views

### $(\kappa,\lambda)$ - Minimal Models & Stronger Version of Rowbottom's Theorem

Definition 1: Let $M$ be a $\mathcal{L}$ - structure and $A\subseteq Dom(M)$. Define:
$Def_{A}(M):=\{X\subseteq Dom(M)~|~\exists n\in \omega~~\exists \varphi (x,y_1,...,y_n)\in ...

**1**

vote

**1**answer

255 views

### $(\kappa , \lambda)$ - Minimal Models of $\text{ZF}$

The notion of minimality in model theory is related to the existence of a gap in the size of definable subsets of a model. Now consider the following generalization:
Definition 1: Let $M$ be a ...

**3**

votes

**2**answers

152 views

### Joint Forcing Extension Property

Definition 1: A class $\mathcal{K}$ of countable transitive models of $\text{ZF}$ has strong "joint forcing extension property" (JFEP) iff for all $M,N\in \mathcal{K}$ there are forcing notions ...

**8**

votes

**1**answer

391 views

### Shelah's book on “Classification Theory”

As we know one of the most important and fundamental books in stability, simplicity, forking and ... classification theory, is Shelah's "Classification Theory" where lots of original ideas of the ...

**6**

votes

**1**answer

194 views

### Is the consistency of $\mathcal{L}_{\infty\omega}$-sentences absolute?

The question is exactly that of the title. Suppose $\varphi\in V$ is an $\mathcal{L}_{\infty\omega}$-sentence, and $W$ is an inner model of $V$ such that $\varphi\in W$. Is the statement
...

**5**

votes

**0**answers

309 views

### Recent application of model theory in set theory by Shelah-Malliaris

Recently one of the oldest open problems in set theory about the cardinal invariants of the continuum (i.e the question of whether $\mathfrak{p}=\mathfrak{t}$) was solved by Shelah and Malliaris (see ...

**3**

votes

**2**answers

425 views

### Are descriptive and ontological notions of equality equal? [closed]

Let $a$ and $b$ are two "objects". What is the meaning of $a=b$? This is one of the deepest problems of philosophy and logic because one needs a complete information about ...

**8**

votes

**1**answer

307 views

### Does existence of a proper class model imply the consistency?

The fundamental theorem of model theory says that:
Theorem: A first order theory is consistent if and only if it has a model.
In the above theorem we assume that the domain of any model is a ...

**4**

votes

**2**answers

268 views

### Can we force with Fraisse filters to solve Vaught's conjecture?

Around the classic Fraisse amalgamation theorem in model theory we have the following notions:
Definition (1): If $M$ be an $\mathcal{L}$-structure then define:
$age(M):=\lbrace N~|~N~\text{is ...

**1**

vote

**0**answers

150 views

### Is there a non-trivial consistency preserving transformation?

In set theory "equiconsistency" (and not "consistency") of the theories is the main part of researches. So we usually try to construct a new model using a given one. In the ...

**5**

votes

**1**answer

169 views

### What are the Possible Large Cardinals of $L[X]$?

I've been doing some basic reading in inner model theory, and I'm at the point where I've seen the definition of things like Martin-Steel and Mitchell-Steel inner models. I am wondering about the ...

**12**

votes

**3**answers

737 views

### Where is the end of universe?

In some sense the empty set ($\emptyset$) and the global set of all sets ($G$) are the ends of the universe of mathematical objects. The world which $ZFC$ describes has an end from the bottom and is ...

**5**

votes

**1**answer

164 views

### Absoluteness of completeness

Suppose $V_0, V_1$ are (not necessarily well-founded) models of ZFC and suppose $\varphi$ is a first order sentence in a finite language $L$ (in our background model of set theory). Because every true ...

**7**

votes

**1**answer

184 views

### Is there a forcing closure?

The main theorem of forcing says that for any c.t.m of $ZFC$ like $M$ and for all partial order $\mathbb{P}$ and $\mathbb{P}$-generic $G$ over $M$, there is a c.t.m of $ZFC$, like $N$ such that $N$ is ...

**1**

vote

**0**answers

154 views

### Relativization of Formulas and Models [closed]

I want to show that the definition of satisfiability is consistent with the definition given by relativization, i.e. Let $L=\{\in\}$. Let $M$ be a definable set and let $E\subset{M\times{M}}$. Let ...

**3**

votes

**1**answer

177 views

### Do inner models of unique measurable cardinals have a regular behavior? (Edited and Revised Version)

We know that if $\kappa$ is a measurable cardinal and $\mu$ be a two-valued non-trivial$\kappa$-additive measure on it then the corresponding inner model produced by ...

**5**

votes

**2**answers

222 views

### Is there an inner model between two distinct inner models of ZFC?

Definition (1): An inner model of $ZFC$ is a tarnsitive proper class model of $ZFC$ which contains all ordinal numbers. Informally we denote the collection of all inner ...

**2**

votes

**1**answer

194 views

### Can we flex the rigid models by enough power?

Definition (1): An $\mathcal{L}$ - structure $\mathcal{M}$ called "rigid" iff there is no non-trivial automorphism on $\mathcal{M}$.
Definition (2): An ...

**1**

vote

**1**answer

250 views

### Self-containing graphs

[Second try, after this question failed.]
Let me sketch a notion of self-containing structures by a simple example. Consider the class $\Gamma$ of finite or countable digraphs ("graphs" for short) ...

**5**

votes

**2**answers

314 views

### Applications of forcing in model theory

What are the major applications of (set theoretic) forcing in model theory?

**5**

votes

**1**answer

140 views

### Is there a truth approximation on a cumulative hierarchy?

Note to the following well known theorem:
Theorem (1): If $\kappa$ be a "measurable" cardinal and $\mathcal{F}$ be a "non-principal $\kappa$-complete normal" ...

**6**

votes

**1**answer

649 views

### Is there a monster behind the trees?

First Fix the following notation:
$\forall \kappa\in Card~~~Tp(\kappa):="\kappa~has~tree~property"$
The large cardinals as "monsters of heaven" live everywhere in the land of ...

**6**

votes

**1**answer

217 views

### Vopenka's Principle for non-first-order logics

(For simplicity, the background theory for this post is NBG, a set theory directly treating proper classes which is a conservative extension of ZFC.)
Vopenka's Principle ($VP$) states that, given any ...

**7**

votes

**1**answer

229 views

### Iterating definability

An odd -- probably basic -- question about model theory:
For $\mathcal{M}$ a structure in a (first-order) signature $\Sigma$, let $\mathcal{M}'$ be the structure in signature $\Sigma\sqcup\lbrace ...

**4**

votes

**1**answer

181 views

### Replacement axiom and existence of end-extensions (Chang and Keisler's Model Theory)

I am currently reading Chang and Keisler's model theory textbook, and there is something that I don't seem to be able to understand about their proof (through the Omitting Types Theorem) that every ...

**1**

vote

**0**answers

147 views

### Self-modelling structures

Consider - for the sake of simplicity - only graphs as structures.
For undirected graphs $(V, E\subseteq \binom{V}{2})$ let
$E(v)$ be the set of edges $e\in E$ incident with $v$, i.e. $\lbrace e ...

**1**

vote

**1**answer

798 views

### Are there non-commutative models of arithmetic which have a prime number structure?

Peano Arithmetic (PA) models have a prime number structure and commutativity of addition and multiplication. Presburger arithmetic (PrA) models of arithmetic have addition without multiplication and ...

**2**

votes

**1**answer

428 views

### What follows from assuming not Con(ZF)?

Hello.
Let $\operatorname{sat} X$ denote the satisfiability of a theory $X$.
From Gödel's second incompleteness theorem and his completeness theorem follows $$ZF \not\vdash \lceil \operatorname{sat} ...

**10**

votes

**2**answers

415 views

### Constructible models of New Foundations?

Hi all! Is there anything like Gödel's constructible universe for New Foundations?
More precisely, I would like a process for taking a model $M$ of NF, and using it to build a model $L \subseteq M$ ...