first-order and higher-order logic, model theory, set theory, proof theory, computability theory, formal languages, definability, interplay of syntax and semantics, constructive logic, intuitionism, philosophical logic, modal logic, completeness, Gödel incompleteness, decidability, undecidability, ...

learn more… | top users | synonyms (1)

7
votes
1answer
337 views

Is every ordinal potentially definable?

It is easy to see that, if $V\models\alpha>\omega_1^{CK}$, then $\alpha$ is not recursive in any forcing extension of $V$. The argument goes as follows: The relation "$\Phi_e=r$" is $\Pi^0_2$. ...
11
votes
0answers
310 views

Large cardinals arising from alternate set theories

My question is whether there are model-theoretic large cardinal axioms associated with $NFU$ - or more generally, with set theories other than $ZFC$. Large cardinal properties generally come in one ...
7
votes
1answer
214 views

Proof-theoretic ordinals after liberalizing induction to $RCA_0$

This is kind of a follow-up to this question. For a class $\Gamma$ of second-order formulas (here either $\Sigma_n^0$ or $\Sigma_n^1$), let $X\Gamma$ be a formal theory consisting of $RCA_0$ together ...
12
votes
1answer
243 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 ...
5
votes
2answers
184 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 ...
3
votes
0answers
99 views

A question regarding forcing in $NGBC^{-f}$+$BAFA$

Suppose one has a model $M$$\vDash$$NGBC^{-f}$+BAFA. Does there exist a (class) forcing extension $M[G]$$\vDash$$NGBC^{-f}$+$BAFA$ that has a submodel $N$$\vDash$$NGB^{-f}$+$BAFA$+$\lnot$$AC$? Can ...
3
votes
1answer
195 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 ...
4
votes
2answers
139 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. ...
6
votes
1answer
92 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
0answers
73 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 ...
9
votes
0answers
157 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 ...
13
votes
1answer
227 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 ...
9
votes
1answer
119 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 ...
10
votes
0answers
154 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 ...
29
votes
7answers
2k 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 ...
10
votes
1answer
418 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 ...
8
votes
0answers
218 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.) ...
21
votes
2answers
743 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 ...
16
votes
1answer
483 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 ...
14
votes
2answers
552 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 ...
10
votes
0answers
240 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$. ...
4
votes
1answer
105 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 ...
7
votes
1answer
342 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 ...
2
votes
1answer
105 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 ...
6
votes
1answer
152 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 ...
8
votes
2answers
374 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 ...
21
votes
0answers
544 views

Relative null-ness

Here, "measure" always means Lebesgue measure on $\mathbb{R}$. This question is partly motivated by my answer ...
4
votes
1answer
126 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 ...
2
votes
2answers
199 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
2answers
115 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?
8
votes
0answers
106 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 ...
6
votes
0answers
241 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, ...
11
votes
1answer
239 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 ...
3
votes
1answer
132 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 ...
7
votes
1answer
219 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.
6
votes
0answers
152 views

How “small” can an ordinal be made by forcing?

I know that forcing essentially does not change the ordinals, but by small I mean in comparison with other ordinals whose definition might not be stable under forcing, like the smallest uncountable ...
8
votes
0answers
217 views

On an unpublished result of Magidor

In 1970th, Magidor proved the following important results: (1) Assuming the existence of a supercompact cardinal, it is consistent that $\aleph_\omega$ is strong limit and ...
2
votes
1answer
179 views

Notation: $Sigma$ and $Pi$ of intersections

In Jech - Set Theory, the proof of Theorem 31.7, I came along some notations I wish to understand correctly. For a countable elementary substructure $M \prec H_\lambda$ and $A \in M$ and a generic ...
1
vote
2answers
142 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 ...
3
votes
1answer
276 views

On generic forcing conditions

Let $P$ be a forcing poset, and $Q \in V^P$ a forcing poset in $V^P$. Let $M \prec H(\lambda)$ ($\lambda$ sufficiently large) countable with $P,Q \in M$. What I want to know is if then the following ...
5
votes
1answer
331 views

What are key $\Sigma^0_2$ or $\Pi^0_3$ theorems?

I am researching a logical system that is limited to $\Pi^0_2$ sentences and I am busy to prove that FOL + PA is a conservative extension of that system. Meaning that with $\Sigma^0_n$ sentences (that ...
3
votes
0answers
101 views

Cardinality based results in Topological Vector Spaces?

Given a topological vector space $V$, let its density be the smallest cardinal $A$ such that a set of cardinality $A$ is dense in $V$. Naively, it seems one of two things happen: TVS's $V$ of ...
3
votes
1answer
195 views

May open sentences be eliminated?

Saul Kripke famously invoked a free logic to avoid validating the Barcan Formula and its converse. In that context he adduced a generality interpretation of free variables. The converse of the Barcan ...
3
votes
1answer
106 views

Understanding Corollary 3, Sec. 5.6, of Papadimitriou's Computational Complexity

I am struggling to understand Corollary 3 from Section 5.6 of Papadimitriou's Complexity Theory book (Addison-Wesley, 1993). It got me completely confused... If anyone out there has read it and ...
2
votes
0answers
129 views

RCS iteration such that the RCS limit is semi-proper

For a countable ordinal $\eta$ and an ordinal $\gamma$ let $\langle P_\alpha, \dot{Q}_\alpha \colon \alpha < \gamma \rangle$ be an RCS iteration with RCS limit $P_\gamma$, such that ...
6
votes
2answers
245 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 ...
6
votes
2answers
311 views

Is every non-empty $\Delta_0$ set provably the range of some primitive recursive function?

Suppose $A(x)$ is a $\Delta_0$ formula defining a non-empty set of natural numbers. It's an easy theorem that there is a primitive recursive function $f:\mathbb{N} \rightarrow \mathbb{N}$ such that ...
4
votes
1answer
302 views

“set of all irreducible representations of a group”, set-theoretic issues [closed]

I am working on a problem related to representations of the Weil group of a local field $\mathcal{W}_F$. In many articles one introduces the set $\hat{\mathcal{W}}_F$ of all equivalence classes of ...
8
votes
0answers
274 views

A Banach-Tarski game

This is partially inspired by the question http://math.stackexchange.com/questions/1383397/cutting-a-banach-tarski-cake, which I find intriguing if unclearly written. A paradoxical family of subsets ...
3
votes
3answers
696 views

In which sense “closure” is a closure?

In predicate and first-order logic, if $\phi$ is a sentence, then $\forall X . \phi$ is said to be the (universal) closure of $\phi$. Is the use of the word "closure" incidental, or is there a ...