Related papers: On Constructivity and the Rosser Property: a close…
The fact that the famous Godel incompleteness theorem and the archetype of all logical paradoxes, that of the Liar, are related closely is, of course, not only well known, but is a part of the common knowledge of logician community.…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
The logics RL, RP, and RG have been obtained by expanding Lukasiewicz logic L, product logic P, and G\"odel--Dummett logic G with rational constants. We study the lattices of extensions and structural completeness of these three expansions,…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
We introduce some early considerations of physical and mathematical impossibility as preludes to the Goedel incompleteness theorems. We consider some informal aspects of these theorems and their underlying assumptions and discuss some the…
We study constrained versions of the Ingleton inequality in the entropic setting and quantify its stability under small violations of conditional independence. Although the classical Ingleton inequality fails for general entropy profiles,…
I review the classical conclusions drawn from Goedel's meta-reasoning establishing an undecidable proposition GUS in standard PA. I argue that, for any given set of numerical values of its free variables, every recursive arithmetical…
Assuming G\"odel's axiom of constructibility $V=L$, we construct a $\chi$-free abelian group $G$ of singular cardinality for some suitable cardinal $\chi$ which is regular and uncountable, equipped with the property that for every…
We construct metric spaces that do not have property A yet are coarsely embeddable into the Hilbert space. Our examples are so called warped cones, which were introduced by J. Roe to serve as examples of spaces non-embeddable into a Hilbert…
It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…
We discuss an incompleteness result proven by Bezboruah and Shepherdson. This result tells us that the weak theory ${\sf PA}^-$ does not prove the consistency of any theory (under certain assumptions explained in the paper). Kreisel argued…
Although there are several systems that successfully generate construction steps for ruler and compass construction problems, none of them provides readable synthetic correctness proofs for generated constructions. In the present work, we…
It is proved that if $T$ is a $\Sigma_{n+1}$ Definable theory which is $\Sigma_n$-sound and extends $PA$, then $T$ can not prove the sentence $\Sigma_n-sound(T)$ that expresses the $\Sigma_n$-soundness of $T$. Optimality of this result is…
Standard expositions of Goedel's 1931 paper on undecidable arithmetical propositions are based on two presumptions in Goedel's 1931 interpretation of his own, formal, reasoning - one each in Theorem VI and in Theorem XI - which do not meet…
The computable model theory of modal logic was initiated by Suman Ganguli and Anil Nerode in [4]. They use an effective Henkin-type construction to effectivize various completeness theorems from classical modal logic. This construction has…
In this paper we study structural properties of residuated lattices that are idempotent as monoids. We provide descriptions of the totally ordered members of this class and obtain counting theorems for the number of finite algebras in…
Dependence logic, introduced in [8], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the…
A set-theoretic property called Property S is introduced as a generalization of the well-known Property B. Property S is named for A.Schrijver who first used it to formulate an equivalent of the boolean prime ideal theorem. It was…
In this paper we present a new proof of Solovay's theorem on arithmetical completeness of G\"odel-L\"ob provability logic GL. Originally, completeness of GL with respect to interpretation of $\Box$ as provability in PA was proved by R.…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…