We compare Gödel’s and Brouwer’s explorations of mysticism and its relation to mathematics.

This book is a unique contribution to the philosophy of religion. It offers a comprehensive discussion of one of the most famous arguments for the existence of God: the ontological argument. The author provides and analyses a critical taxonomy of those versions of the argument that have been advanced in recent philosophical literature, as well as of those historically important versions found in the work of St Anselm, Descartes, Leibniz, Hegel and others. A central thesis of the book is that (...) ontological arguments have no value in the debate between theists and atheists. There is a detailed review of the literature on the topic (separated from the main body of the text) and a very substantial bibliography, making this volume an indispensable resource for philosophers of religion and others interested in religious studies. (shrink)

It is well understood and appreciated that Gödel’s Incompleteness Theorems apply to sufficiently strong, formal deductive systems. In particular, the theorems apply to systems which are adequate for conventional number theory. Less well known is that there exist algorithms which can be applied to such a system to generate a gödel-sentence for that system. Although the generation of a sentence is not equivalent to proving its truth, the present paper argues that the existence of these algorithms, when conjoined with Gödel’s (...) results and accepted theorems of recursion theory, does provide the basis for an apparent paradox. The difficulty arises when such an algorithm is embedded within a computer program of sufficient arithmetic power. The required computer program (an AI system) is described herein, and the paradox is derived. A solution to the paradox is proposed, which, it is argued, illuminates the truth status of axioms in formal models of programs and Turing machines. (shrink)

The development of mathematics toward greater precision has led, as is well known, to the formalization of large tracts of it, so that one can prove any theorem using nothing but a few mechanical rules. -- Godel [11].

A set of godel numbers is invariant if it is closed under automorphisms of (ω, ·), where ω is the set of all godel numbers of partial recursive functions and · is application (i.e., n · m ≃ φ n (m)). The invariant arithmetic sets are investigated, and the invariant recursively enumerable sets and partial recursive functions are partially characterized.

A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if e 1 and e 2 are godel numbers for partial recursive functions in two standard ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2.

This chapter contains sections titled: The Validity of Anselm's Ontological Argument The Truth of the Anselmian Premises On Whether Anselm's Ontological Argument Begs the Question On Parodies The Validity of the Ontological Argument of Descartes and Leibniz On the Truth of the Descartes–Leibniz Premises Critiques of the Descartes–Leibniz Ontological Argument Ontological Arguments of the Twentieth Century Gödel's Ontological Argument On Whether Gödel's Argument is Sound The Modal Perfection Argument The Temporal‐Contingency Argument Conclusion References Appendix 1. Logic Matters Appendix 2. Formal (...) Proofs of Some Modal Arguments. (shrink)

The Modal Perfection Argument (MPA) for the existence of a Supreme Being is a new ontological argument that is rooted in the insights of Anselm, Leibniz and Gödel. Something is supreme if and only if nothing is possibly greater, and a perfection is a property that it is better to have than not. The premises of MPA are that supremity is a perfection, perfections entail only perfections, and the negation of a perfection is not a perfection. I do three things (...) in this paper. First, I prove that MPA is valid by constructing a formal deduction of it in second order modal logic. Second, I argue that its premises are true. Third, I defend the argument and the logic used against some likely objections. (shrink)

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...) Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14. (shrink)

The ancient puzzle of the Liar was shown by Tarski to be a genuine paradox or antinomy. I show, analogously, that certain puzzles of contemporary game theory are genuinely paradoxical, i.e., certain very plausible principles of rationality, which are in fact presupposed by game theorists, are inconsistent as naively formulated. ;I use Godel theory to construct three versions of this new paradox, in which the role of 'true' in the Liar paradox is played, respectively, by 'provable', 'self-evident', and 'justifiable'. (...) I also construct in modal operator logic a paradox involving reflexive empirical reasoning. Unlike the paradox of the Liar, the paradox of reflexive reasoning does not depend on self-reference. ;I consider various solutions to the Liar paradox and evaluate how well these solutions cope with the paradox of reflexive reasoning. I then formalize the solution to the paradoxes which I favor: the indexical-hierarchical approach, first sketched out by Charles Parsons and Tyler Burge. In this solution, occurrences of the predicate 'true' in sentence-tokens are contextually relativized to levels of a hierarchy. Drawing also on some brief remarks of Bertrand Russell and Charles Parsons, I develop an account of the kind of schematic generality needed for this theory to be statable. ;Finally, I demonstrate that the principles shown to be paradoxical are in fact presupposed by contemporary game theorists in their reliance on the notion of common knowledge or, more precisely, mutual belief. I create novel analyses of and corresponding solutions to several recalcitrant puzzles within game theory, including the "chain-store paradox". (shrink)

_Philosophy of Mathematics_ is an excellent introductory text. This student friendly book discusses the great philosophers and the importance of mathematics to their thought. It includes the following topics: * the mathematical image * platonism * picture-proofs * applied mathematics * Hilbert and Godel * knots and nations * definitions * picture-proofs and Wittgenstein * computation, proof and conjecture. The book is ideal for courses on philosophy of mathematics and logic.

Kurt Gödel criticizes Rudolf Carnap's conventionalism on the grounds that it relies on an empiricist admissibility condition, which, if applied, runs afoul of his second incompleteness theorem. Thomas Ricketts and Michael Friedman respond to Gödel's critique by denying that Carnap is committed to Gödel's admissibility criterion; in effect, they are denying that Carnap is committed to any empirical constraint in the application of his principle of tolerance. I argue in response that Carnap is indeed committed to an empirical requirement vis‐à‐vis (...) tolerance, a fact that becomes clear upon closer scrutiny of Carnap's relevant writings. *Received July 2009; revised January 2010. †To contact the author, please write to: Department of Philosophy, University of Saskatchewan, 9 Campus Drive, Saskatoon, SK S7N 5A5, Canada; e‐mail: [email protected]. (shrink)

Fundamental problems of the uses of formal techniques and of natural and instrumental practices have been raised again and again these past two decades, in many quarters and from varying viewpoints. We have brought a number of quite basic studies of these issues together in this volume, not linked con ceptually nor by any rigorously defined problematic, but rather simply some of the most interesting and even provocative of recent research accomplish ments. Most of these papers are derived from the (...) Boston Colloquium for the Philosophy of Science during 1973-80, the two exceptions being those of Karel Berka (on scales of measurement) and A. A. Zinov'ev (on a non-tradi tional theory of quantifiers). Just how intriguing these results (or conjectures?) seem to us may be seen from some brief quotations: (1) Judson Webb: ".... the abstract machine concept has many of the appropriate kinds of properties for modelling living, reproducing, rule following, self-reflecting, accident-prone, and lucky creatures... the a priori logical results relevant to the abstract machine concept, above all Godel's, could not conceivably have turned out any better for the mechanist. " (2) M. L. Dalla Chiara: "... modal interpretation (of quantum logic) shows clearly that it possesses a logical meaning which is quite independent of quantum mechanics. " (3) Isaac Levi: (as against Peirce and Popper) "... infallibilism is con sistent with corrigibilism, and a view which respects avoidance of error is an important desideratum for science. (shrink)

Classes are a kind of collection. Typically, they are too large to be sets. For example, there are classes containing absolutely all sets even though there is no set of all sets. But what are classes, if not sets? When our theory of classes is relatively weak, this question can be avoided. In particular, it is well known that von Neuman–Bernays–Godel class theory is conservative over the standard axioms of set theory ): anything NGB can prove about the sets (...) is already provable in ZFC. In this paper I will prove a new conservativity result for a much broader range of class theories. It tells us that as long as our set theory T contains an independently well-motivated reflection principle, anything provable about the sets in any reasonable class theory extending T is already provable in T. (shrink)

For each natural number n we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than n and no strictly ascending chains. The case n=0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=0$$\end{document} is the Gödel-Löb provability logic. Each logic is axiomatised by adding a single axiom to K4, and is shown to have the finite model property and be decidable. We then consider a number of extensions (...) of these logics, including restricting to reflexive frames to obtain a corresponding sequence of extensions of S4. When n=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=1$$\end{document}, this gives the famous logic of Grzegorczyk, known as S4Grz, which is the strongest modal companion to intuitionistic propositional logic. A topological semantic analysis shows that the n-th member of the sequence of extensions of S4 is the logic of hereditarily n+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n+1$$\end{document}-irresolvable spaces when the modality ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} is interpreted as the topological closure operation. We also study the definability of this class of spaces under the interpretation of ◊\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Diamond $$\end{document} as the derived set operation. The variety of modal algebras validating the n-th logic is shown to be generated by the powerset algebras of the finite frames with cycle length bounded by n. Moreover each algebra in the variety is a model of the universal theory of the finite ones, and so is embeddable into an ultraproduct of them. (shrink)

In his most comprehensive book on the subject , Roger Penrose provides arguments to demonstrate that there are aspects of human understanding which could not, in principle, be attained by any purely computational system. His central argument relies crucially on oft-cited theorems proven by Gödel and Turing. However, that key argument has been the subject of numerous trenchant critiques, which is unfortunate if one believes Penrose's conclusions to be plausible. In the present article, alternative arguments are offered in support of (...) Penrose-like conclusions . It is argued here that a purely computational agent, which lacked conscious awareness, would be incapable of possessing crucial concepts and of understanding certain kinds of geometrically-based proofs. Specifically, it is argued that the acquisition of human-like concepts of countable and non-denumerable infinities, and human-like comprehension of a particular geometrically motivated proof does require conscious apprehension of the subject matter involved. This does not preclude the possibility that a computational agent might come to possess the requisite consciousness, but it is argued that if this consciousness does arise within the agent, it does so, at best, as an emergent, contingent side-effect of the underlying processes involved. (shrink)

The foundations of mathematics include mathematical logic, set theory, recursion theory, model theory, and Gödel's incompleteness theorems. Professor Wolf provides here a guide that any interested reader with some post-calculus experience in mathematics can read, enjoy, and learn from. It could also serve as a textbook for courses in the foundations of mathematics, at the undergraduate or graduate level. The book is deliberately less structured and more user-friendly than standard texts on foundations, so will also be attractive to those outside (...) the classroom environment wanting to learn about the subject. (shrink)

We present a semantic game for Gödel logic and its extensions, where the players’ interaction stepwise reduces arbitrary claims about the relative order of truth degrees of complex formulas to atomic ones. The paper builds on a previously developed game for Gödel logic with projection operator in Fermüller et al., Information processing and management of uncertainty in knowledge-based systems, Springer, Cham, 2020, pp. 257–270). This game is extended to cover Gödel logic with involutive negations and constants, and then lifted to (...) a provability game using the concept of disjunctive strategies. Winning strategies in the provability game, with and without constants and involutive negations, turn out to correspond to analytic proofs in a version of \ :1941–1958, 2010) and in a sequent-of-relations calculus, Automated reasoning with analytic tableaux and related methods, Springer, Berlin, 1999, pp. 36–51) respectively. (shrink)

In this dissertation I defend the claim, long held by Donald Davidson, that truth is a primitive concept that cannot be correctly or informatively defined in terms of more basic concepts. To this end I articulate the history of the primitive thesis in the 20th century, working through early Moore, Russell, and Frege, and provide improved interpretations of their reasons for advancing and eventually abandoning the primitive thesis. I show the importance of slingshot-style arguments in the work of Frege, Church, (...) Davidson, and Gödel for resisting certain versions of the correspondence theory of truth. I argue that most slingshots fail to convincingly establish a collapsing conclusion, but that a Gödelian version of the slingshot is terminal to certain varieties of the correspondence theory of truth. I then provide a Davidsonian theory of truth and interpretation that is consistent with and makes use of the primitive thesis. Finally, I provide an account of predication, properties, and universals that I argue is both serviceable and consistent with Davidson’s overall program. (shrink)

Dominical categories are categories in which the notions of partial morphisms and their domains become explicit, with the latter being endomorphisms rather than subobjects of their sources. These categories form the basis for a novel abstract formulation of recursion theory, to which the present paper is devoted. The abstractness has of course its usual concomitant advantage of generality: it is interesting to see that many of the fundamental results of recursion theory remain valid in contexts far removed from their classic (...) manifestations. A principal reason for introducing this new formulation is to achieve an algebraization of the generalized incompleteness theorem, by providing a category-theoretic development of the concepts and tools of elementary recursion theory that are inherent in demonstrating the theorem.Dominical recursion theory avoids the commitment to sets and partial functions which is characteristic of other formulations, and thus allows for an intrinsic recursion theory within such structures as polyadic algebras. It is worthy of notice that much of elementary recursion theory can be developedwithout referencetoelements.By Gödel's generalized incompleteness theorem for consistent arithmetical systemTwe mean any statement of the following sort: if every recursive set is definable inT, thenTis essentially undecidable [41]; or if all recursive functions are definable inT, thenTis essentially undecidable [41]; or if every recursive set is definable inT, thenT0andR0 are recursively inseparable [39]; or if all re sets are representable inT, thenT0is creative [28], [39]; or ifTis a Rosser theory, thenT0andR0are effectively inseparable [39]. (shrink)

In the present paper, these authors argue on actual reasons why Hilbert’s axiomatic program to unify gravitation theory and electromagnetism failed completely. An outline of plausible resolution of this problem is given here, based on: a) Gödel’s incompleteness theorem, b) Newton’s aether stream model. And in another paper we will present our calculation of receding Moon from Earth based on such a matter creation hypothesis. More experiments and observations are called to verify this new hypothesis, albeit it is inspired from (...) Newton’s theory himself. (shrink)

As a senior physicist colleague and our friend, Robert N. Boyd, wrote in a journal (JCFA, Vol. 1,. 2, 2022), Our universe is but one page in a large book [4]. For example, things and Beings can travel between Universes, intentionally or unintentionally. In this short remark, we revisit and offer short remark to Neil’s ideas and trying to connect them with geometrization of musical chords as presented by D. Tymoczko and others, then to Escher staircase and then to (...) Jacob’s ladder which seems to point to possibility to interpret Jacob’s vision as described in the ancient book of Genesis as inter dimensional or heavenly staircase, e.g. an inter dimensional bridge between heaven and earth (see also classic book: Hofstadter, Godel, Escher, Bach). Jacob’s vision of angels going down to earth from that staircase has been depicted for instance in William Blake art etc. In our communication with others via physics literature and discussions etc, we came to several conclusions as follows: Firstly, possibility of quantum wormhole effect to mirror particle universe, which sometimes it is termed non-orientable wormhole. While such mirror particles effect have been more than 50 years predicted with the so-called parity violation (cf. Lee & Yang, 1950s), and that is called symmetry breaking. Secondly, a series of extended experiments on laser irradiated cold water may suggest possible transition from a phase of water to be at least partially fourth phase of water, which may be composed of crystalline water (see e.g. Gerald Pollack, and also Harold Aspden on liquid crystalline). If we can imagine laser cooling effect can be done in protracted time, then we can achieve a physical representation of Aspden’s liquid crystalline. Therefore, in subsequent article (Part II) we outlined simple model of such an effect of tunneling via quantum liquid crystalline Universe, which may likely be modeled with iced-water. It is interesting to remark here that certain experiments by Stockholm University scientists have shown that X-ray triggered water can exhibit properties just like liquid crystal (cf. PRL, 2020). That is why we consider it possible that there can be quantum phase transition where liquid water (comprised of iced cubes and water) can exhibit effects such as tunneling in quantum liquid crystalline Universe. Last but not least, we admit that what we outlined here is just an initial phase; and if you wish, perhaps we can call such experiments as “wormhole-at-lab” experiments (abbreviated: WHALE). (shrink)

The present article was partly inspired by G. Pollack’s book, and also Dadoloff, Saxena & Jensen (2010). As a senior physicist colleague and our friend, Robert N. Boyd, wrote in a journal (JCFA, Vol. 1, No. 2, 2022), for example, things and Beings can travel between Universes, intentionally or unintentionally [4]. In this short remark, we revisit and offer short remark to Neil Boyd’s ideas and trying to connect them with geometry of musical chords as presented by D. Tymoczko (...) and others, then to Escherian staircase and then to Jacob’s ladder which seems to pointto possibility to interpret Jacob’s vision as described in the ancient book of Genesis as interdimensional staircase, e.g. an interdimensional bridge between heaven and earth (cf. classic book: Hofstadter, Godel, Escher, Bach). Jacob’s vision of angels going down to earth from that staircase has been depicted for instance in William Blake art etc. In our communication with others via physics literature and discussions etc, we came to several conclusions as follows: Firstly, possibility of wormhole effect to mirror particle universe, which sometimes it is termed non-orientable wormhole. While such mirror particles effect have been more than 50 years predicted with the so-called parity violation (cf. Lee & Yang, 1950s), and that is called symmetry breaking. Secondly, a series of extended experiments on laser irradiated cold water may suggest possible transition from a phase of water to be at least partially fourth phase of water, which may be composed of crystalline water (see e.g. Gerald Pollack, and also Harold Aspden on liquid crystalline). If we can imagine laser cooling effect can be done in protracted time, then we can achieve a physical representation of Aspden‘s liquid crystalline. Therefore, in this article we outline a series of simple experiments of laser irradiated iced-water along with beryl and selenite crystals in order to see possibility of such a quantum tunneling via quantum liquid crystalline Universe hypothesis, which may likely be modeled with iced-water. It is interesting to remark here that certain experiments by Stockholm University scientists have shown that X-ray triggered water can exhibit properties just like liquid crystal (cf. PRL, 2020). That is why we consider it possible that there can be quantum phase transition where liquid water (comprised of iced cubes and water) can exhibit effects such as tunneling in quantum liquid crystalline Universe. Last but not least, we admit that what we outlined here is just aninitial phase; and if you wish, perhaps we can call such experiments as “wormhole-at-lab” experiments (abbreviated: WHALE). (shrink)

Michael Friedman maintains that Carnap did not fully appreciate the impact of Gödel's first incompleteness theorem on the prospect for a purely syntactic definition of analyticity that would render arithmetic analytically true. This paper argues against this claim. It also challenges a common presumption on the part of defenders of Carnap, in their diagnosis of the force of Gödel's own critique of Carnap in his Gibbs Lecture. The author is grateful to Michael Friedman for valuable comments. Part of the research (...) towards this paper was carried out while the author was a Visiting Fellow at the Center for Philosophy of Science at the University of Pittsburgh. The paper was presented to the Center's Fellowship Reunion Conference in Athens in 1992. It was committed for publication in the Proceedings of that conference, but those Proceedings never appeared. By the time it became evident that they would never appear, both the hard copy and the source file had been mislaid. The hard copy re-surfaced in 2007. The literature on this topic since 1992 appears to leave some space for the ideas and arguments presented here. Although the paper has been updated in light of the more recent literature, its basic thesis, presented in 1992, remains the same. Only 3 is new, questioning a basic presumption made by more recent commentators in their presentation of Gödel's criticism of Carnap in his Gibbs Lecture. For helpful comments on the current version, the author is indebted to Robert Kraut, Stewart Shapiro, and Adam Podlaskowski. CiteULike Connotea Del.icio.us What's this? (shrink)