Skip to main content
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Code code:"if (foo != bar)"
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Saves in:saves
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with
Search options not deleted user 497904

first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, theories of truth, truth revision, consistency.

11 votes
2 answers
810 views

Undefinable inner model

What are some examples of a pair $M\subseteq N$ of transitive set models of $\mathsf{ZFC}$ with the same ordinals, such that $M$ is not a definable class (with parameters) in $N$? Is it possible that …
new account's user avatar
7 votes
0 answers
374 views

Is Borel cardinality the same as cardinality under determinacy?

Suppose $E,F$ are Borel equivalence relations on Polish spaces $X,Y$, respectively. Under strong enough determinacy axioms, is it true that $E$ Borel reduces to $F$ iff there is an injective map from …
new account's user avatar
3 votes

A better way to explain forcing?

Here is currently my favorite way to motivate forcing, and I conjecture that it works for most "real" mathematicians (non-logicians). A proof/disproof is left to the reader. The forcing relation is in …
new account's user avatar
3 votes
0 answers
214 views

Basic cardinal arithmetic without choice

Do we know everything about addition and multiplication of cardinalities in choiceless set theory? For example, let $M$ be a model of $\textsf{ZF}+\textsf{AD}+V=L(\mathbb{R})$, consider the sets $\mat …
new account's user avatar
11 votes
3 answers
785 views

When are two forcing posets "the same"?

Let $B$ and $C$ be complete Boolean algebras. To avoid triviality I may also want them to be atomless. For $b\in B$ nonzero, denote $B\upharpoonright b=\{p\in B:p\leq b\}$, which can be viewed as a co …
new account's user avatar
6 votes

Who needs Replacement anyway?

Isn't replacement needed or at least the most natural way to construct projective/injective resolutions? Say we want a free resolution of $M$. Consider the free module $F_1$ with $M$ as the set of gen …
new account's user avatar