Related papers: Peirce's Truth-functiona Analysis and the Origin o…
The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead…
According to various no-go results in the foundations of quantum mechanics, for any system associated to a Hilbert space of dimension higher than two, it is not possible to assign definite truth values to all propositions pertaining to the…
The framework of Pearl's Causal Hierarchy (PCH) formalizes three types of reasoning: probabilistic (i.e. purely observational), interventional, and counterfactual, that reflect the progressive sophistication of human thought regarding…
In 1952 P. F. Strawson proposed a logic of presuppositions. It is an interpretation of Aristotelian logic, i.e. of the logic of the traditional syllogism. In 1981 Richard Diaz published a monograph in which he presented truth-relevant…
Kobayashi introduced a uniform notion of compressibility of infinite binary sequences in terms of relative Turing computations with sub-identity use of the oracle. Kobayashi compressibility has remained a relatively obscure notion, with the…
In this work we discuss the failure of the principle of truth functionality in the quantum formalism. By exploiting this failure, we import the formalism of N-matrix theory and non-deterministic semantics to the foundations of quantum…
The role of probability appears unchallenged as the key measure of uncertainty, used among other things for practical induction in the empirical sciences. Yet, Popper was emphatic in his rejection of inductive probability and of the logical…
Computability logic (CL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally…
This paper develops a proof-theoretic framework for abstract interpretation by systematically associating logical systems with finite abstractions. Building on earlier work on the internal logics of abstractions, we propose a general…
The concept of informal mathematical proof considered in intuitionism is apparently vulnerable to a version of the liar paradox. However, a careful reevaluation of this concept reveals a subtle error whose correction blocks the…
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…
To account for the first proof of existence of an irrational magnitude, historians of science as well as commentators of Aristotle refer to the texts on the incommensurability of the diagonal in Prior Analytics, since they are the most…
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html . The present paper contains a soundness…
We examine the classical/intuitionist divide, and how it reflects on modern theories of infinitesimals. When leading intuitionist Heyting announced that "the creation of non-standard analysis is a standard model of important mathematical…
This article reviews and develops an epistemological tradition in the philosophy of science, known as convergentism, which holds that inference methods should be assessed based on their ability to converge to the truth across a range of…
Refutation calculi are formal systems developed to derive the invalid formulas of a given logic. While the notion of refutation calculi has played a key role in the development of tableaux calculi, a refutation approach to display calculi…
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger…
An apparent paradox in Einstein's Special Theory of Relativity, known as a Thomas precession rotation in atomic physics, has been verified experimentally in a number of ways. However, somewhat surprisingly, it has not yet been demonstrated…
A wide range of intuitionistic type theories may be presented as equational theories within a logical framework. This method was formulated by Per Martin-L\"{o}f in the mid-1980's and further developed by Uemura, who used it to prove an…