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 4085

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

Does the axiom of specification prevent writing any proof?

Your definition of the rule of universal introduction is wrong. The usual rule for universal introduction says that if $\Sigma\vdash\phi$ and $x$ is a variable that does not occur free in $\Sigma$ th …
Russell O'Connor's user avatar
5 votes
1 answer
364 views

Conservation of Hyperarithmetic Sentences over AC and CH.

I know that arithmetic sentences are conserved under the addition of the axiom of choice and the continuum hypothesis to ZF (i.e. ($ZF+AC \vdash \phi$ iff $ZF \vdash \phi$) and ($ZF+CH \vdash \phi$ if …
Russell O'Connor's user avatar
4 votes

Set theories that do require the existence of urelements?

Nominal logic is based on the Frænkel-Mostowski permutation model of set theory. In particular Nominal logic has a freshness axiom that states ${\forall}x. {\exists}a \in \mathbb{A}. a \# x$, where $ …
Russell O'Connor's user avatar