Related papers: Goedel's Incompleteness Theorems hold vacuously
The generally accepted wisdom in computational circles is that pure proof verification is a solved problem and that the computationally hard elements and fertile areas of study lie in proof discovery. This wisdom presumably does hold for…
In this paper we prove that three of the main propositional logics of dependence (including propositional dependence logic and inquisitive logic), none of which is structural, are structurally complete with respect to a class of…
Different from the view that information is objective reality, this paper adopts the idea that all information needs to be compiled by the interpreter before it can be observed. From the traditional complexity definition, this paper defines…
The set-theoretical model of Goedel's system T is not fully abstract. We also briefly discuss fully abstract models of system T.
We prove a strong non-structure theorem for a class of metric structures with an unstable pair of formulae. As a consequence, we show that weak categoricity (that is, categoricity up to isomorphisms and not isometries) implies several…
In 1994 Jech gave a model theoretic proof of G\"odel's second incompleteness theorem for Zermelo-Fraenkel set theory in the following form: ZF does not prove that ZF has a model. Kotlarski showed that Jech's proof can be adapted to Peano…
There are many deep results on the structure of REGULAR probability measures $P(G)$ on compact/locally compact, Hausdorff topological groups G. See, for instance, the classic monographs by KR Parthasarathy, Ulf Grenander, A.Mukherjea and…
The standard interpretation of first-order number theory (PA), according to the generally accepted view, associates well-defined set-theoretic entities with each and every well-formed formula of this system. But this implies that the class…
We investigate relationships between versions of derivability conditions for provability predicates. We show several implications and non-implications between the conditions, and we discuss unprovability of consistency statements induced by…
The persisting gap between the formal and the informal mathematics is due to an inadequate notion of mathematical theory behind the current formalization techniques. I mean the (informal) notion of axiomatic theory according to which a…
In an empirical logic, an experimentally verifiable proposition P relating to a quantum system is assigned the value of either true of false if the system is in the pure state that belongs or, respectively, does not belong to the Hilbert…
It is demonstrated that, unless the meaning of conformal transformations for the underlying geometrical structure is discussed on a same footing as it is done for the equations of the given gravity theory, the notion of "conformal…
In a previous paper, the author (together with Matthew Emerton) proved that the completed cohomology groups of SL_N(Z) are stable in fixed degree as N goes to infinity (Z may be replaced by the ring O_F of integers of any number field). In…
Despite the failure of the integral Hodge conjecture, we show that the rational Hodge conjecture implies an integral version (modulo torsion) of the absolute Hodge conjecture.
For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
Based on the MRDP theorem concerning the Hilbert tenth problem, there is a corresponding Diophantine equation called proof equation for every formula of the First-order Peano Arithmetic (PA). A formula is provable in PA, if and only if the…
The proof of the relative consistency of the axiom of choice has been mechanized using Isabelle/ZF. The proof builds upon a previous mechanization of the reflection theorem. The heavy reliance on metatheory in the original proof makes the…
In many axiomatic set theories, G\"odel's constructible universe $L$ is known as an inner model, that is, a definable class satisfying the same axioms (and containing the same ordinals). This gives a trivial proof that adding the axiom $V =…
We consider the decidability of the verification problem of programs \emph{modulo axioms} --- that is, verifying whether programs satisfy their assertions, when the functions and relations it uses are assumed to interpreted by arbitrary…