Related papers: Librationism & its classical and extraclassical se…
We develop librationism, {\pounds}, and clarify some mathematical and philosophical matters which relate to the particular manner in which it deals with the paradoxes and to its usefulness as a foundation for mathematics and type free…
We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…
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…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…
The paper proposes a derivation system for a logic of presuppositions as introduced by P. F. Strawson. It is based on truth-relevant logic described by M. Richard Diaz in 1981. In another paper I outlined a derivation system for t-relevant…
The inconsistencies involved in the foundation of set theory were invariably caused by infinity and self-reference; and only with the opportune axiomatic restrictions could them be obviated. Throughout history, both concepts have proved to…
The paper proposes and studies new classical, type-free theories of truth and determinateness with unprecedented features. The theories are fully compositional, strongly classical (namely, their internal and external logics are both…
The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We consider the foundational relation between arithmetic and set theory. Our goal is to criticize the construction of standard arithmetic models as providing grounds for arithmetic truth (even in a relative sense). Our method is to…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
Natural philosophy integrates scientific observation with abstract frameworks, often using a mathematical Ansatz to hypothesise about physical phenomena. Exploring the possibility of other universes, however, challenges assumptions that…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we…
Discussions surrounding the nature of the infinite in mathematics have been underway for two millennia. Mathematicians, philosophers, and theologians have all taken part. The basic question has been whether the infinite exists only in…
We introduce a principle of local collection for compositional truth predicates and show that it is conservative over the classically compositional theory of truth in the arithmetical setting. This axiom states that upon restriction to…