**9**

votes

**1**answer

104 views

### Forcings that are not equivalent to Levy collapse

Assume GCH and that $\kappa$ is a regular uncountable cardinal. Let $\mathbb{P}$ be a separative, $<\kappa$-directed closed, nowhere trivial, $\kappa^+$-cc poset of size $\kappa^+$. Must ...

**3**

votes

**2**answers

129 views

### Lefschetz Principle for semisimplicity

I think I can prove the following using the compactness of first order logic and I am wondering what a purely algebraic proof would look like.
Let $R$ be a unital ring (not necessarily ...

**7**

votes

**1**answer

527 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 ...

**6**

votes

**4**answers

2k views

### Does the derivative of log have a Dirac delta term?

Dirac writes down the following formula on page 61 of his "Principles of quantum mechanics":
$\frac{d}{dx}\log x = \frac{1}{x} -i\pi\delta(x)$, see http://adsabs.harvard.edu/abs/1947pqm..book.....D ...

**1**

vote

**0**answers

24 views

### Relation between indexed languages (OI-macro or context-free tree) and scattered context languages

I'm not sure about the relation between indexed languages (generated by indexed grammars--Aho) and scattered context languages (generated by
scattered context grammars--J Hopcroft).
I think that ...

**6**

votes

**2**answers

962 views

### Using the multiverse approach to decide the law of the exluded middle?

Recently, in response to deciding the Continuum Hypothesis $CH$, Hamkins and Gitman have proposed consider a multiverse of set-theoretic universes, some in which $CH$ is true, some in which $\neg CH$ ...

**45**

votes

**8**answers

3k views

### Has anyone thought about creating a formal proof wiki with verifier?

Mathematics has undergone some rather nice developments recently with the adoption of new techologies, things like on-line journals, the arXiv, this website, etc. I imagine there must be many further ...

**2**

votes

**2**answers

89 views

### What can be achieved by liberalizing induction for $RCA_0$?

$RCA_0$ has $\Delta_0$-comprehension and $\Sigma_1$ induction. Let $X\Sigma_{n}$ be $RCA_0$ plus $\Sigma_n$-induction and let $X\Sigma_{\omega}$-induction be $RCA_0$ plus the full induction schema.
...

**3**

votes

**1**answer

117 views

### Compactness of Lukasiewicz Logic

I'm interested in Fuzzy logic. I have read that the compactness theorem holds for predicate Lukasiewicz logic, with semantics over $[0,1]$.
However I found the following question on mathoverflow ...

**7**

votes

**0**answers

41 views

### Does non-stablity imply that there is a difference between non-forking and coheir extension

Fix some theory $T$.
Let $p$ be a type over some Model M and let $q$ be some global extension of $p$.
Note:
The number of global coheirs of $p$ is bounded by the number of ultrafilters on $M$.
Also ...

**5**

votes

**1**answer

65 views

### Does $WKL_0$ provide more comprehension than $RCA_0$?

$WKL_0$ extends $RCA_0$ with the statement that any infinite subset of the infinite binary tree has an infinite branch. Does $WKL_0$ Prove that there are sets which are not proven to exist by the ...

**2**

votes

**0**answers

64 views

### Which self-reference restrictions can be weakened in probabilstic logic?

This work suggests that there is some generalization of Truth in terms of probability, which can be definable within the logic itself.
Is where any other thorems on self-reference restrictions, which ...

**7**

votes

**0**answers

134 views

### From interpolation to separation

Lusin's separation theorem states that, if $A$ and $B$ are disjoint analytic subsets of a Polish space, then there is a Borel set $X$ separating them ($A\subseteq X$, $B\cap X=\emptyset$). Craig's ...

**-4**

votes

**0**answers

38 views

### Proof for sequent (Logic) [closed]

I'm currently trying to prove the following:
http://i.imgur.com/dACOdOS.png
And this is what I've come up with so far:
And now I'm stuck. Perhaps the next step might be to eliminate for all x?
...

**15**

votes

**1**answer

831 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 ...

**56**

votes

**4**answers

7k 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 ...

**8**

votes

**0**answers

78 views

### Near model completeness

A theory $T$ is called near model complete if every formula is equivalent to a Boolean combination of existential formulas mod $T$. I wonder whether there is an equivalent "semantic" definition of ...

**18**

votes

**5**answers

1k views

### Why should we believe in the axiom of regularity?

Today I started reading Maddy's Believing the axioms. As I knew beforehand, it includes some discussion of ZFC axioms. However, I really hoped for a more extensive discussion of axiom of ...

**8**

votes

**0**answers

133 views

### Homogeneity of a variant of Prikry forcing

Prikry forcing is easily seen to be cone homogeneous (for any $p, q \in \mathbb{P}$, there are $p' \leq p, q' \leq q$ and an isomorphism $\Phi: \mathbb{P}/p' \simeq \mathbb{P}/q'$); in particular for ...

**10**

votes

**0**answers

226 views

### When does $HOD^{V[G]} \subseteq V$?

Assume that $\mathbb{P}\in HOD$ is non-trivial. It is well-known that if $\mathbb{P}$
satisfies some homogeneity properties, then $HOD^{V[G]} \subseteq V$, where $G$ is $\mathbb{P}$-generic over $V$.
...

**8**

votes

**1**answer

347 views

### Cardinality of definable sets of reals

Throughout this question we assume ZFC.
If CH holds, then the following is obvious:
(S) Every definable infinite subset of $\mathbb R$ has size either $\aleph_0$ or $2^{\aleph_0}$.
(It's true ...

**20**

votes

**2**answers

635 views

### Antirandom reals

This is a crossposting of http://math.stackexchange.com/questions/1446602/anti-random-reals, which has not gotten any answers; after thinking about the problem, I've become more convinced that it ...

**7**

votes

**0**answers

190 views

### What is the name for a Banach space property closed under ultraproducts?

In Banach space theory, a super-property is a property of a Banach space that is preserved under ultrapowers. (Update (2015-09-28): The property must also be closed under isometric embeddings.) ...

**14**

votes

**1**answer

358 views

### Two strengthenings of “strong measure zero”

A set $X\subseteq\mathbb{R}$ is strong measure zero if, for every sequence $(\epsilon_i)_{i\in\mathbb{N}}$ of positive reals, there is a sequence $(I_i)_{i\in\mathbb{N}}$ of open intervals covering ...

**13**

votes

**2**answers

508 views

### Who needs RCS iterations?

According to this paper of Chaz Schlindwein, any countable support iteration of semi-proper forcings is semi-proper. This seems like a breakthrough simplification, and I wonder why it is not more ...

**2**

votes

**1**answer

160 views

### Is there an easy decision algorithm for the inhabitation problem for simple types?

Consider the basic system of simple types usually known as $TA_\lambda$. One can prove that (as a consequence of the Subject Reduction Property and the fact that any typable term is strongly ...

**21**

votes

**0**answers

512 views

### Relative null-ness

Here, "measure" always means Lebesgue measure on $\mathbb{R}$. This question is partly motivated by my answer ...

**3**

votes

**1**answer

79 views

### Is DNC/DNR stronger than “prompt” non-computability?

We propose a (probably not new) definition. Let $\varphi_e$ be an effective enumeration of the partial computable functions.
A total function $f$ is promptly non-computable (PNC) [or promptly ...

**6**

votes

**1**answer

287 views

### Is the axiom schema of replacement used in algebraic number theory (or more generally outside logic)

Here's a precise question. Does Wiles' proof of FLT run just fine in the set theory that logicians would perhaps call "Zermelo + choice" -- i.e. drop the axiom schema of replacement but assume the ...

**1**

vote

**1**answer

82 views

### What are the adequacy conditions for Rosser Provability?

Famously, Rosser introduced a provability predicate $\pi[A]$ that holds iff $\exists x(xP[A]\wedge\forall y(y\le x\to\lnot yP[\lnot A]))$.
Supposing $PA$ is consistent, what are the adequacy ...

**5**

votes

**1**answer

134 views

### Different ways of making $HOD$ far from $V$

There are different criteria for building a model $V$ of $ZFC$ which is far from its
$HOD$, for example:
$(A)$ Cardinality criteria: For this in a joint work with James Cummings and Sy Friedman, we ...

**7**

votes

**2**answers

329 views

### Some “axiom of choice” and “dependent choice” issues

I am probably about to ask some fairly basic questions, and yet I have found it quite hard to find the answers to these.
If I understand correctly, mathematicians tend to be quite happy working with ...

**2**

votes

**1**answer

97 views

### Analogy of $\omega$-models in constructive mathematics

I apologize that this question is a bit vague, however that is partially the point.
In subsystems of second order arithmetic, one considers $\omega$-models, these are models of $\mathsf{RCA}_0$ whose ...

**1**

vote

**1**answer

105 views

### type theory that does not treat the terms of $\mathrm{Prop}$ as types

In type theory there is a type $\mathrm{Prop}$ that contains every proposition, so $p\colon\mathrm{Prop}$ (in words, "$p$ is of type $\mathrm{Prop}$") where $p$ is a proposition. In all type theories ...

**1**

vote

**0**answers

58 views

### Common solutions for a set of inequalities [migrated]

First, please tolerate my stupidity. I'm a Software Engineering guy with minimal background in maths.
Suppose I have a set of first-order formulas over the theory of linear arithmetic: $\varphi_1, ...

**0**

votes

**2**answers

98 views

### classical typed higher order logic natural deduction

Has somebody worked out a typed higher order logic? I mean something like type theory but not with this intuitionistic touch.
Is there a natural deduction system for this logic?

**6**

votes

**0**answers

87 views

### Two cardinal obstructions

Given a theory $T$ and a formula $\phi(x)$ we say that they admit a $(\kappa, \lambda)$ model if there is a model $M$ such that $|M| = \kappa$ and $|\phi(M)| = \lambda$.
In all examples that I know ...

**83**

votes

**9**answers

13k views

### Solutions to the Continuum Hypothesis

Related MO questions: What is the general opinion on the Generalized Continuum Hypothesis? ; Completion of ZFC ; Complete resolutions of GCH; How far wrong could the Continuum Hypothesis be?
...

**6**

votes

**2**answers

231 views

### A question regarding strong cardinals and measure sequence

Let $E$ be a $(\kappa, \lambda)$-extender such that $j: V\to M\simeq Ult(V,E)$ is the corresponding elementary embedding with critical point $\kappa$, $M\supset V_{\kappa+2}$, $M^\kappa\subset M$. Let ...

**5**

votes

**0**answers

231 views

### The least admissible above a dominating real

Let $\mathbb{P}$ be the usual forcing which adds a dominating real: conditions in $\mathbb{P}$ are pairs $(p, f)$ with $p:\omega\rightarrow\omega$ finite partial and $f:\omega\rightarrow\omega$ total, ...

**2**

votes

**1**answer

107 views

### Potentiality classes and Borel reductions

In a 1998 paper by Hjorth, Kechris, and Louveau, there was a definition given of a "potentiality class." That is, given an invariant equivalence relation $E$ on a standard Borel space $X$, we say $E$ ...

**4**

votes

**2**answers

271 views

### Equational theories determined by “identities without variables”

How to characterize equational theories $T$ which have the following property: for any two terms $t(x_1,...,x_n)$ and $t'(x_1,...,x_n)$ in the signature of $T$, if for any closed terms (i. e. terms ...

**13**

votes

**3**answers

901 views

### Which recursively-defined predicates can be expressed in Presburger Arithmetic?

In Presburger Arithmetic there is no predicate that can express divisibility, else Presburger Arithmetic would be as expressive as Peano Arithmetic. Divisibility can be defined recursively, for ...

**5**

votes

**1**answer

182 views

### Fuzzy logic of Godel

In Gödel logic, is conjunction definable from implication, negation , and disjunction?
We know that conjunction in that logic is not definable from negation and implication.

**10**

votes

**1**answer

225 views

### Partition relation at successor cardinal

Is it consistent that there are regular cardinals $\kappa < \lambda$, such that $\lambda$ is a successor cardinal and for every coloring $d\colon[\lambda]^2\to\kappa$ there is some ...

**21**

votes

**6**answers

2k views

### undecidable sentences of first-order arithmetic whose truth values are unknown

Godel's undecidable sentences in first-order arithmetic were guaranteed to be true, by construction. But are there examples of specific sentences known to be undecidable in first-order arithmetic ...

**2**

votes

**1**answer

120 views

### Does totally proper forcing imply countable distributivity?

For a suitable model $M$ for $Q$ and a condition $q \in Q$ we say that $q$ is $(M,Q)$-generic if whenever $r \leqslant q$, $D \in M$ dense, $D \subset Q$, $r$ is compatible with an element of $D \cap ...

**24**

votes

**5**answers

21k views

### How large is TREE(3)?

Friedman, in http://www.math.osu.edu/~friedman.8/pdf/EnormousInt112201.pdf, shows that TREE(3) is much larger than n(4), itself bounded below by $A^{A(187195)}(3)$ (where $A$ is the Ackerman ...

**15**

votes

**2**answers

2k views

### Logically independent but true sentences

My question is of a logical nature and concerns what I perceive to be two different types of mathematical independence.
Suppose we have a (sufficiently strong) axiomatic theory $T$. Gödel's ...

**2**

votes

**2**answers

131 views

### Precise interpretability strength of $\mathcal P_{DF}(\omega)$ and $L_{\omega_1^{CK}}$

I am curious about the relationship between the definable power set of $\omega$ and the $\omega_1^{CK}$th level of the constructible sets $L$.
In short, $\omega_1^{CK}$ is the least nonrecursive ...