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
200 views

“Clubiness” of projective sets of ordinals

I'm sure this is just my google-fu failing me, but: what are sufficient, non-overkill large cardinal axioms which guarantee "Every (boldface) $\Pi^1_n$ set of (real codes for) countable ordinals ...
28
votes
15answers
2k views

Objects which can't be defined without making choices but which end up independent of the choice

It happens a lot of times that when one defines a new object (ring, module, space, group, algebra, morphism, whatever) out of given data one first chooses some additional structure. And sometimes ...
18
votes
2answers
2k views

Euler's mathematics in terms of modern theories?

Some aspects of Euler's work were formalized in terms of modern infinitesimal theories by Laugwitz, McKinzie, Tuckey, and others. Referring to the latter, G. Ferraro claims that "one can see in ...
11
votes
1answer
313 views

Singular in $V$ regular in $HOD$

Prikry forcing can be used to produce a model $V$ of $ZFC$ such that fo rsome cardinal $\kappa$ we have: (1) $\kappa$ is singular in $V$ of cofinality $\omega,$ (2) $\kappa$ is regular (and in fact ...
2
votes
2answers
147 views

Henkin semantics for Second-order Logic

I know that the natural numbers can be categorically characterized in second-order logic with the standard semantics. However, I could not find an example of a non-standard Henkin structure (one that ...
11
votes
6answers
3k views

Is there a relationship between model theory and category theory?

According to Chang and Keisler's "Model Theory", Model Theory = Universal Algebra + Logic. Model theory generalized Universal Algebra in the sense that we allow relation while in Universal Algebra we ...
10
votes
0answers
305 views

c.c.c forcing notions and adding minimal generic reals

Is the following statement consistent: ``There is no non-trivial c.c.c forcing notion adding a minimal generic real''? The question is related to Prikry's question: Is it consistent that any ...
9
votes
1answer
283 views

Two questions about higher Souslin trees

Assume $V=L$ and let $\kappa$ be a Mahlo cardinal. Let $L[G]$ be the generic extension obatined by Mitchell forcing to make $2^{\aleph_0}=\aleph_2=\kappa.$ It is known that in the extension there ...
0
votes
0answers
66 views

What is the known weakest axiom system has Löb's derivability conditions?

We know that Peano Arithmetic satisfies Löb's derivability conditions, which is required in the proof of Gödel's 2nd incompleteness theorem. Is this the best result? If not, is there any known weaker ...
6
votes
5answers
251 views

Probability theory without deductive closure

Human knowledge is not deductively closed. Uncertainty can arise from that just as much as from lack of brute facts. (When a Harvard graduate was reported to have thought that the earth is farther ...
17
votes
0answers
701 views
+100

Souslin trees and weakly compact cardinals

In Souslin trees on the first inaccessible cardinal it is asked if it is consistent that there are no $\kappa-$Souslin trees at the least inaccessible cardinal $\kappa$. In this question I would like ...
12
votes
0answers
246 views

The axiom $I_0$ in the absence of $AC$

It is well-known that if $AC$ holds and if $j: L(V_{\lambda+1}) \to L(V_{\lambda+1})$ is a non-trivial elementary embedding with $crit(j) < \lambda,$ then $\lambda$ has countable cofinality (and in ...
17
votes
2answers
1k 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 ...
9
votes
0answers
226 views

Does Con(ZF + Reinhardt) really imply Con(ZFC + I0)?

The question is: if I assert in ZF that there exists a Reinhardt cardinal, do I really get a theory of higher consistency strength than when I assert in ZFC that there exists an I0 cardinal (the ...
1
vote
1answer
168 views

Non-regular languages fulfilling the Pumping Lemma

Some non-regular languages don't yield to the Pumping Lemma ($L_1=a^nb^mc^m$ should work). But now consider the set of non-regular languages L only over the alphabet {a}. (Like $L_2=a^{n^2}$ or ...
5
votes
2answers
657 views

A specific Model of ZFC

In his paper "Some Second Order Set Theory", Joel Hamkins asked whether there is a model of set theory $V$ that is elementary equivalent to $V[G]$, Whenever $G$ is $V$-generic for the collapse of a ...
4
votes
2answers
305 views

Embedding property of weakly compact cardinals

One of the characterizations of $\kappa$ being a weakly compact cardinal is being inaccessible, and for every $\kappa$-model $M$, there is a [$\kappa$-model] $N$ and an elementary embedding $j\colon ...
7
votes
2answers
333 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 ...
6
votes
1answer
238 views

moving up a consequence of PFA

The Proper Forcing Axiom (PFA) implies that every forcing which adds a subset of $\omega_1$ either adds a real or collapses $\omega_2$. Is it consistent that every forcing which adds a subset of ...
14
votes
0answers
323 views

What is the Cantor-Bendixson rank of the space of first order theories?

Let $L$ be the language $\{R\}$ containing a single binary relation symbol. Consider the space $S_0(L)$ of complete, first-order $L$-theories. This is a seperable, compact Hausdorff space; what is its ...
6
votes
0answers
167 views

Nonexistence of generic objects over $L(\mathbb{R})$

A well known result (stated and credited to Todorcevic in "Semiselective Coideals", by Farah, Mathematika, 1997, but with antecedents going back to Mathias) says that, under the appropriate large ...
3
votes
1answer
174 views

Representation of meager sets in Cohen extensions

Let $M$ be a transitive model of ZFC and $c\in {}^\omega2$ a Cohen real over $M$. Let $A$ be a meager Borel subset of $^\omega2$ in $M[c]$. I would like to prove that there exists a meager Borel set ...
4
votes
1answer
245 views

Large cardinals without choice?

For any given extension $T$ of ZFC (or perhaps NBGC or something), we can ask whether there is an extension $T'$ of ZF which does not prove AC such that $Con(T) \leftrightarrow Con(T')$ $Con(T) \to ...
30
votes
5answers
3k views

Several Topos theory questions

Hey. I have a few off the wall questions about topos theory and algebraic geometry. Do the following few sentences make sense? Every scheme X is pinned down by its Hom functor Hom(-,X) by the ...
0
votes
2answers
276 views

Non-Archimedean non-standard models for R

Let $\langle \mathbb{R}, 0, 1, +, \cdot, <\rangle$ be the standard model for $R$, and let $S$ be a countable model of $R$ (satisfying all true first-order statements in $R$). Is it true that the ...
4
votes
2answers
218 views

Is injectivity of $2^{(\ldots)}$ weaker than $\mathsf{GCH}$? [duplicate]

The following statement cannot be proven in $\mathsf{ZFC}$: (S) : If $A, B$ are sets with $|A| < |B|$, then $2^{|A|} = |{\cal P}(A)| < |{\cal P}(B)| = 2^{|B|}$. Obviously, ...
15
votes
4answers
2k views

Languages beyond enumerable

A language is a set of finite-length strings from some finite alphabet $\Sigma$. It is no loss of generality (for my purposes) to take $\Sigma=\{0,1\}$; so a language is a set of bit-strings. ...
10
votes
2answers
284 views

Slim Kurepa tree at a singular strong limit cardinal of uncountable cofinality

For a strong limit cardinal $\kappa$ the notion of $\kappa$-Kurepa tree is trivial: the full binary tree is a $\kappa$-Kurepa tree. Accordingly, we consider the following strengthening: A slim ...
12
votes
1answer
562 views

What is the precise relationship between o-minimal theory and Grothendieck's “Esquisse d'un programme”?

I have seen various references in the literature to such a connection but they tend to assume that the reader is familiar with the connection, and limit themselves to providing additional detail. So ...
7
votes
2answers
361 views

Difference between constructive Dedekind and Cauchy reals in computation

If the Axiom of Countable Choice (ACC) $$ \forall n\in \mathbb{N} . \exists x \in X . \varphi [n, x] \implies \exists f: \mathbb{N} \longrightarrow X . \forall n \in \mathbb{N} . \varphi [n, f(n)] $$ ...
4
votes
1answer
200 views

Does “Every infinite set is splittable” imply $\mathsf{AC}$? [duplicate]

We say an infinite set $X$ is splittable if there are $X_1, X_2\subseteq X$ with $X_1\cap X_2 = \emptyset$, $X_1\cup X_2 = X$ and there are bijections $\varphi:X_1\to X_2$ and $\psi:X_1\to X$. Does ...
156
votes
27answers
18k views

What are some reasonable-sounding statements that are independent of ZFC?

Every now and then, somebody will tell me about a question. When I start thinking about it, they say, "actually, it's undecidable in ZFC." For example, suppose A is an abelian group such that every ...
6
votes
1answer
340 views

Does the consistency strength hierarchy coincide with the “arithmetic consequence” hierarchy at ZF + Reinhardt?

In these slides (see especially slide 26), Steel emphasizes the phenomenon that for all known "natural" extensions of ZFC, the ordering by consistency strength agrees with the ordering by containment ...
11
votes
0answers
479 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 ...
10
votes
1answer
288 views

Uniform elimination of imaginaries

Does the following principle follow from uniform elimination of imaginaries? For every formula $\varphi(x;y)$ there is a formula $\vartheta(x;z)$ such that $$\forall y\;\exists^{=1}z\;\forall ...
3
votes
2answers
567 views

Group & modules of arbitrary cardinality [closed]

How do I see that there is a group of an arbitrary cardinality? Is this also true for abelian groups? Also, given a commutative ring $R\neq 0$ how do I see that there is an $R$-module of arbitrary ...
9
votes
0answers
446 views

Algebraic proofs of algebraic theorems about algebraically closed fields

It is well-known that the first order theory of algebraically closed fields admits quantifier elimination, whence the theory $ACF_p$ of algebraically closed fields of given characteristic $p$ is ...
23
votes
0answers
443 views

Can one divide by the cardinal of an amorphous set?

This question arose in a discussion with Peter Doyle. It is provable in ZF that one can divide by any positive finite cardinal $k$: if $X \times \{1,\ldots,k\} \simeq Y \times \{1,\ldots,k\}$ then $X ...
8
votes
1answer
206 views

Must $L_\alpha$ be correct about well-foundedness?

If $R \in L_\alpha$ is a binary relation so that $L_\alpha$ thinks $R$ is well-founded, must $R$ truly be well-founded? (Edit) That is, if $L_\alpha$ thinks that every nonempty subset of the domain of ...
3
votes
1answer
188 views

“Lexicographic” ordering on ${\cal P}(\omega)$

For $A\neq B\in {\cal P}(\omega)$ we set $$\mu(A,B) = \min\big((A\setminus B)\cup (B\setminus A)\big).$$ We define $A < B$ if and only if $A \neq B$, and $A = B\cap \mu(A,B)$ (that is $A$ is an ...
6
votes
1answer
191 views

Theorem of Bukovsky characterizing ground models

It was mentioned in a talk that Bukovsky proved the following are equivalent for inner models $M \subseteq V$: (1) There is a partial order $\mathbb P \in M$ and a $\mathbb P$-generic filter $G \in ...
1
vote
0answers
29 views

Quantifier elimination of pp-subgroups of modules

This is a model-theoretic questions. Let $M$ be a $R$-module. Our language will be the standard language of modules, i.e. the language of abelian groups together with an unary function symbol for ...
6
votes
0answers
227 views

Coherence and rewriting

In category theory there are numerous coherence theorems (https://ncatlab.org/nlab/show/coherence+theorem). One example is the Mac Lane's coherence theorem for monoidal categories. This and probably ...
5
votes
1answer
180 views

Easier Girard's paradox in a circular pure type system (PTS)

System U is an inconsistent PTS in that one has a term of type $\bot = \forall p\colon \ast \ldotp p$, and such a term is explicitly constructed in Hurkens' A Simplification of Girard's Paradox. ...
15
votes
2answers
609 views

$\mathfrak{ufo}$: An unidentified combinatorial cardinal characteristic of the continuum?

An ultrafilter ornament is a chain of free filters on $\mathbb{N}$ that are not ultrafilters, whose union is an ultrafilter. Let $\mathfrak{ufo}$ be the minimal cardinality of an ultrafilter ...
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 ...
6
votes
1answer
192 views

Fat stationary sets

Recall a stationary subset $S$ of a regular cardinal $\kappa$ is fat when for every $\alpha < \kappa$, and every club $C$, there is a closed set of order type $\alpha$ contained in $S \cap C$. It ...
8
votes
1answer
170 views

Is there a modern account of Veblen functions of *several* variables?

Veblen $\phi$ functions extend the $\xi \mapsto \phi(\xi) := \omega^\xi$ and the $\xi \mapsto \phi(1,\xi) := \varepsilon_\xi$ functions on the ordinals by repeatedly taking fixed points (I won't ...
5
votes
1answer
222 views

Iteration of random reals

Consider two random reals $x, y$ over a transitive model $V$ of ZFC. More specifically, if $\mathcal C^V={}^\omega2$ is the Cantor space, composing the canonical homeomorphism with the projections ...
2
votes
1answer
136 views

Posets (partially ordered sets) in equational logic

I know about equational logic, cf. https://en.wikipedia.org/wiki/Lattice_(order)#Lattices_as_algebraic_structures, and understood that lattices are expressed equationally, i.e., in terms of equational ...