Related papers: Incompleteness and Jump Hierarchies

We prove under $V=L$ that the inclusion modulo the non-stationary ideal is a $\Sigma_1^1$-complete quasi-order in the generalized Borel-reducibility hierarchy ($\kappa>\omega$). This improvement to known results in $L$ has many new…

In this work we use a notion of rank first introduced by James Baumgartner and Peter Dordal and later developed independently by the third author to show that adding a Hechler real has strong combinatorial consequences. We prove: 1)…

In this paper, we compute the cohomology class of certain "special maximal-rank loci" originally defined by Aprodu and Farkas. By showing that such classes are nonzero, we are able to verify the non-emptiness portion of the Strong Maximal…

This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…

We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…

Suppose that $A$ is a finite nilpotent group of odd order acting good in the sense of \cite{EGJ} on the group $G$ of odd order. Under some additional assumptions we prove that the Fitting height of $G$ is bounded above by the sum of the…

We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…

Borel separation rank of an analytic ideal $\mathcal{I}$ on $\omega$ is the minimal ordinal $\alpha<\omega_{1}$ such that there is $\mathcal{S}\in\bf{\Sigma^0_{1+\alpha}}$ with $\mathcal{I}\subseteq \mathcal{S}$ and $\mathcal{I}^\star\cap…

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…

The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Analogous to G\"odel's incompleteness theorems is a theorem in physics to the effect that the set of explanations of given evidence is uncountably infinite. An implication of this theorem is that contact between theory and experiment…

Let $A$ be a non-zero abelian variety over a field $F$ that is not algebraic over a finite field. We prove that the rational rank of the abelian group $A(F)$ is infinite when $F$ is large in the sense of Pop (also called ample). The main…

A bi-order on a group $G$ is a total, bi-multiplication invariant order. A subset $S$ in an ordered group $(G,\leqslant)$ is convex if for all $f\leqslant g$ in $S$, every element $h\in G$ satisfying $f\leqslant h \leqslant g$ belongs to…

A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…

I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…

This short squib looks at how using a broader definition of G\"odel numbering to mimic the accessibility relation between possible worlds results in two-world systems that sidestep undecidable sentences as well as the Liar paradox.

It is argued that Goedel's incompleteness theorem should be seen as self-evident, rather than unexpected or surprising.

We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…

Let WO$(\omega^\omega)$ be the statement that the ordinal number $\omega^\omega$ is well ordered. WO$(\omega^\omega)$ has occurred several times in the reverse-mathematical literature. The purpose of this expository note is to discuss the…