Related papers: On the Constructive Truth and Falsity in Peano Ari…
Unlike mathematics, in which the notion of truth might be abstract, in physics, the emphasis must be placed on algorithmic procedures for obtaining numerical results subject to the experimental verifiability. For, a physical science is…
We state a construction theorem for specifications starting from single-site conditional probabilities (singleton part). We consider general single-site spaces and kernels that are absolutely continuous with respect to a chosen product…
The aim of this work is to show that contemporary mathematics, including Peano arithmetic, is inconsistent, to construct firm foundations for mathematics, and to begin building on these foundations.
In this Phd. thesis, a structural analysis of construction schemes is developed. The importance of this study will be justified by constructing several distinct combinatorial objects which have been of great interest in mathematics. We then…
Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
We present two new constructions of satisfaction/truth classes over models of PA (Peano Arithmetic) that provide a foil to the fact that the existence of a disjunctively correct full truth class over a model M of PA implies that Con(PA)…
A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…
This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…
Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…
We study various formulations of the completeness of first-order logic phrased in constructive type theory and mechanised in the Coq proof assistant. Specifically, we examine the completeness of variants of classical and intuitionistic…
We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with $\Delta_0$-induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano…
I shall argue that a resolution of the PvNP problem requires building an iff bridge between the domain of provability and that of computability. The former concerns how a human intelligence decides the truth of number-theoretic relations,…
In this short paper, I present a few theorems on sentences of arithmetic which are related to Yablo's Paradox as G\"odel's first undecidable sentence was related to the Liar paradox. In particular, I consider two different arithemetizations…
Almost two decades ago, Wattenberg published a paper with the title 'Nonstandard Analysis and Constructivism?' in which he speculates on a possible connection between Nonstandard Analysis and constructive mathematics. We study Wattenberg's…
We introduce a tool for analysing models of $\textnormal{CT}^-$, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan's theorem that arithmetical part of models of $\textnormal{PA}$ are recursively…
This is an exposition of facts about Arithmetic with an approach via mathematical logic. In Section 1 we present Peano Arithmetic, PA, and the complete theory of $\mathbb{N}$, and we show that $\mathbb{N}$ is a prime model of the theory of…
A constructive proof of the Goedel-Rosser incompleteness theorem has been completed using the Coq proof assistant. Some theory of classical first-order logic over an arbitrary language is formalized. A development of primitive recursive…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…