Related papers: Extending Cantor Paradox
This is an examination, a commentary, of links between some philosophical views ascribed to G\"odel and general proof theory. In these views deduction is of central concern not only in predicate logic, but in set theory too, understood from…
It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…
We associate in a canonical way a substitution to any abstract numeration system built on a regular language. In relationship with the growth order of the letters, we define the notion of two independent substitutions. Our main result is…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
Any system based on axioms is incomplete because the axioms cannot be proven from the system, just believed. But one system can be less-incomplete than other. Neutrosophy is less-incomplete than many other systems because it contains them.…
The independence of the continuum hypothesis is a result of broad impact: it settles a basic question regarding the nature of N and R, two of the most familiar mathematical structures; it introduces the method of forcing that has become the…
A new concept, primitive chaos, was proposed, as a concept closely related to the fundamental problems of sciences themselves such as determinism, causality, free will, predictability, and time asymmetry [{\em J. Phys. Soc. Jpn.} {\bf…
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…
Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…
We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…
Chaitin's incompleteness theorem states that sufficiently rich formal systems cannot prove lower bounds on Kolmogorov complexity. In this paper we extend this theorem by showing theories that prove the Kolmogorov complexity of a large (but…
This thesis presents the strong and weak forms of the Banach-Tarski paradox based on the Hausdorff paradox. It provides modernized proofs of the paradoxes and necessary properties of equidecomposable and paradoxical sets. The historical…
According to Chaitin, G\"odel once told him "it doesn't matter which paradox you use [to prove the First Incompleteness Theorem]". In this paper I will present a few infinitary paradoxes and show how to "translate" them to some undecidable…
Since the seminal paper by Tversky and Kahneman, the conjunction fallacy has been the subject of multiple debates and become a fundamental challenge for cognitive theories in decision-making. In this article, we take a rather uncommon…
The long lasting discussion on the completeness of quantum theory (QT) has not yet come to an end. The discussion is impeded by the lack of a clear understanding of what makes up the contents of a theory of physics in general and of QT…
A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the…
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…
Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…
In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.