Search Results
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 |
forcing, large cardinals, descriptive set theory, infinite combinatorics, cardinal characteristics, forcing axioms, ultrapowers, measures, reflection, pcf theory, models of set theory, axioms of set theory, independence, axiom of choice, continuum hypothesis, determinacy, Borel equivalence relations, Boolean-valued models, embeddings, orders, relations, transfinite recursion, set theory as a foundation of mathematics, the philosophy of set theory.
4
votes
Accepted
Can one satisfaction class code another?
In case of Peano Arithmetic the answer is yes (emphatically yes), if I understand your question correctly. This follows from Theorem 3.3 in Smith's "Nonstandard Definability" APAL 42 (1989) pp. 21-43 …
14
votes
Why is an internal proof of consistency satisfactory for some systems?
The original context of Gödel's Theorem was slightly different. Famously, Hilbert had asked for a purely combinatorial proof of consistency for strong set theories. Notice that this seems like a very …
7
votes
When is it okay to intersect infinite families of proper classes?
Here is an example of a family of classes of rings which you couldn't intersect: The class $A_n$ consists of all rings of power greater than n and the rings of cardinality $k≤n$ such that $ϕ_k$, where …
14
votes
Accepted
How can any theory prove well-foundedness of ordinals above $\omega_1^{\text{CK}}$?
Just slightly expanding the comment of Emil Jeřábek: on one hand, in ZFC we can define some objects we call ordinals and prove transfinite induction of each of them. This is not what we mean by the or …
3
votes
Why can we assume a ctm of ZFC exists in forcing
This is to slightly elaborate on point 2 of Noah Schweiber's answer, since in my opinion this approach is often presented in a somewhat confusing manner which ommits some key subtelties.
Forcing const …