# Tagged Questions

**21**

votes

**2**answers

1k views

### Similarities between Post's Problem and Cohen's Forcing

Remark: I have since learned that G.H. Moore addresses this question in the third reference listed at the end of this post, beginning on p. 157 in which he cites a letter from Kreisel to Gödel dated ...

**5**

votes

**0**answers

275 views

### Reference for Wang Tile

I am working on projects in solving ground state of generalized ising models. One recent work involves tiling with basic tiles that filled the whole lattice. For example, we could obtain results:
...

**86**

votes

**15**answers

16k views

### Why worry about the axiom of choice?

As I understand it, it has been proven that the axiom of choice is independent of the other axioms of set theory. Yet I still see people fuss about whether or not theorem X depends on it, and I don't ...

**33**

votes

**2**answers

12k views

### Is the analysis as taught in universities in fact the analysis of definable numbers?

Ten years ago when I studied in the university I had no idea about definable numbers, but I came to this concept myself. My thoughts were as follows:
All numbers are divided into two classes: those ...

**45**

votes

**5**answers

4k views

### Decidability of chess on an infinite board

The recent question Do there exist chess positions that require exponentially many moves to reach? of Tim Chow reminds me of a problem I have been interested in. Is chess with finitely many men on an ...

**33**

votes

**5**answers

3k views

### Is the Riemann Hypothesis equivalent to a $\Pi_1$ sentence?

1) Can the Riemann Hypothesis (RH) be expressed as a $\Pi_1$ sentence?
More formally,
2) Is there a $\Pi_1$ sentence which is provably equivalent to RH in PA?
(This is mentioned in P. ...

**31**

votes

**7**answers

5k views

### Arguments against large cardinals

I started to learn about large cardinals a while ago, and I read that the existence, and even the consistency of the existence of an inaccessible cardinal, i.e. a limit cardinal which is additionally ...

**-1**

votes

**2**answers

1k views

### Is metatheory, providing proof of the incompleteness theorem, consistent?

Is metatheory, considered as a formal system, that used to prove the First Incompleteness Theorem, consistent?

**71**

votes

**9**answers

11k views

### Solutions to the Continuum Hypothesis

Related MO questions: What is the general opinion on the Generalized Continuum Hypothesis? Completion of ZFC )
Background
The Continuum Hypothesis (CH) posed by Cantor in 1890 asserts that $ ...

**44**

votes

**2**answers

4k views

### How would you solve this tantalizing Halmos problem?

1-ab invertible => 1-ba invertible has a slick power series "proof" as below, where Halmos asks for an explanation of why this tantalizing derivation succeeds. Do you know one?
Geometric series. In ...

**30**

votes

**6**answers

2k views

### Is the non-triviality of the algebraic dual of an infinite-dimensional vector space equivalent to the axiom of choice?

If $V$ is given to be a vector space that is not finite-dimensional, it doesn't seem to be possible to exhibit an explicit non-zero linear functional on $V$ without further information about $V$. The ...

**8**

votes

**5**answers

2k views

### Interesting meta-meta-mathematical theorems?

The Goedel incompleteness theorems can be considered meta-mathematical theorems, as they are "written" in a meta-theory and "talk" about properties of a class of formal theories.
The following may be ...

**26**

votes

**0**answers

892 views

### Concerning the various proofs from the axiom of choice that R^3 admits of surprising geometrical decompositions into circles, skew lines and so on: can we prove in any instance that there are no Borel such decompositions? Or that AC is required?

This question follows up on a comment I made on Joseph O'Rourke's
recent question, one of several questions here on mathoverflow
concerning surprising geometric partitions of space using the axiom
of ...

**9**

votes

**4**answers

3k views

### Pi1-sentence independent of ZF, ZF+Con(ZF), ZF+Con(ZF)+Con(ZF+Con(ZF)), etc.?

Let
ZF1 = ZF,
ZFk+1 = ZF + the assumption that ZF1,...,ZFk are consistent,
ZFω = ZF + the assumption that ZFk is consistent for every positive integer k,
... and similarly define ZFα ...

**17**

votes

**2**answers

705 views

### If ZFC has a transitive model, does it have one of arbitrary size?

It is known that the consistency strength of $\sf ZFC+\rm Con(\sf ZFC)$ is greater than that of $\sf ZFC$ itself, but still weaker than asserting that $\sf ZFC$ has a transitive model. Let us denote ...

**12**

votes

**1**answer

240 views

### What metatheory proves $\mathsf{ACA}_0$ conservative over PA?

Simpson's book shows $\mathsf{ACA}_0$ is conservative over $\mathsf{PA}$ in the natural way by model theory using definable subsets. Of course, $\mathsf{ACA}_0$ being conservative over PA is ...

**6**

votes

**2**answers

544 views

### Is there one binary operation foundational for set theory?

The membership relationship "$\epsilon$" is foundational for set theory, in the sense that the axioms of any set theory are formulated in the language of "$\epsilon$". Naturally, the question arises ...

**5**

votes

**1**answer

519 views

### Can formal logic give a precise notion of “canonical”?

Coming off of this discussion, I'm wondering what the term "canonical" really means. In that thread, many suggested category theory as a way to formalize the concept of what "canonical" means, using ...

**4**

votes

**1**answer

203 views

### Computational approach deciding whether a set of Wang Tile could tile the space up to some size

As an applied person, I'm facing one practical problem deciding whether a set of Wang tile could tile the plane periodically or aperiodically. Although both problems seem undecidable, but I'm on a ...

**4**

votes

**1**answer

231 views

### Can the Burgess-Hazen analysis of Predicative Arithmetic be extended to Transfinite Types?

Around page 300 of his book "Mathematical Thought and its Objects", Charles Parsons discusses the work of Edward Nelson, who believes that mathematical induction is impredicative, because it can be ...

**3**

votes

**5**answers

908 views

### Defining 'free monoid' without Nat?

Is there a definition of what is a 'free monoid' which does not pre-suppose that the natural numbers has already been defined? The definitions that I have been able to track down all use the natural ...

**76**

votes

**42**answers

16k views

### What are the most attractive Turing undecidable problems in mathematics?

What are the most attractive Turing undecidable problems in mathematics?
There are thousands of examples, so please post here only the most attractive, best examples. Some examples already appear on ...

**56**

votes

**3**answers

5k views

### Does every non-empty set admit a group structure (in ZF)?

It is easy to see that in ZFC, any non-empty set $S$ admits a group structure: for finite $S$ identify $S$ with a cyclic group, and for infinite $S$, the set of finite subsets of $S$ with the binary ...

**28**

votes

**15**answers

5k views

### Abstract Thought vs Calculation

Jeremy Avigad and Erich Reck in their remarkable historical paper "Clarifying the nature of the infinite: the development of metamathematics and proof theory" claim that one of the factors of becoming ...

**40**

votes

**2**answers

4k views

### A question about ordinal definable real numbers

If ZFC (Zermelo-Fraenkel set theory with the Axiom of Choice) is consistent, does it remain consistent
when the following statement is added to it as a new axiom?
"There exists a denumerably ...

**71**

votes

**11**answers

7k views

### Checkmate in $\omega$ moves?

Is there a chess position with a finite number of pieces on the infinite chess board $\mathbb{Z}^2$ such that White to move has a forced win, but Black can stave off mate for at least $n$ moves for ...

**26**

votes

**8**answers

3k views

### Arithmetic fixed point theorem

I want to understand the idea of the proof of the artihmetic fixed point theorem. The theorem is crucial in the proof of Gödel's first Incompletness theorem.
First some notation: We work in $NT$, the ...

**27**

votes

**6**answers

4k views

### A remark of Connes

In an interview (at http://www.alainconnes.org/docs/Inteng.pdf) Connes remarks that
I had been working on non-standard analysis, but after a while I had found a catch in the theory.... The point ...

**29**

votes

**3**answers

2k views

### Why do stacked quantifiers in PA correspond to ordinals up to $\epsilon_0$?

I am trying to understand why induction up to exactly $\epsilon_0$ is necessary to prove the cut-elimination theorem for first-order Peano Arithmetic; or, as I understand, equivalently, why the length ...

**15**

votes

**2**answers

2k views

### Large cardinal axioms and Grothendieck universes

A cardinal $\lambda$ is weakly inaccessible, iff a. it is regular (i.e. a set of cardinality $\lambda$ can't be represented as a union of sets of cardinality $<\lambda$ indexed by a set of ...

**23**

votes

**9**answers

2k views

### How many groups of size at most n are there? What is the asymptotic growth rate? And what of rings, fields, graphs, partial orders, etc.?

Question. How many (isomorphism types of) finite groups of size at most n are there? What is the asymptotic growth rate? And the same question for rings,
fields, graphs, partial orders, etc.
...

**15**

votes

**3**answers

2k views

### Is there a computable model of ZFC?

Background
Assuming ZFC is consistent, then by downward Löwenheim–Skolem, there is a countable model (M,$\in$) of ZFC. Since the universe M is countable, we may as well think of it as actually being ...

**14**

votes

**12**answers

2k views

### Excellent uses of induction and recursion

Can you make an example of a great proof by induction or construction by recursion?
Given that you already have your own idea of what "great" means, here it can also be taken to mean that the chosen ...

**26**

votes

**1**answer

791 views

### Is there a computable ordinal encoding the proof strength of ZF? Is it knowable?

In comments on Quora (see, for example, here, here, here), Ron Maimon has repeatedly expressed the strong opinion that Hilbert's program was not killed by Gödel's results in the way typically ...

**14**

votes

**4**answers

3k views

### What would be some major consequences of the inconsistency of ZFC?

I was happily surfing the arXiv, when I was jolted by the following paper:
Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity by ...

**13**

votes

**2**answers

2k views

### Clarification of Gödel's second incompleteness theorem

I am sorry for the following question, because the actual answer to this question is in the beautiful works of Feferman and Jeroslow, but, unfortunately, I havn't any time to go into that specific ...

**8**

votes

**2**answers

800 views

### Is it possible for countably closed forcing to collapse $\aleph_2$ to $\aleph_1$ without collapsing the continuum?

Suppose the continuum is larger than $\aleph_2$. Does there exist a countably closed notion of forcing that collapses $\aleph_2$ to $\aleph_1$, but does not collapse the continuum to $\aleph_1$? ...

**22**

votes

**4**answers

2k views

### What axioms are used to prove Godel's Incompleteness Theorems?

I understand Godel's Incompleteness Theorems to be statements about effectively generated formal systems, which basically makes them theorems about algorithms. This is cool, because despite being ...

**8**

votes

**3**answers

593 views

### Consistency of Analysis (second order arithmetic)

Is there a proof of the consistency of Analysis (second order arithmetic), which is similar to Gentzen's proof of the consistency of arithmetic?
Update:
Which (different) methods can be used to ...

**16**

votes

**2**answers

869 views

### Prospects for reverse mathematics in Homotopy Type Theory

Reverse mathematics, as I mean here, is the study of which theorems/axioms can be used to prove other theorems/axioms over a weak base theory. Examples include
Subsystems of Second Order Arithmetic ...

**16**

votes

**2**answers

1k views

### What is a Choice Principle, really?

This question is quite soft, and I apologize in advance if it borderline off-topic.
When working in theories between ZF and ZFC the term "choice principle" is heard quite often. For example:
$\quad$ ...

**12**

votes

**2**answers

953 views

### What proofs cannot be relativized

I am afraid this post may show my naivety. At a recent conference, someone told me that there are some arguments in computability theory that don't relativize. Unfortunately, this person (who I ...

**11**

votes

**3**answers

943 views

### On statements independent of ZFC + V=L

Let $V=L$ denote the axiom of constructibility. Are there any interesting examples of set theoretic statements which are independent of $ZFC + V=L$? And how do we construct such independence proofs? ...

**6**

votes

**2**answers

773 views

### Complete theory with exactly n countable models?

For n an integer greater than 2, Can one always get a complete theory over a finite language with exactly n models (up to isomorphism)?
There's a theorem that says that 2 is impossible.
My ...

**12**

votes

**1**answer

720 views

### finite dimensional real division algebras

A celebrated theorem of Milnor and Kervaire asserts that any finite dimensional division algebra over the real numbers has dimension 1,2,4 or 8. This result is established using methods from algebraic ...

**9**

votes

**1**answer

286 views

### Can Tarski decide constructibility in elementary geometry?

Can the decision routine for Tarski's Elementary geometry be extended to decide when an existence claim in that theory can be instantiated by a compass and straightedge construction?
The answer does ...

**3**

votes

**1**answer

486 views

### Feferman's extensional and intensional applications of the method of arithmetization

At the very beginning of Feferman's Arithmetization of metamathematics in a general setting it can be read:
The method of arithmetization, as developed by Gödel[10], exploits the possibility of ...

**17**

votes

**2**answers

1k views

### A set that can be covered by arbitrarily small intervals

Let $X$ be a subset of the real line and $S=\{s_i\}$ an infinite sequence of positive numbers. Let me say that $X$ is $S$-small if there is a collection $\{I_i\}$ of intervals such that the length of ...

**15**

votes

**1**answer

880 views

### Gödel's Constructible Universe in Infinitary Logics (A Possible Approach to HOD Problem)

Gödel's constructible universe ($L$) is defined using definable power set operator in first order logic ($\mathcal{L}_{\omega ,\omega}$). One can produce such a universe in infinitary logics in ...

**10**

votes

**3**answers

724 views

### Reducing ACA₀ proof to First Order PA

According to the Wikipedia ACA0 is a conservative extension of First Order logic + PA.
http://en.wikipedia.org/wiki/Reverse_Mathematics
First of all I have a few questions about the proof:
a - What ...