# Tagged Questions

**12**

votes

**3**answers

441 views

### Formal/rigorous treatment of (im)predicativity/predicativism

There are several places on the web where one may find quite intuitively understandable accounts of (im)predicativity; here on MO I found two questions with very good detailed answers (Predicative ...

**5**

votes

**0**answers

346 views

### Last Status of Feferman's Conjecture on Indefinite Value of Continuum

The "true" value of $2^{\aleph_0}$ is one of the most fundamental open questions of mathematics and its philosophy. Hundreds of set theoretic results during the last century don't say anything more ...

**14**

votes

**6**answers

2k views

### What “forces” us to accept large cardinal axioms?

Large cardinal axioms are not provable using usual mathematical tools (developed in $\text{ZFC}$).
Their non-existence is consistent with axioms of usual mathematics.
It is provable that some of ...

**3**

votes

**0**answers

245 views

### A Question Regarding Boolean-valued Models

What were the intuitions motivating the creation (or discovery, if you will) of Boolean-valued models? I have searched for the Scott-Solovay paper on the subject, but to no avail. There also seems to ...

**1**

vote

**1**answer

190 views

### Mathematical analysis of Lewisian concepts, esp. natural properties

David Lewis was one of the great philosophers of our time. He was a genuine philosopher, his focus was on theoretical metaphysics. And he had something to say about mathematics. His last book - he ...

**3**

votes

**2**answers

3k views

### where can you find Grothendieck's “Recoltes et Semailles”?

Where can you find Grothendieck's "Recoltes et Semailles"?
Is it available anywhere?

**50**

votes

**3**answers

6k views

### Nelson's program to show inconsistency of ZF

At the end of the paper Division by three by Peter G. Doyle and John H. Conway, the authors say:
Not that we believe there really are any such things as infinite sets, or that the Zermelo-Fraenkel ...

**12**

votes

**3**answers

910 views

### Has there ever been a weaker Church-like thesis?

Background. The Church-Turing thesis, in one of its many equivalent formulations, states that the intuitively computable arithmetical functions are exactly those computed by Turing machines.
...