All Questions
10 questions
12
votes
1
answer
648
views
Can $\mathcal{L}_{\omega_1,\omega}$ detect $\mathcal{L}_{\omega_1,\omega}$-equivalence?
Roughly speaking, say that a logic $\mathcal{L}$ is self-equivalence-defining (SED) iff for each finite signature $\Sigma$ there is a larger signature $\Sigma'\supseteq\Sigma\sqcup\{A,B\}$ with $A,B$ ...
8
votes
3
answers
1k
views
Tractability of forcing-invariant statements under large cardinals
It is usual to mention theorems of the kind:
Th. Assume there is a proper class of Woodin cardinals, $\mathbb{P} $ is a partial order and $G \subseteq \mathbb{P}$ is V-generic, then $V \models \phi \...
17
votes
3
answers
1k
views
Minimum transitive models and V=L
Is there a c.e. theory $T⊢\text{ZFC}$ in the language of set theory such that the minimum transitive model of $T$ exists but does not satisfy $V=L$?
You may assume that ZFC has transitive models. ...
13
votes
2
answers
1k
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, ...
12
votes
3
answers
2k
views
Why do we need a transitive model in forcing arguments?
One major approach to the theory of forcing is to assume that ZFC has a countable transitive model $M \in V$ (where $V$ is the "real" universe). In this approach, one takes a poset $\mathbb{P} \in M$, ...
7
votes
1
answer
291
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 ...
14
votes
1
answer
522
views
Is there an infinitary sentence which is absolutely not second-order expressible?
This is a "forcing-absolute" followup to this question, whose answer was largely unsatisfying. The question is:
Suppose $V=L$. Is there an $\mathcal{L}_{\infty,\omega}$-sentence $\varphi$ ...
10
votes
7
answers
1k
views
Applications of forcing in model theory
What are the major applications of (set theoretic) forcing in model theory?
7
votes
2
answers
683
views
Can second-order logic identify "amorphous satisfiability"?
Recall that a set is amorphous iff it is infinite but has no partition into two infinite subsets. I'm interested in the possible structure (in the sense of model theory) which an amorphous set can ...
4
votes
2
answers
625
views
The category of Boolean-valued models associated to a model of ZFC
This is related to my previous question here, and indirectly motivated by Andreas Blass intriguing answer therein:
start from a ZF transitive model $M$, and consider the category $CBA(M)$ of ...