35

Answers
votes newest views recent
9
Awfully sophisticated proof for simple facts
3
Half Cantor-Bernstein Without Choice
3
How much larger is the powerset of a transfinite set?
5
some arguments concerning forcing over V
3
Normal measures on $P_{\kappa }(\lambda )$ extend the club filter
3
Is modern computability theory “really” about algorithms?
6
Unwritten Rule Of Writing Own Name
3
Mathematics seminar for “non-mathematicians”
5
Proofs of Gödel’s theorem
1
Restricted Versions of Hechler Forcing
4
Kunen’s use of Countable Transitive Models
3
Consistent hierarchy of axiomatic systems
3
Sum of three bijections
7
Are there uncountably many essentially inequivalent versions of Mathematics?
6
Intended interpretations of set theories
3
A question about imaginary Turing machines.
5
Singular Cardinals, and A Strange Question.
1
Why do we teach calculus students the derivative as a limit?
3
Ultrapowers, and Models of Set theory.
2
Consistent r.e. extensions of non r.e. theories.
1
Simple example of a sequence without computable modulus of convergence
-6
Theorems that are ‘obvious’ but hard to prove
1
Inconsistency and workaday independence.
7
Forcing over an arbitrary model of ZFC
18
What is the generic poset used in forcing, really?
0
Expected value as decision criterion in the context of rare events
0
New Year’s Predictions in Mathematics
1
When is a statement provable?
1
Generalization of the club filter
7
Independence of P = NP?
1 2 next