We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition (...) for granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

An interpretation of Wittgenstein’s much criticized remarks on Gödel’s First Incompleteness Theorem is provided in the light of paraconsistent arithmetic: in taking Gödel’s proof as a paradoxical derivation, Wittgenstein was drawing the consequences of his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. It is shown that the features of paraconsistent arithmetics (...) match with some intuitions underlying Wittgenstein’s philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any mathematical question. (shrink)

This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are (...) neither provable nor refutable. The first theorem is general in the sense that it applies to any axiomatic theory, which is ω-consistent, has an effective proof procedure, and is strong enough to represent basic arithmetic. Their importance lies in their generality: although proved specifically for extensions of system, the method Gödel used is applicable in a wide variety of circumstances. Gödel's results had a profound influence on the further development of the foundations of mathematics. It pointed the way to a reconceptualization of the view of axiomatic foundations. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in (...) set theory. Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

The paper continues the consideration of Hilbert mathematics to mathematics itself as an additional “dimension” allowing for the most difficult and fundamental problems to be attacked in a new general and universal way shareable between all of them. That dimension consists in the parameter of the “distance between finiteness and infinity”, particularly able to interpret standard mathematics as a particular case, the basis of which are arithmetic, set theory and propositional logic: that is as a special “flat” case of (...) Hilbert mathematics. The following four essential problems are considered for the idea to be elucidated: Fermat’s last theorem proved by Andrew Wiles; Poincaré’s conjecture proved by Grigori Perelman and the only resolved from the seven Millennium problems offered by the Clay Mathematics Institute (CMI); the four-color theorem proved “machine-likely” by enumerating all cases and the crucial software assistance; the Yang-Mills existence and mass gap problem also suggested by CMI and yet unresolved. They are intentionally chosen to belong to quite different mathematical areas (number theory, topology, mathematical physics) just to demonstrate the power of the approach able to unite and even unify them from the viewpoint of Hilbert mathematics. Also, specific ideas relevant to each of them are considered. Fermat’s last theorem is shown as a Gödel insoluble statement by means of Yablo’s paradox. Thus, Wiles’s proof as a corollary from the modularity theorem and thus needing both arithmetic and set theory involves necessarily an inverse Grothendieck universe. On the contrary, its proof in “Fermat arithmetic” introduced by “epoché to infinity” (following the pattern of Husserl’s original “epoché to reality”) can be suggested by Hilbert arithmetic relevant to Hilbert mathematics, the mediation of which can be removed in the final analysis as a “Wittgenstein ladder”. Poincaré’s conjecture can be reinterpreted physically by Minkowski space and thus reduced to the “nonstandard homeomorphism” of a bit of information mathematically. Perelman’s proof can be accordingly reinterpreted. However, it is valid in Gödel (or Gödelian) mathematics, but not in Hilbert mathematics in general, where the question of whether it holds remains open. The four-color theorem can be also deduced from the nonstandard homeomorphism at issue, but the available proof by enumerating a finite set of all possible cases is more general and relevant to Hilbert mathematics as well, therefore being an indirect argument in favor of the validity of Poincaré’s conjecture in Hilbert mathematics. The Yang-Mills existence and mass gap problem furthermore suggests the most general viewpoint to the relation of Hilbert and Gödel mathematics justifying the qubit Hilbert space as the dual counterpart of Hilbert arithmetic in a narrow sense, in turn being inferable from Hilbert arithmetic in a wide sense. The conjecture that many if not almost all great problems in contemporary mathematics rely on (or at least relate to) the Gödel incompleteness is suggested. It implies that Hilbert mathematics is the natural medium for their discussion or eventual solutions. (shrink)

We take an argument of Gödel's from his ground‐breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: "the sentence G says about itself that it is not provable, and G is indeed not provable; therefore, G is true".

The paper discusses Hilbert mathematics, a kind of Pythagorean mathematics, to which the physical world is a particular case. The parameter of the “distance between finiteness and infinity” is crucial. Any nonzero finite value of it features the particular case in the frameworks of Hilbert mathematics where the physical world appears “ex nihilo” by virtue of an only mathematical necessity or quantum information conservation physically. One does not need the mythical Big Bang which serves to concentrate all the violations of (...) energy conservation in a “safe”, maximally remote point in the alleged “beginning of the universe”. On the contrary, an omnipresent and omnitemporal medium obeying quantum information conservation rather than energy conservation permanently generates action and thus the physical world. The utilization of that creation “ex nihilo” is accessible to humankind, at least theoretically, as long as one observes the physical laws, which admit it in their new and wider generalization. One can oppose Hilbert mathematics to Gödel mathematics, which can be identified as all the standard mathematics until now featureable by the Gödel dichotomy of arithmetic to set theory: and then, “dialectic”, “intuitionistic”, and “Gödelian” mathematics within the former, according to a negative, positive, or zero value of the distance between finiteness and infinity. A mapping of Hilbert mathematics into pseudo-Riemannian space corresponds, therefore allowing for gravitation to be interpreted purely mathematically and ontologically in a Pythagorean sense. Information and quantum information can be involved in the foundations of mathematics and linked to the axiom of choice or alternatively, to the field of all rational numbers, from which the pair of both dual and anti-isometric Peano arithmetics featuring Hilbert arithmetic are immediately inferable. Noether’s theorems (1918) imply quantum information conservation as the maximally possible generalization of the pair of the conservation of a physical quantity and the corresponding Lie group of its conjugate. Hilbert mathematics can be interpreted from their viewpoint also after an algebraic generalization of them. Following the ideas of Noether’s theorem (1918), locality and nonlocality can be realized both physically and mathematically. The “light phase of the universe” can be linked to the gap of mathematics and physics in the Cartesian organization of cognition in Modernity and then opposed to its “dark phase”, in which physics and mathematics are merged. All physical quantities can be deduced from only mathematical premises by the mediation of the most fundamental physical constants such as the speed of light in a vacuum, the Planck and gravitational constants once they have been interpreted by the relation of locality and nonlocality. (shrink)

Those incompleteness theorems mean the relation of (Peano) arithmetic and (ZFC) set theory, or philosophically, the relation of arithmetical finiteness and actual infinity. The same is managed in the framework of set theory by the axiom of choice (respectively, by the equivalent well-ordering "theorem'). One may discuss that incompleteness form the viewpoint of set theory by the axiom of choice rather than the usual viewpoint meant in the proof of theorems. The logical corollaries from that "nonstandard" viewpoint the relation (...) of set theory and arithmetic are demonstrated. (shrink)

Peano arithmetic cannot serve as the ground of mathematics for it is inconsistent to infinity, and infinity is necessary for its foundation. Though Peano arithmetic cannot be complemented by any axiom of infinity, there exists at least one (logical) axiomatics consistent to infinity. That is nothing else than a new reading at issue and comparative interpretation of Gödel’s papers (1930; 1931) meant here. Peano arithmetic admits anyway generalizations consistent to infinity and thus to some addable axiom(s) of (...) infinity. The most utilized example of those generalizations is the complex Hilbert space. Any generalization of Peano arithmetic consistent to infinity, e.g. the complex Hilbert space, can serve as a foundation for mathematics to found itself and by itself. (shrink)

The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty (...) and loss of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)

Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by (...) quantum neo-Pythagoreanism links it to the opposition of propositional logic, to which Gentzen’s cut rule refers immediately, on the one hand, and the linguistic and mathematical theory of metaphor therefore sharing the same structure borrowed from Hilbert arithmetic in a wide sense. An example by hermeneutical circle modeled as a dual pair of a syllogism (accomplishable also by a Turing machine) and a relevant metaphor (being a formal and logical mistake and thus fundamentally inaccessible to any Turing machine) visualizes human understanding corresponding also to Gentzen’s cut elimination and the Gödel dichotomy about the relation of arithmetic to set theory: either incompleteness or contradiction. The metaphor as the complementing “half” of any understanding of hermeneutical circle is what allows for that Gödel-like incompleteness to be overcome in human thought. (shrink)

Introduction to mathematical logic. Part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.

In the Appendix I of his "Remarks on the Foundations of Mathematics", Wittgenstein elaborates a different interpretation of Gödel’s First Incompleteness Theorem, which we have come to refer to as "Gödel’s Theorem" or "Incompleteness Theorem". This nomenclature arises from the recognition that the so-called "Second Incompleteness Theorem" is essentially a corollary of the primary theorem. Wittgenstein aims to reassess Gödel’s conclusion that there exist true formulas not demonstrable within formal systems capable of representing a sufficient amount of arithmetic theory. (...) Gödel’s initial reaction, as well as other commentators, was that Wittgenstein had not understood the proof. Nevertheless, recent commentators view worthy commentaries in wittgensteinian writings: some commentators, such as Juliet Floyd and Hilary Putnam, distinguish between mathematical proof and philosophical prose that surrounds the theorem, making it possible to understand Wittgenstein’s remarks. Ultimately, Wittgenstein’s observations serve as a lens through which Gödel’s theorem can be reconsidered within the realm of non-classical logics, such as paraconsistent logic. (shrink)

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than as (...) a motley of pieces assembled by the random processes of natural selection. “Gödel shows us an unclarity in the concept of ‘mathematics’, which is indicated by the fact that mathematics is taken to be a system” and we can say (contra nearly everyone) that is all that Gödel and Chaitin show. Wittgenstein commented many times that ‘truth’ in math means axioms or the theorems derived from axioms, and ‘false’ means that one made a mistake in using the definitions, and this is utterly different from empirical matters where one applies a test. Wittgenstein often noted that to be acceptable as mathematics in the usual sense, it must be useable in other proofs and it must have real world applications, but neither is the case with Godel’s Incompleteness. Since it cannot be proved in a consistent system (here Peano Arithmetic but a much wider arena for Chaitin), it cannot be used in proofs and, unlike all the ‘rest’ of PA it cannot be used in the real world either. As Rodych notes “…Wittgenstein holds that a formal calculus is only a mathematical calculus (i.e., a mathematical language-game) if it has an extra- systemic application in a system of contingent propositions (e.g., in ordinary counting and measuring or in physics) …” Another way to say this is that one needs a warrant to apply our normal use of words like ‘proof’, ‘proposition’, ‘true’, ‘incomplete’, ‘number’, and ‘mathematics’ to a result in the tangle of games created with ‘numbers’ and ‘plus’ and ‘minus’ signs etc., and with -/- ‘Incompleteness’ this warrant is lacking. Rodych sums it up admirably. “On Wittgenstein’s account, there is no such thing as an incomplete mathematical calculus because ‘in mathematics, everything is algorithm [and syntax] and nothing is meaning [semantics]…” -/- I make some brief remarks which note the similarities of these ‘mathematical’ issues to economics, physics, game theory, and decision theory. -/- Those wishing further comments on philosophy and science from a Wittgensteinian two systems of thought viewpoint may consult my other writings -- Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 3rd ed (2019), The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle 2nd ed (2019), Suicide by Democracy 4th ed (2019), The Logical Structure of Human Behavior (2019), The Logical Structure of Consciousness (2019, Understanding the Connections between Science, Philosophy, Psychology, Religion, Politics, and Economics and Suicidal Utopian Delusions in the 21st Century 5th ed (2019), Remarks on Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason in Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal-Sharrock and Yanofsky (2019), and The Logical Structure of Philosophy, Psychology, Sociology, Anthropology, Religion, Politics, Economics, Literature and History (2019). (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

The paper is the final, fifth part of a series of studies introducing the new conceptions of “Hilbert mathematics” and “ontomathematics”. The specific subject of the present investigation is the proper philosophical sense of both, including philosophy of mathematics and philosophy of physics not less than the traditional “first philosophy” (as far as ontomathematics is a conservative generalization of ontology as well as of Heidegger’s “fundamental ontology” though in a sense) and history of philosophy (deepening Heidegger’s destruction of it from (...) the pre-Socratics to the Pythagoreans). Husserl’s phenomenology and Heidegger’s derivative “fundamental ontology” as well as his later doctrine after the “turn” are the starting point of the research as established and well known approaches relative to the newly introduced conception of ontomathematics, even more so that Husserl himself started criticizing his “Philosophy of arithmetic” as too naturalistic and psychological turning to “Logical investigations” and the foundations of phenomenology. Heidegger’s “Aletheia” is also interpreted ontomathematically: as a relation of locality and nonlocality, respectively as a motion from nonlocality to locality if both are physically considered. Aristotle’s ontological revision of Plato’s doctrine is “destructed” further from the pre-Socratics' “Logos” or Heideger’s “Language” (after the “turn”) to the Pythagoreans “Numbers” or “Arithmetics” as an inherent and fundamental philosophical doctrine. Then, a leap to contemporary physics elucidates the essence of ontomathematics overcoming the Cartesian abyss inherited from Plato’s opposition of “ideas” versus “things”, and now unifying physics and mathematics, particularly allowing for the “creation from nothing” instead of the quasi-scientific myth of the “Big Bang”. Furthermore, ontomathematics needs another interpretation of arithmetic, propositional logic and set theory in the foundations of mathematics, where the latter two ones are both identified with Boolean algebra, and the former is considered to be a “half of Boolean algebra” in the exact meaning to be equated to it after doubling by a dual anti-isometric counterpart of Peano arithmetic. That unified algebraic realization of the foundations of mathematics is related to Hilbert mathematics in both “narrow and wide senses” where the latter is isomorphic to the qubit Hilbert space, thus underlying all the physical world by the newly introduced substance of quantum information being physically dimensionless and generalizing classical information measured in bits. The substance of information, whether classical or quantum, visualizes the way of the unification of physics and mathematics by merging their foundations in Hilbert arithmetic and Hilbert mathematics: thus how ontomathetics is a “first philosophy”. The relation of ontomathematics to the Socratic “human problematics”, furthermore being fundamental for Western philosophy in Modernity, is discussed. Ontomathematics implies its “substitution” by abstract information (or by “subjectless choice” relevant to it), thus “obliterating the human outline on the ocean beach sand” (by Michel Foucault’s metaphor). A reflection back from the viewpoint of mathematic to Western philosophy as the philosophy of locality ends the study. (shrink)

Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with (...) other well-known mathematical observations: (1) the paradox of Achilles and the Turtle; (2) the transitivity of the relation of equality. Analogically to (1), one can juxtapose the paradox of the Liar (for Lewis Carroll’s paradox) and that of the arrow (for “Achilles and the Turtle”), i.e. a logical paradox, on the one hand, and an aporia of motion, on the other hand, suggesting a shared formal structure of both, which can be called “ontological”, on which basis “motion” studied by physics and “conclusion” studied by logic can be unified being able to bridge logic and physics philosophically in a Hegelian manner: even more, the bridge can be continued to mathematics in virtue of (2), which forces the equality (for its property of transitivity) of any two quantities to be postponed analogically ad lib and ad infinitum. The paper shows that Hilbert arithmetic underlies naturally Lewis Carroll’s paradox admitting at least three interpretations linked to each other by it: mathematical, physical and logical. Thus, it can be considered as both generalization and solution of his paradox therefore naturally unifying the completeness of quantum mechanics (i.e. the absence of hidden variables) and eventual completeness of mathematics as the same and isomorphic to the completeness of propositional logic in relation to set theory as a first-order logic (in the sense of Gödel (1930)’s completeness theorems). (shrink)

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a (...) subspace of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)

The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, is to save from the transfinite deadlock of higher set theory the jewel of mathematical Continuum — this genuine, even if mostly forgotten today raison d’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.

Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. (...) That's why it can Ье applied to itself, proving that it is an undecidaЬle statement. It seems to Ье а too strange kind of proposition: its validity implies its undecidabllity. If the validity of а statement implies its untruth, then it is either untruth (reductio ad absurdum) or an antinomy (if also its negation implies its validity). А theory that contains а contradiction implies any statement. Appearing of а proposition, whose validity implies its undecidabllity, is due to the statement that claims its unprovability. Obviously, it is а proposition of self-referential type. Ву Gбdel's words, it is correlative with Richard's or liar paradox, or even with any other semantic or mathematical one. What is the cost, if а proposition of that special kind is used in а proof? ln our opinion, the price is analogous to «applying» of а contradictory in а theory: any statement turns out to Ье undecidaЬ!e. Ifthe first incompleteness theorem is an undecidaЬ!e theorem, then it is impossiЬle to prove that the very completeness of Peano arithmetic is also an tmdecidaЬle statement (the second incompleteness theorem). Hilbert's program for ап arithmetical self-foundation of matheшatics is partly rehabllitated: only partly, because it is not decidaЬ!e and true, but undecidaЬle; that's wby both it and its negation шау Ье accepted as true, however not siшultaneously true. The first incompleteness theoreш gains the statute of axiom of а very special, semi-philosophical kind: it divides mathematics as whole into two parts: either Godel шathematics or Нilbert matheшatics. Нilbert's program of self-foundation ofmatheшatic is valid only as to the latter. (shrink)

An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and it develops (...) algorithmic methods for certain classes of such problems. The results are then applied to classical number theory, in particular, to questions concerning possible refinements of the 1931 Gödel Axiom Set, e.g. whether any of its axioms can be analyzed into “informational atoms”. Two propositions are “informationally unconnected” [with each other] if no informative (nontautological) consequence of one also follows from the other. A proposition is an “informational atom” if it is informative but no information can be dropped from it without rendering it uninformative (tautological). Presentation, employment, and investigation of these two new concepts are prominent features of this paper. (shrink)

Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for completeness. (...) This paper investigates both conditions and philosophical background necessary for that modification. The main conclusion is that the concept of infinity as underlying contemporary mathematics cannot be reduced to a single Peano arithmetic, but to at least two ones independent of each other. Intuitionism, quantum mechanics, and Gentzen’s approaches to completeness an even Hilbert’s finitism can be unified from that viewpoint. Mathematics may found itself by a way of finitism complemented by choice. The concept of information as the quantity of choices underlies that viewpoint. Quantum mechanics interpretable in terms of information and quantum information is inseparable from mathematics and its foundation. (shrink)

One of the most fundamental questions in the philosophy of mathematics concerns the relation between truth and formal proof. The position according to which the two concepts are the same is called deflationism, and the opposing viewpoint substantialism. In an important result of mathematical logic, Kurt Gödel proved in his first incompleteness theorem that all consistent formal systems containing arithmetic include sentences that can neither be proved nor disproved within that system. However, such undecidable Gödel sentences can be established (...) to be true once we expand the formal system with Alfred Tarski s semantical theory of truth, as shown by Stewart Shapiro and Jeffrey Ketland in their semantical arguments for the substantiality of truth. According to them, in Gödel sentences we have an explicit case of true but unprovable sentences, and hence deflationism is refuted. -/- Against that, Neil Tennant has shown that instead of Tarskian truth we can expand the formal system with a soundness principle, according to which all provable sentences are assertable, and the assertability of Gödel sentences follows. This way, the relevant question is not whether we can establish the truth of Gödel sentences, but whether Tarskian truth is a more plausible expansion than a soundness principle. In this work I will argue that this problem is best approached once we think of mathematics as the full human phenomenon, and not just consisting of formal systems. When pre-formal mathematical thinking is included in our account, we see that Tarskian truth is in fact not an expansion at all. I claim that what proof is to formal mathematics, truth is to pre-formal thinking, and the Tarskian account of semantical truth mirrors this relation accurately. -/- However, the introduction of pre-formal mathematics is vulnerable to the deflationist counterargument that while existing in practice, pre-formal thinking could still be philosophically superfluous if it does not refer to anything objective. Against this, I argue that all truly deflationist philosophical theories lead to arbitrariness of mathematics. In all other philosophical accounts of mathematics there is room for a reference of the pre-formal mathematics, and the expansion of Tarkian truth can be made naturally. Hence, if we reject the arbitrariness of mathematics, I argue in this work, we must accept the substantiality of truth. Related subjects such as neo-Fregeanism will also be covered, and shown not to change the need for Tarskian truth. -/- The only remaining route for the deflationist is to change the underlying logic so that our formal languages can include their own truth predicates, which Tarski showed to be impossible for classical first-order languages. With such logics we would have no need to expand the formal systems, and the above argument would fail. From the alternative approaches, in this work I focus mostly on the Independence Friendly (IF) logic of Jaakko Hintikka and Gabriel Sandu. Hintikka has claimed that an IF language can include its own adequate truth predicate. I argue that while this is indeed the case, we cannot recognize the truth predicate as such within the same IF language, and the need for Tarskian truth remains. In addition to IF logic, also second-order logic and Saul Kripke s approach using Kleenean logic will be shown to fail in a similar fashion. (shrink)

The mind-body problem is one of the important topics in philosophy of mind and cognitive science. Following the analytical tradition of linguistic and logical analysis, we focus on two aspects of the mind- body problem: one is around Gödel's incompleteness theorem, and the other is on cognitive logic, especially on the question of whether Epistemological Arithmetic and machines are private. In the former case, in response to the popular view that the Gödel Incompleteness Theorem supports dualism in the mind-body (...) problem, H. Putnam constructs a counter-argument that defends the computationalist agenda: the equivalence of mind and Turing machine. In this regard, the paper discusses Putnam's line of analysis and then argues that it is unsound. In the latter case, the paper examines in detail the cognitive form of the expression of privateness and concludes, together with recent results in EA, that the existence of privateness in Turing machines is logically untenable and, therefore, we argue that the mind is not equivalent to a machine in terms of cognitive ability and privateness, i.e., the computationalist agenda is not valid. (shrink)

Halbach has argued that Tarski biconditionals are not ontologically conservative over classical logic, but his argument is undermined by the fact that he cannot include a theory of arithmetic, which functions as a theory of syntax. This article is an improvement on Halbach's argument. By adding the Tarski biconditionals to inclusive negative free logic and the universal closure of minimal arithmetic, which is by itself an ontologically neutral combination, one can prove that at least one thing exists. The (...) result can then be strengthened to the conclusion that infinitely many things exist. Those things are not just all Gödel codes of sentences but rather all natural numbers. Against this background inclusive negative free logic collapses into noninclusive free logic, which collapses into classical logic. The consequences for ontological deflationism with respect to truth are discussed. (shrink)

This article examines the various Liar paradoxes and their near kin, Grelling’s paradox and Gödel’s Incompleteness Theorem with its self-referential Gödel sentence. It finds the family of paradoxes to be generated by circular definition–whether of statements, predicates, or sentences–a manoeuvre that generates pseudo-statements afflicted with the Liar syndrome: semantic vacuity, semantic incoherence, and predicative catalepsy. Such statements, e.g., the self-referential Liar statement, are meaningless, and hence fail to say anything, a point that invalidates the reasoning on which the various paradoxes (...) rest. The seeming plausibility of the paradoxes is due to the fact that often the sentence used to make the pseudo-statement is ambiguous in that it may also be used to make a genuine statement about the pseudo-statement. Hence, if a formal system is to avoid ambiguity and consequent paradox and contradiction, it must distinguish between the two statements the sentence may be used to make. Gödel’s Theorem presents a further complication in that the self-reference involved is sentential rather than statemental. Nevertheless, on the intended interpretation of the system as a formalization of arithmetic, the self-referential Gödel sentence can only be an ambiguous statement, one that is both a pseudo-statement and its genuine double. Consequently, the conclusions commonly drawn from Gödel’s theorem must be deemed unwarranted. Arithmetic might well be formalized in a proper system that either excludes circular definition or introduces disambiguators. (shrink)

A teaching document I've used in my courses on truth and on incompleteness. Aimed at students who have a good grasp of basic logic, and decent math skills, it attempts to give them the background they need to understand a proper statement of the classic results due to Gödel and Tarski, and sketches their proofs. Topics covered include the notions of language and theory, the basics of formal syntax and arithmetization, formal arithmetic (Q and PA), representability, diagonalization, and the (...) incompleteness and undefinability theorems. (shrink)

Information-theoretic approaches to formal logic analyze the "common intuitive" concepts of implication, consequence, and validity in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; one given proposition is a consequence of a second if the latter contains all of the information contained by the former; an argument is valid if the conclusion contains no information beyond that of the premise-set. This (...) paper locates information-theoretic approaches historically, philosophically, and pragmatically. Advantages and disadvantages are identified by examining such approaches in themselves and by contrasting them with standard transformation-theoretic approaches. Transformation-theoretic approaches analyze validity (and thus implication) in terms of transformations that map one argument onto another: a given argument is valid if no transformation carries it onto an argument with all true premises and false conclusion. Model-theoretic, set-theoretic, and substitution-theoretic approaches, which dominate current literature, can be construed as transformation-theoretic, as can the so-called possible-worlds approaches. Ontic and epistemic presuppositions of both types of approaches are considered. Attention is given to the question of whether our historically cumulative experience applying logic is better explained from a purely information-theoretic perspective or from a purely transformation-theoretic perspective or whether apparent conflicts between the two types of approaches need to be reconciled in order to forge a new type of approach that recognizes their basic complementarity. (shrink)

In his proof of the first incompleteness theorem, Kurt Gödel provided a method of showing the truth of specific arithmetical statements on the condition that all the axioms of a certain formal theory of arithmetic are true. Furthermore, the statement whose truth is shown in this way cannot be proved in the theory in question. Thus it may seem that the relation of logical consequence is wider than the relation of derivability by a pre-defined set of rules. The aim (...) of this paper is to explore under which assumptions the Gödelian statement can rightly be considered a logical consequence of the axioms of the theory in question. It is argued that this is the case only when the all the theorems of the theory in question are understood as statements of the same kind as statements of arithmetic and statements about provability in the theory, and only if the language of the theory contains logical expressions allowing to include certain predicates of meta-language in the language of the theory. (shrink)

There is a long-standing gap in the literature as to whether Gödelian incompleteness constitutes a challenge for Neo-Logicism, and if so how serious it is. In this paper, I articulate and address the challenge in detail. The Neo-Logicist project is to demonstrate the analyticity of arithmetic by deriving all its truths from logical principles and suitable definitions. The specific concern raised by Gödel’s first incompleteness theorem is that no single sound system of logic syntactically implies all arithmetical truths. I (...) set out some responses that initially seem appealing and explain why they are not compelling. The upshot is that Neo-Logicism either offers an epistemic route only to some truths of arithmetic; or that it has to move from a syntactic to a semantic notion of logical consequence, which risks undermining its epistemic goals. I conclude by considering Crispin Wright’s recent attempt to address Gödelian incompleteness, which I argue is not satisfactory. (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. Social science, liberal arts, history, and philosophy are meant first of all. That kind of theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather (...) a metamathematical axiom about the relation of mathematics and reality. The main statement is formulated as follows: Any scientific theory admits isomorphism to some mathematical structure in a way constructive. Its investigation needs philosophical means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. The sketch of the proof is organized in five steps: a generalization of epoché; involving transfinite induction in the transition between Peano arithmetic and set theory; discussing the finiteness of Peano arithmetic; applying transfinite induction to Peano arithmetic; discussing an arithmetical model of reality. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. The present paper follows a pathway grounded on Husserl’s phenomenology and “bracketing reality” to achieve the generalized arithmetic necessary for the principle to be founded in alternative ontology, in which there is no reality external to mathematics: reality is included within mathematics. That latter mathematics is able to self-found itself and can be called Hilbert mathematics in honour of Hilbert’s program for self-founding mathematics on the base of arithmetic. The principle of universal mathematizability is consistent to Hilbert mathematics, but not to Gödel mathematics. Consequently, its validity or rejection would resolve the problem which mathematics refers to our being; and vice versa: the choice between them for different reasons would confirm or refuse the principle as to the being. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. The Schrödinger equation in quantum mechanics is involved to illustrate that ontology. Thus the problem which of the two mathematics is more relevant to our being is discussed again in a new way A few directions for future work can be: a rigorous formal proof of the principle as an independent axiom; the further development of information ontology consistent to both kinds of mathematics, but much more natural for Hilbert mathematics; the development of the information interpretation of quantum mechanics as a mathematical one for information ontology and thus Hilbert mathematics; the description of consciousness in terms of information ontology. (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...) means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism in the final analysis. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem. (shrink)

The book is devoted to the contemporary stage of quantum mechanics – quantum information, and especially to its philosophical interpretation and comprehension: the first one of a series monographs about the philosophy of quantum information. The second will consider Be l l ’ s inequalities, their modified variants and similar to them relations. The beginning of quantum information was in the thirties of the last century. Its speed development has started over the last two decades. The main phenomenon is entanglement. (...) The subareas are quantum computer, quantum communication (and teleportation), and quantum cryptography. The book offers the following main conceptions, theses and hypotheses: – dualistic Phythagoreanism as a new kind among the interpretations of quantum mechanics and information: arithmetical, logical, and metamathematical one; – Gödel ’ s first incompleteness theorem is an undecidable proposition, and consequently the second one,too. – a partial rehabilitation of Hilbert ’ s program for the self-foundation of mathematics; – the dual-foundation of mathematics; – Skolemian relativity between: Cantor ’s kinds of infinity, finiteness and infinity, discreteness and continuity, completeness and incompleteness, etc.; – information is a physical quantity representing the non-reducibility of a system to its parts, particularly nonaddtivity; – there exist pure relations «by itself», which cannot be reduced to predications; – energy conservation can and should be generalized; – Einstein’ s «general covariance» or «principle of relativity» can and should be generalized to cover discrete morphisms where the notion of velocity does not make sense. (shrink)

The present paper intends to report two results. It is shown that the formula P(x)=∀y∀z[¬G(x, y)→¬M(z)] provides the logic underlying gauge symmetry, where M denotes the predicate of being massive. For the logic of spontaneous symmetry breaking, by Higgs mechanism, we have P(x)=∀y∀z[G(x, y)→M(z)]. Notice that the above two formulas are not logically equivalent. The results are obtained by integrating four components, namely, gauge symmetry and Higgs mechanism in quantum field theory, and Gödel's incompleteness theorem and Tarski's indefinability theorem in (...) mathematical logic. Gödel numbering is the key for arithmetic modeling applied in this paper. (shrink)

In “Models and Reality” (1980), Putnam sketched a version of his internal realism as it might arise in the philosophy of mathematics. Here, I will develop that sketch. By combining Putnam’s model-theoretic arguments with Dummett’s reflections on Gödelian incompleteness, we arrive at (what I call) the Skolem-Gödel Antinomy. In brief: our mathematical concepts are perfectly precise; however, these perfectly precise mathematical concepts are manifested and acquired via a formal theory, which is understood in terms of a computable system of proof, (...) and hence is incomplete. Whilst this might initially seem strange, I show how internal categoricity results for arithmetic and set theory allow us to face up to this Antinomy. This also allows us to understand why “Models are not lost noumenal waifs looking for someone to name them,” but “constructions within our theory itself,” with “names from birth.”. (shrink)

We respond to some of the points made by Bennet and Blanck (2022) concerning a previous publication of ours (2021).

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...) and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

The paper discusses this year’s Nobel Prize in physics for experiments of entanglement “establishing the violation of Bell inequalities and pioneering quantum information science” in a much wider, including philosophical context legitimizing by the authority of the Nobel Prize a new scientific area out of “classical” quantum mechanics relevant to Pauli’s “particle” paradigm of energy conservation and thus to the Standard model obeying it. One justifies the eventual future theory of quantum gravitation as belonging to the newly established quantum information (...) science. Entanglement, involving non-Hermitian operators for its rigorous description, non-unitarity as well as nonlocal and superluminal physical signals “spookily” (by Einstein’s flowery epithet) synchronizing and transferring some nonzero action at a distance, can be considered to be quantum gravity so that its local counterpart to be Einstein’s gravitation according to general relativity therefore pioneering an alternative pathway to quantum gravitation different from the “secondary quantization” of the Standard model. So, the experiments of entanglement once they have been awarded by the Nobel Prize launch particularly the relevant theory of quantum gravitation grounded on “quantum information science” thus granted to be nonclassical quantum mechanics in the shared framework of the generalized quantum mechanics obeying rather quantum-information conservation than only energy conservation. The concept of “dark phase” of the universe naturally linked to the very well confirmed “dark matter” and “dark energy” and opposed to its “light phase” inherent to classical quantum mechanics and the Standard model obeys quantum-information conservation, after which reversible causality or the mutual transformation of energy and information are valid. The mythical Big Bang after which energy conservation holds universally is to be replaced by an omnipresent and omnitemporal medium of decoherence of the dark and nonlocal phase into the light and local phase. The former is only an integral image of the latter and borrowed in fact rather from religion than from science. Physical, methodological and proper philosophical conclusions follow from that paradigm shift heralded by this year’s Nobel Prize in physics. For example, the scientific theory of thinking should originate from the dark phase of the universe, as well: probably only approximately modeled by neural networks physically belonging to the light phase thoroughly. A few crucial philosophical sequences follow from the break of Pauli’s paradigm: (1) the establishment of the “dark” phase of the universe as opposed to its “light” phase, only to which the Cartesian dichotomy of “body” and “mind” is valid; (2) quantum information conservation as relevant to the dark phase, furthermore generalizing energy conservation as to its light phase, productively allowing for physical entities to appear “ex nihilo”, i.e., from the dark phase, in which energy and time are yet inseparable from each other; (3) reversible causality as inherent to the dark phase; (4) the interpretation of gravitation only mathematically: as an interpretation of the incompleteness of finiteness to infinity, for example, following the Gödel dichotomy (“either contradiction or incompleteness”) about the relation of arithmetic to set theory; (5) the restriction of the concept of hierarchy only to the light phase; (6) the commensurability of both physical extremes of a quantum and the universe as a whole in the dark phase obeying quantum information conservation and akin to Nicholas of Cusa’s philosophical and theological worldview. (shrink)

Bertrand Russell was one of the best-known proponents of logicism: the theory that mathematics reduces to, or is an extension of, logic. Russell argued for this thesis in his 1903 The Principles of Mathematics and attempted to demonstrate it formally in Principia Mathematica (PM 1910–1913; with A. N. Whitehead). Russell later described his work as a further “regressive” step in understanding the foundations of mathematics made possible by the late 19th century “arithmetization” of mathematics and Frege’s logical definitions of arithmetical (...) concepts. The logical system of PM sought to improve on earlier attempts by solving the contradictions found in, e.g., Frege’s system, by employing a theory of types. In this article, I also consider and critically evaluate the most common objections to Russell’s logicism, including the claim that it is undermined by Gödel’s incompleteness results, and Putnam's charge of “if-thenism”. I suggest that if we are willing to accept a slightly revisionist account of what counts as a mathematical truth, these criticisms do not obviously refute Russell’s claim to have established that mathematical truths generally are a species of logical truth. (shrink)

The relationship between the One and the Multiple in mystic philosophy is a profound and central theme that explores the nature of existence, the cosmos, and the divine. This theme is present in various mystical traditions, including those of the East and West, and it addresses the paradoxical coexistence of the unity and multiplicity of all things. -/- In mystic philosophy, the **One** often represents the ultimate reality, the source from which all things emanate and to which all things return. (...) It is the absolute, the infinite, and the unchanging. The One is beyond all attributes and is often associated with the divine or the absolute truth. -/- The **Multiple**, on the other hand, represents the manifest world, the diversity of forms, and the realm of change and plurality. It is the world we experience through our senses, the domain of time and space, where differentiation and individuality are apparent. -/- The relationship between the One and the Multiple is not one of opposition but of emanation and unity. The Multiple is seen as a reflection, expression, or manifestation of the One. In this sense, the diversity of the world doesn’t contradict the unity of the One but rather demonstrates it in a myriad of forms. -/- Mystics seek to understand and experience this relationship through various practices and insights. They aim to transcend the illusion of separation and duality to experience the non-dual reality where the One and the Multiple are recognized as inseparable. -/- This concept can be illustrated by the metaphor of the ocean and its waves. The ocean represents the One—vast, deep, and all-encompassing—while the waves represent the Multiple—distinct, diverse, and ever-changing. Each wave is unique, yet it is not separate from the ocean. The wave’s existence is dependent on and made of the same substance as the ocean. In the same way, each individual entity in the Multiple is an expression of the One. -/- In summary, the relationship between the One and the Multiple in mystic philosophy is a dynamic interplay that challenges the conventional understanding of separation. It invites a deeper exploration of reality, where the apparent multiplicity of the world is a direct expression of the singular, underlying essence of all that is. -/- The relationship between the One and the Multiple in the context of mathematical philosophy is a profound topic that touches upon the very foundations of existence and knowledge. It’s a theme that has been explored by philosophers and mathematicians alike, often leading to the contemplation of unity and diversity within the structures of reality. -/- In mathematics, the concept of the One can be seen as the basis of unity from which all numbers derive. It’s the identity element in multiplication, the starting point in counting, and the foundation of dimension in geometry. The One is often associated with the concept of monism in philosophy, which posits that there is a single, underlying substance or principle that constitutes reality. -/- On the other hand, the Multiple represents the infinite variety and diversity of forms and numbers that arise from the One. It’s the embodiment of plurality and the complex interplay of different entities that mathematics seeks to understand and describe. This reflects the philosophical stance of pluralism, which acknowledges the existence of multiple realities or truths. -/- The interplay between the One and the Multiple can be seen in the mathematical concept of sets. A set can be thought of as a unity, a whole composed of distinct elements. Yet, each element within the set also retains its individuality, contributing to the diversity of the set’s composition. This duality is mirrored in the philosophical exploration of the universal and the particular, where the universal represents the One, and the particulars represent the Multiple. -/- In the realm of mathematical philosophy, this relationship often leads to questions about the nature of mathematical objects: Are they discovered as part of an objective reality (the One), or are they constructed by the human mind from a multitude of experiences (the Multiple)? This debate resonates with the philosophical inquiry into the nature of truth and reality. -/- Reflecting on the One and the Multiple can also lead to a deeper understanding of the self and the cosmos. Just as the number one is integral to the existence of all other numbers, the individual self can be seen as a unique expression of the universal whole. Similarly, the cosmos can be viewed as a grand unity composed of a multiplicity of forms and phenomena. -/- Gödel’s incompleteness theorems have a fascinating connection to the philosophical concepts of the One and the Multiple. These theorems, which are pivotal in mathematical logic and philosophy of mathematics, articulate the inherent limitations of formal axiomatic systems, particularly those sufficient to express the arithmetic of natural numbers. -/- Gödel’s incompleteness theorems have a fascinating connection to the philosophical concepts of the One and the Multiple. These theorems, which are pivotal in mathematical logic and philosophy of mathematics, articulate the inherent limitations of formal axiomatic systems, particularly those sufficient to express the arithmetic of natural numbers⁴. -/- The **first incompleteness theorem** reveals that within any such consistent system, there are propositions that are true but cannot be proven within the system itself. This reflects the idea of the Multiple in that there is an abundance of mathematical truths, a multiplicity that exceeds the unifying framework of any one system. It suggests that the realm of mathematical truth is more extensive than any single formal system can fully capture. -/- The **second incompleteness theorem** extends this by showing that a system cannot prove its own consistency. This relates to the concept of the One, as it implies that a system’s complete self-understanding, its unity and coherence, is unattainable from within. It must look beyond itself, to an external vantage point, to ascertain its consistency. -/- In the context of the One and the Multiple, Gödel’s theorems imply that the One (a consistent formal system) is inherently incomplete and cannot encompass the Multiple (the totality of mathematical truths). This resonates with philosophical discussions about the relationship between unity and plurality. Just as a single philosophical system cannot capture the entirety of truth, a single formal mathematical system cannot encapsulate all mathematical truths. -/- Moreover, Gödel’s work suggests that the pursuit of a single, unified theory of everything in mathematics—a One that encompasses all Multiples—is an inherently Sisyphean task. There will always be more truths (Multiples) than can be derived from any given set of axioms (the One). -/- In essence, Gödel’s incompleteness theorems provide a formal underpinning to the philosophical notion that the One cannot exist without the Multiple, and vice versa. They are interdependent, with the One giving rise to the Multiple, and the Multiple necessitating the One for its expression and comprehension. This interplay is a dance of limitations and possibilities, where the boundaries of logic, mathematics, and philosophy blur into one another. -/- The relationship between the One and the Multiple in the context of the mathematics of zero is a deeply philosophical inquiry that bridges the abstract world of numbers with the existential questions of being and non-being. -/- Zero, in mathematics, is a symbol of absence, a representation of nothingness, yet it holds a pivotal position as a number. It is the void from which all things emerge and to which they return. In the philosophy of mathematics, zero is the paradoxical junction where the One and the Multiple converge and diverge. -/- From the perspective of the One, zero can be seen as the origin—the singular point that precedes the existence of numbers. It is the empty set, the foundation upon which the edifice of mathematics is constructed. As the identity element in addition, zero maintains the integrity of numbers, for adding zero to any number leaves it unchanged, reflecting the immutable nature of the One. -/- Conversely, when we consider the Multiple, zero represents the infinite potentiality of creation. It is the canvas upon which the integers, both positive and negative, express their multitude. Zero is the balance point, the fulcrum around which the symphony of numbers dances. It embodies the plurality of possibilities, the beginning of the number line that stretches infinitely in both directions. -/- Philosophically, zero challenges our understanding of existence. It is both something and nothing—a number that quantifies the absence of quantity. This duality echoes the philosophical struggle to comprehend how the One gives rise to the Multiple. How does the unity of being manifest the diversity of the cosmos? Zero offers a mathematical metaphor for this mystery, as it encapsulates the transition from non-existence to existence, from the undifferentiated One to the differentiated Multiple. -/- In the realm of set theory, zero corresponds to the empty set—a set with no elements. This set is unique in that it is the only set that contains nothing, yet it is the foundation upon which all other sets are built. The empty set is the mathematical embodiment of the One, and all other sets, containing multiple elements, arise from it. -/- Reflecting on zero in the context of Gödel’s incompleteness theorems, we find a resonance with the idea that the One (a consistent formal system) cannot capture the entirety of the Multiple (the totality of mathematical truths). Zero, as the foundation of numbers, similarly suggests that from the nothingness of the One, the infinite complexity of the Multiple emerges—yet it can never be fully encompassed or expressed by any single system. -/- In conclusion, the mathematics of zero offers a profound reflection on the relationship between the One and the Multiple. It serves as a bridge between the abstract and the concrete, the known and the unknowable, challenging us to ponder the origins of existence and the nature of reality itself. -/- . (shrink)

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (shrink)

The workshop took place in Leuven, Belgium, and was hosted by the KU Leuven's Centre for Logic and Analytic Philosophy. The workshop’s theme was the syntactical treatment of (alethic, epistemic, etc.) modalities. The standard view on modalities nowadays is that they are operators. Syntactic theories, however, treat modalities as predicates, and thus have to assume a background theory which is sufficiently strong to encode its own formulas (usually, one works with some system of arithmetic and Gödel coding). As a (...) consequence, such theories suffer from paradoxes of self-referentiality. For example, just as the liar sentence states of itself that it is false, the knower sentence states of itself that it is unknown. Kaplan and Montague (1960: 'A paradox regained', Notre Dame J. Formal Logic, vol. 1, pp. 79–90) famously showed that any sufficiently strong theory that contains the knower is inconsistent. (shrink)

A case study of quantum mechanics is investigated in the framework of the philosophical opposition “mathematical model – reality”. All classical science obeys the postulate about the fundamental difference of model and reality, and thus distinguishing epistemology from ontology fundamentally. The theorems about the absence of hidden variables in quantum mechanics imply for it to be “complete” (versus Einstein’s opinion). That consistent completeness (unlike arithmetic to set theory in the foundations of mathematics in Gödel’s opinion) can be interpreted furthermore (...) as the coincidence of model and reality. The paper discusses the option and fact of that coincidence it its base: the fundamental postulate formulated by Niels Bohr about what quantum mechanics studies (unlike all classical science). Quantum mechanics involves and develops further both identification and disjunctive distinction of the global space of the apparatus and the local space of the investigated quantum entity as complementary to each other. This results into the analogical complementarity of model and reality in quantum mechanics. The apparatus turns out to be both absolutely “transparent” and identically coinciding simultaneously with the reflected quantum reality. Thus, the coincidence of model and reality is postulated as necessary condition for cognition in quantum mechanics by Bohr’s postulate and further, embodied in its formalism of the separable complex Hilbert space, in turn, implying the theorems of the absence of hidden variables (or the equivalent to them “conservation of energy conservation” in quantum mechanics). What the apparatus and measured entity exchange cannot be energy (for the different exponents of energy), but quantum information (as a certain, unambiguously determined wave function) therefore a generalized law of conservation, from which the conservation of energy conservation is a corollary. Particularly, the local and global space (rigorously justified in the Standard model) share the complementarity isomorphic to that of model and reality in the foundation of quantum mechanics. On that background, one can think of the troubles of “quantum gravity” as fundamental, direct corollaries from the postulates of quantum mechanics. Gravity can be defined only as a relation or by a pair of non-orthogonal separable complex Hilbert space attachable whether to two “parts” or to a whole and its parts. On the contrary, all the three fundamental interactions in the Standard model are “flat” and only “properties”: they need only a single separable complex Hilbert space to be defined. (shrink)

А necessary and sllmcient condilion that а given proposition (о Ье provable in such а theory that allows (о Ье assigned to the proposition а Gödеl пunbег fог containing Реanо arithmetic is that Gödеl number itself. This is tlle sense о[ Martin LöЬ's theorem (1955). Now wе сan рut several philosophpllical questions. Is the Gödеl numbег of а propositional formula necessarily finite or onthe contrary? What would the Gödel number of а theorem be containing Реanо arithmetic itself? That (...) is the case of the so-called first incolnpleteness theorem (Gбdеl 1931). What would the Gödеl питЬег of а self-referential statement be? What w'ould the Gödеl пumbег оГ such а proposition Ье (its Реanо arithmetic expression after encoding contains itself as ап operand)? What is the Gödеl numbег оГ Gödеl's proposition [R(q); q] that states its ргоper imргоvаbility? It is the key statement for his proving of the first incompleteness theorem. Is Реапо arithmetic available in it (ог in the ones similar to it) as а single symbol, Ьу which actual infinity would bе introduced, ог as а constructively infinite set of primary signs? Jn fact, the Gödel number оГ the first incompleteness theorem should Ье infinite in that last case. If the Gödеl number of а statement is infinite, then сап it bе accepted as а theorem? What would the Gбdеl numbeг of its negation bе? Is the infinite Gбdеl numbeг of а statement equivalent to its irresolvability? Respectively, is Ihe following statement valid: irresolvable pгopositions with finite Gбdеl numbers (еуеп in anу encoding) do поl exist? (shrink)

In 1922, Thoralf Skolem introduced the term of «relativity» as to infinity от set theory. Не demonstrated Ьу Zermelo 's axiomatics of set theory (incl. the axiom of choice) that there exists unintended interpretations of anу infinite set. Тhus, the notion of set was also «relative». We сan apply his argurnentation to Gödel's incompleteness theorems (1931) as well as to his completeness theorem (1930). Then, both the incompleteness of Реапо arithmetic and the completeness of first-order logic tum out to (...) bе also «relative» in Skolem 's sense. Skolem 's «relativity» argumentation of that kind сan bе applied to а vету wide range of problems and one сan spoke of the relativity of discreteness and continuity or, of finiiteness and infinity, or, of Cantor 's kinds of infinities, etc. The relativity of Skolemian type helps us for generaIizing Einstein 's principle of relativity from the invariance of the physical laws toward diffeomorphisms to their invariance toward anу morphisms (including and especiaIly the discrete ones). Such а kind of generalization from diffeomorphisms (then, the notion of velocity always makes sense) to anу kind of morphism (when 'velocity' mау оr maу not make sense) is an extension of the general Skolemian type оГ relativity between discreteness and continuity от between finiteness and infinity. Particularly, the Lorentz invariance is not valid in general because the notion of velocity is limited to diffeomorphisms. [п the case of entanglement, the physical interaction is discrete0. 'Velocity" and consequently, the 'Lorentz invariance'"do not make sense. Тhat is the simplest explanation ofthe argurnent EPR, which tums into а paradox оnJу if the universal validity of 'velocity' and 'Lогелtz invariance' is implicitly accepted. (shrink)

The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a specific sequence of (...) reduction - the worst reduction sequence - it is the lowest upper bound on the length of reduction sequences. The main commitment of the introduced method is that it is constructive and elementary, produced only through analyzing structural and combinatorial properties of derivations and lambda terms, without appeal to any sophisticated mathematical tool. Together with the exposition of the method, it is presented a comparative study of some articles in the literature that also get strong normalization by means we can identify with the natural ordinal methods. Among them we highlight Howard[1968], which performs an ordinal analysis of Godel’s Dialectica interpretation for intuitionistic first order arithmetic. We reveal a fact about this article not noted by the author himself: a syntactic proof of strong normalization theorem for the system of typified lambda calculus λ⊃ is a consequence of its results. This would be the first strong normalization proof in the literature. (written in Portuguese). (shrink)

The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.