Related papers: Truth, Disjunction, and Induction
The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…
Librationist set theory \pounds ${}$ is developed. It descends from semantics for truth, initiated by Kripke, and others. # extends \pounds, of Librationist closures of the paradoxes in Logic and Logical Philosophy 21(4), 323-361, 2012.…
In this paper a class of languages which are formal enough for mathematical reasoning is introduced. First-order formal languages containing natural numbers and numerals belong to that class. Its languages are called mathematically…
In-In perturbation theory is a vital tool for cosmology and nonequilibrium physics. Here, we reconcile an apparent conflict between two of its important aspects with particular relevance to De Sitter/inflationary contexts: (i) the need to…
In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…
In 2010, Vladimir Voevodsky gave a lecture on "What If Current Foundations of Mathematics Are Inconsistent?" Among other things he said that he was seriously suspicious that an inconsistency in PA (first-order Peano arithmetic) might…
In the following paper we propose a model-theoretical way of comparing the "strength" of various truth theories which are conservative over PA. Let $\mathfrak{Th}$ denote the class of models of PA which admit an expansion to a model of…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…
In the paper, the question whether truth values can be assigned to the propositions before their verification is discussed. To answer this question, a notion of a propositionally noncontextual theory is introduced that in order to explain…
A first order theory T is said to be "tight" if for any two deductively closed extensions U and V of T (both of which are formulated in the language of T), U and V are bi-interpretable iff U = V. By a theorem of Visser, PA (Peano…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…
I outline a new theory of truth that resolves the classical and constructive versions of the liar paradox. The theory features a provably consistent axiomatization of a global self-applicative truth predicate. Truth is defined using…
In this paper we provide a (negative) solution to a problem posed by Stanis{\l}aw Krajewski. Consider a recursively enumerable theory U and a finite expansion of the signature of U that contains at least one predicate symbol of arity $\ge$…
We prove that, over Kripke-Platek set theory with infinity (KP), transfinite induction along the ordinal ${\epsilon}_{\Omega+1}$ is equivalent to the schema asserting the soundness of KP, where $\Omega$ denotes the supremum of all ordinals…
We exhibit canonical middle-inverse Choice maps within categorical (Free-Variable) Theory of Primitive Recursion as well as in Theory of partial PR maps over the Theory of Primitive Recursion with predicate abstraction. Using these…
The paper explores applications of Kripke's theory of truth to semantics for anti-luck epistemology, that is, to subjunctive theories of knowledge. Subjunctive theories put forward modal or subjunctive conditions to rule out knowledge by…
We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…