**6**

votes

**1**answer

209 views

### What is known about the boundary between Richardson's theorem and the Tarski-Seidenberg theorem?

Tarski proved that equalities and inequalities in can be decided over $\mathbb{R}[x].$ Richardson proved that adding composition with the sine and exponential functions caused the problem to become ...

**3**

votes

**1**answer

130 views

### Is $PA+ \neg R_{PA}$ $\Pi_1$- conservative over $PA$?

I think it is well-known that $PA+\neg con(PA)$ is $\Pi_1$-conservative over $PA$ (for proof see Smorynski's article, 'the incompleteness theorems', in handbook of mathematical logic).
What can we ...

**3**

votes

**0**answers

87 views

### Logical framework for type theories like ML and CIC

I'm looking for a logical framework in which it is possible to easily present both intensional and extensional theories of dependent types with a partially ordered set of universes à la Russell ...

**6**

votes

**0**answers

167 views

### Singular Jonsson cardinals

Is the consistency of the following well-known:
$(*)$: There exists a singular cardinal $\kappa$ such that :
(1) $\kappa$ is a Jonsson cardinal,
(2) $\kappa$ is not a fixed point of the ...

**7**

votes

**1**answer

156 views

### $2$-uniformization versus $\omega$-uniformization of ladder systems

Let $S \subseteq \omega_1$ be a stationary set of limit ordinals and let $L = \langle L_\alpha \;|\; \alpha\in S\rangle$ be a ladder system. We say that $L$ has $\kappa$-uniformization if for every ...

**19**

votes

**2**answers

842 views

### What do you do if you believe a problem is undecidable?

While the title of this question is subjective, I hope to make what I'm looking for quite concrete. The first, and main question is this: If you believe that a problem you are working on is formally ...

**12**

votes

**1**answer

536 views

### Ordinary mathematics in Chang's model

This question is prompted by a paper by Andre Kornell that just appeared on the arXiv. A large portion of the paper is devoted to showing that a surprising amount of ordinary mathematics can be ...

**12**

votes

**0**answers

252 views

### The topos for forcing in computability theory

My understanding is that forcing (such as Cohen forcing) can be described via a topos. For example this nlab article on forcing describes forcing as a "the topos of sheaves on a suitable site."
My ...

**2**

votes

**1**answer

139 views

### Two questions on substitutability

(1) The condition that a term $a$ be substitutable for another term in an expression can be given a recursive definition. Who first developed such a definition?
(2) One sometimes see the phrase "$a$ ...

**9**

votes

**0**answers

214 views

### Proving regularity properties from forcing axioms

It's well known that PFA implies projective determinacy. It's also well known that PD implies that all projective sets are Lebesgue measurable, have the Baire property, etc.
Is there a direct proof ...

**0**

votes

**1**answer

190 views

### Is there a nontrivial maximally recursive function? [closed]

Say that a (recursive) function $f:\Bbb N\rightarrow\Bbb N$ is maximally recursive if, for all $n\in\Bbb N$, the value $f(n+1)$ can be calculated only by first knowing $f(n)$. A rather trivial example ...

**8**

votes

**0**answers

323 views

### What is known about the reverse mathematics of algebraic number fields?

I know work on the reverse mathematics of countable algebraic field extensions including Galois theory, notably including Dorais, Hirst, and Shafer http://arxiv.org/pdf/1209.4944v2.pdf. But algebraic ...

**2**

votes

**0**answers

98 views

### May $\Sigma_3$-collection hold below $\Sigma_3$-admissible ordinals for Gödel's L?

Suppose you have a system X=$KP$ + infinity plus $\Sigma_{3}$-collection and $\Delta_{2}$-specification. May $L_{\delta}\vDash X$ for some $\delta$ smaller than all $\Sigma_{3}$ admissible ordinals?

**1**

vote

**1**answer

174 views

### Propositional logic: Minimal set of formulas, which is consistent and complete

Hello together,
I have a rather basic issue on propositional logic: first, consider an arbitrary set of formulas $T$ that is consistent and complete, i.e., for every propositional formula $\varphi$, ...

**9**

votes

**1**answer

317 views

### singularize the least inaccessible?

Is it consistent that there is some partial order $\mathbb P$ and some inaccessible cardinal $\kappa$, which is the least inaccessible, such that $\mathbb P$ forces $\kappa$ to be singular while ...

**8**

votes

**1**answer

392 views

### Adding a real with infinite conditions

Consider the forcing $\Bbb P$ whose conditions are partial functions $p\colon\omega\to2$ with $\operatorname{dom}(p)$ a co-infinite subset of $\omega$, ordered by reverse inclusion.
Does $\Bbb P$ ...

**1**

vote

**1**answer

84 views

### On whether a formula of KP is $\Pi_3$

In the context of KP, is the formula $\forall w(w\in x \leftrightarrow\forall y\exists z F(w,y,z))$ $\Pi_3$ when $F(w,y,x)$ is $\Delta_0$?

**5**

votes

**2**answers

553 views

### Consequences of ZF+“all subsets of reals are Lebesgue measurable”

(I'm not sure if this is entirely suitable here so feel free to close it if it's not.) The statement "there is a Lebesgue measure on $\mathbb{R}$($2^\omega$)" means: there is a total $\sigma$-additive ...

**7**

votes

**2**answers

252 views

### Decidability of diophantine equation in a theory

Given a theory $T \subseteq \operatorname{Th}(\mathbb{N})$, define the decision problem $D_T$ as follows:
Given a polynomial $p$ with integer coefficients and variables $\bar{x}$, decide whether
...

**10**

votes

**2**answers

391 views

### Is there a compendium of the consistency strength between the most important formal theories?

Preliminar Notions:
A formal system is a tuple $(\Sigma,G,A,R)$ where $\Sigma$ is an alphabet (set of symbols), $G$ is a formal grammar on $\Sigma$ that generates a formal language $L$ (set of well ...

**13**

votes

**1**answer

609 views

### Analogues of Primitive Recursive Functions

Let $\mathbf{A}$ be an admissible set (possibly with urelements). I am wondering if there is some good notion of "primitive recursive arithmetic" relative to $\mathbf{A}$. More precisely, I would like ...

**2**

votes

**1**answer

132 views

### Total formulae in a theory equivalent to $\Delta_0$ formulae in the theory?

Let a formula $\phi$ of the language of first-order Peano arithmetic be total in a theory Th that extends PA iff, for any $k_1, \dots, k_n \in \omega$, Th $\vdash \phi(\bar k_1, \dots, \bar k_n)$ or ...

**4**

votes

**2**answers

276 views

### Limits of determinacy on reals

For $X\subseteq\mathbb{R}^\omega$, say that $X$ is determined if the associated game on $\mathbb{R}$ of length $\omega$ (players I and II alternate playing reals, player I wins iff the sequence built ...

**0**

votes

**0**answers

41 views

### representing quasicrystal as tilings and appearing frequencies of each tile

Quasicrystal can be fully represented either using projection method or tilings with constraints. For the latter, is there some sort of study on the "appearing frequency" of each tile or even ...

**6**

votes

**1**answer

223 views

### Are two forms of the Dual Schroeder-Bernstein property equivalent?

We know the Shroeder-Bernstein (SB) theorem can be proved in ZF, while the Dual Schroeder-Bernstein (DSB) can be proved in ZF+AC but not in ZF. Define as ISB the property that whenever there are both ...

**4**

votes

**1**answer

427 views

### Did Brouwer evade uncountability?

I have the distinct memory of having often heard and read that intuitionism was inter alia geared to avoid Cantor's uncountable sets, and it may be that this was Brouwer's plan. But are there accounts ...

**-2**

votes

**1**answer

152 views

### Does PA prove a sentence asserting that all of I-sigma(n) theories are consistent? [closed]

We know that PA proves consistency of $I\Sigma_{n}$ for any $n$. But does PA prove the sentence:
$\forall n (con(I\Sigma_{n}))$?

**1**

vote

**3**answers

589 views

### Brouwer vs. Cantor

Brouwer criticises Cantor e.g. in Intuitionistiche Mengenlehre. Is there a link or reference to some streamlined modern account of Brouwer's ideas?

**11**

votes

**5**answers

794 views

### Does k(X) have a k-basis for every set X, without AC?

This question is inspired by Pace Nielsen's recent question Does a left basis imply a right basis, without AC?.
For any field $k$, the field $k(x)$ of rational functions in one variable has an ...

**11**

votes

**1**answer

221 views

### counterexample regarding quotient algebras in forcing

Suppose $A$ and $B$ are complete subalgebras of a complete boolean algebra $C$. Let $G \subseteq A$ be generic. In the extension $V[G]$, we can define the quotient algebras $B/G$ and $C/G$ in the ...

**24**

votes

**4**answers

1k views

### Forcing as a replacement of induction and diagonal arguments

Let me give some examples motivating the question.
The use of forcing instead of induction: For this consider Cantor's theorem:
Theorem 1. Any two countable dense linear orders $I, J$ without end ...

**6**

votes

**0**answers

233 views

### A new cardinality living in every forcing extension?

This question is motivated by the papers http://arxiv.org/abs/1405.7456 and http://arxiv.org/abs/1410.1224.
Say that a set $X$ is "generically presentable" over $V\models ZF$ if there is some ...

**7**

votes

**3**answers

250 views

### A well-founded relation on lists

Let $A$ be a set equipped with a well-founded relation $<$, let $LA$ be the set of finite lists of elements of $A$, and define a relation $\prec$ on $LA$ such that $\ell \prec m$ if $\ell$ is ...

**14**

votes

**0**answers

434 views

### Has anyone read/debunked Yessenin-Volpin–Hennix “Beware of the Gödel-Wette paradox”?

A student recently asked me about the status of a 2001 arXiv post, Beware of the Gödel-Wette paradox!, by Alexander Yessenin-Volpin (aka Esenin-Volpin and several other transliterations) and Catherine ...

**2**

votes

**1**answer

248 views

### Axiomatic ZFC Set Theory [closed]

Can the Axiom Schema of Comprehension be omitted from ZFC since it is implied by the Axiom Schema of Replacement?

**-1**

votes

**1**answer

99 views

### types and elementary extensions [closed]

Let $\mathcal{M}$ and $\mathcal{N}$ be two $\mathcal{L}$-structures and suppose that for n-tupls $\bar{a}\in M^n$ and $\bar{b}\in N^n$,
$tp^\mathcal{M}(\bar{a})=tp^\mathcal{N}(\bar{b})$ where ...

**6**

votes

**2**answers

621 views

### A question on rank-to-rank embeddings

Consider a non-trivial elementary embedding $j:V_\lambda\to V_\lambda$ and, for each $A\subset V_\lambda$, set $j(A)=\bigcup_{\delta<\lambda}j(A\cap V_\delta)$.
In Implications between strong ...

**3**

votes

**3**answers

323 views

### The Set-Theoretic Multiverse and Joint Embeddings

I am curious whether or not the following axiom is independent of Hamkins's axioms for the Set-Theoretic Multiverse. Hamkins's axioms can be found here on pages 1-2 and here on pages 24-26.
Consider ...

**5**

votes

**0**answers

250 views

### Cardinal characteristics without choice

(I'm taking my definition of a cardinal characteristic from Blass' excellent article http://www.math.lsa.umich.edu/~ablass/need.pdf, which cites Vojtas/Fremlin/Miller; theirs is more general, but I'm ...

**8**

votes

**0**answers

204 views

### Is there a notion analogous to separability but requiring definable rather than countable sets?

Among models of $\lambda$-calculus, some like the Bohm tree model have the property that every element is a directed sup of definable elements, whereas others like the $D_\infty$ and $P(\omega)$ ...

**11**

votes

**2**answers

676 views

### Where is the Erdős–Rado theorem stated in Erdős and Rado's Bull AMS paper?

This may be inappropriate for MO, but here goes: if I have understood the statement of the Erdős–Rado theorem correctly, then it contains as a special case the following result:
if $\mu$ is ...

**4**

votes

**2**answers

243 views

### Is it consistent that $\frak{d} < 2^{\aleph_0}$?

Let $\omega^\omega$ denote the set of all functions $f:\omega\to\omega$. We write $f <^* g$ if there is $N\in\omega$ such that $f(n) < g(n)$ for all $n>N$. A set $D\subseteq \omega^\omega$ is ...

**12**

votes

**4**answers

1k views

### Sierpinski's construction of a non-measurable set

In the early 20th century there was a lot of fuss over the axiom of choice implying that there are Lebesgue non-measurable sets of reals. In his book about The Axiom of Choice, Gregory Moore points to ...

**8**

votes

**1**answer

579 views

### Application of the Riemann hypothesis and the ABC conjecture to independence results

In Old Home Page of Andreas Weiermann Andreas Weiermann has stated the following:
Quite recently I submitted a preprint about an application of the Riemann hypothesis and the ABC conjecture to ...

**6**

votes

**2**answers

258 views

### When does Skolemization require the axiom of choice?

Skolemization is often used for eliminating existential quantifiers, which is often useful for proving theorems, especially in automated resolution theorem proving. Skolemization in first order ...

**6**

votes

**1**answer

360 views

### Existence of internal toposes/inner models in a topos

It has been known for some time that one can define a topos as a model of a (finitary) essentially algebraic theory (or in other words, can be defined internal to any category with finite limits). In ...

**30**

votes

**1**answer

774 views

### Producing finite objects by forcing!

It is a trivial fact that forcing can not produce finite sets of ground model objects. However there are situations,
where we can use forcing to prove the existence of finite objects with some ...

**11**

votes

**2**answers

1k views

### Existential statement without witness

Are there existential theorems of ZFC, or PA say, with no witnesses?
Ie does there exist a formula $\phi$ such that ZFC $\vdash\exists x \phi(x)$, but for all numerals $\underline{n}$, ZFC $\nvdash ...

**2**

votes

**0**answers

66 views

### A question on recursion and transfinite recursion in extensions of KP

Is the $\Sigma_{n}$-recursion supported by $\Sigma_{n}KP=KP+\Sigma_{n}$-separation + $\Sigma_{n}$-collection equivalent with $\Sigma_{n}$ transfinite recursion? If not, how do these notions differ?

**5**

votes

**0**answers

66 views

### TCAs (total combinatory algebras) with oracles

Is there a natural, non-trivial example of a TCA (total combinatory algebra, cf. pca) with a natural notion of an oracle?