The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction of these statements (...) (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities (sets), concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.

This volume examines the limitations of mathematical logic and proposes a new approach to logic intended to overcome them. To this end, the book compares mathematical logic with earlier views of logic, both in the ancient and in the modern age, including those of Plato, Aristotle, Bacon, Descartes, Leibniz, and Kant. From the comparison it is apparent that a basic limitation of mathematical logic is that it narrows down the scope of logic confining it to the study of deduction, without (...) providing tools for discovering anything new. As a result, mathematical logic has had little impact on scientific practice. Therefore, this volume proposes a view of logic according to which logic is intended, first of all, to provide rules of discovery, that is, non-deductive rules for finding hypotheses to solve problems. This is essential if logic is to play any relevant role in mathematics, science and even philosophy. To comply with this view of logic, this volume formulates several rules of discovery, such as induction, analogy, generalization, specialization, metaphor, metonymy, definition, and diagrams. A logic based on such rules is basically a logic of discovery, and involves a new view of the relation of logic to evolution, language, reason, method and knowledge, particularly mathematical knowledge. It also involves a new view of the relation of philosophy to knowledge. This book puts forward such new views, trying to open again many doors that the founding fathers of mathematical logic had closed historically. (shrink)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...) epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Examining the nature of epistemic logic itself, I develop a novel approach to conditions of self-knowledge in the setting of the modal μ-calculus, as well as novel epistemicist solutions to Curry's, the liar, and the knowability paradoxes. Solutions to previously intransigent issues concerning the first-person concept; the distinction between fundamental and derivative truths; and the unity of intention and its role in decision theory, are developed along the way. (shrink)

This paper serves as a kind of field guide to certain passages in the literature which bear upon the foundational theory of abstract objects. The foundational theory assimilates ideas from key philosophers in both the analytical and phenomenological traditions. I explain how my foundational theory of objects serves as a common ground where analytic and phenomenological concerns meet. I try to establish how the theory offers a logic that systematizes a well-known phenomenological kind of entity, and I try to show (...) the various ways the theory systematizes the ideas of many analytic philosophers. The ideas of Plato, Leibniz, Frege, Russell, Goedel and even Kripke become connected through those of Brentano, Meinong, Husserl, and Mally. -/- The field guide will not only document the passages in which the distinction between two kinds of predication originates, but also document the other surprising, and often unrelated, contexts where the distinction reappears in the work of others. It will also document ways in which the theory can be used to represent precisely the ideas of the philosophers mentioned above. The resulting guide will bring together the works of many different authors, including some clearly within the analytic tradition, some clearly within the phenomenological tradition, and some who straddle the divide. (shrink)

G. Priest's anti-consistency argument (Priest 1979, 1984, 1987) and J. R. Lucas's anti-mechanist argument (Lucas 1961, 1968, 1970, 1984) both appeal to Gödel incompleteness. By way of refuting them, this paper defends the thesis of quartet compatibility, viz., that the logic of the mind can simultaneously be Gödel incomplete, consistent, mechanical, and recursion complete (capable of all means of recursion). A representational approach is pursued, which owes its origin to works by, among others, J. Myhill (1964), P. Benacerraf (1967), J. (...) Webb (1980, 1983) and M. Arbib (1987). It is shown that the fallacy shared by the two arguments under discussion lies in misidentifying two systems, the one for which the Gödel sentence is constructable and to be proved, and the other in which the Gödel sentence in question is indeed provable. It follows that the logic of the mind can surpass its own Gödelian limitation not by being inconsistent or non-mechanistic, but by being capable of representing stronger systems in itself; and so can a proper machine. The concepts of representational provability, representational maximality, formal system capacity, etc., are discussed. (shrink)

Gödel argued that the incompleteness theorems entail that the mind is not a machine, or that certain arithmetical propositions are absolutely undecidable. His view was that the mind is not a machine, and that no arithmetical propositions are absolutely undecidable. I argue that his position presupposes that the idealized mathematician has an ability which I call the recursive-ordinal recognition ability. I show that we have this ability if, and only if, there are no absolutely undecidable arithmetical propositions. I argue that (...) there are such propositions, but that no recognizable example of one can be identified, even in principle. (shrink)

It is by now well known that Gödel first advocated the philosophy of Leibniz and then, since 1959, that of Husserl. This raises three questions:1.How is this turn to Husserl to be interpreted? Is it a dismissal of the Leibnizian philosophy, or a different way to achieve similar goals?2.Why did Gödel turn specifically to the later Husserl's transcendental idealism?3.Is there any detectable influence from Husserl on Gödel's writings?Regarding the first question, Wang [96, p.165] reports that Gödel ‘[saw] in Husserl's work (...) a method of refining and consolidating Leibniz' monadology’. But what does this mean? In what for Gödel relevant sense is Husserl's work a refinement and consolidation of Leibniz' monadology?The second question is particularly pressing, given that Gödel was, by his own admission, a realist in mathematics since 1925. Wouldn't the uncompromising realism of the early Husserl's Logical investigations have been a more obvious choice for a Platonist like Gödel?The third question can only be approached when an answer to the second has been given, and we want to suggest that the answer to the first question follows from the answer to the second. We begin, therefore, with a closer look at the actual turn towards phenomenology.Some 30 years before his serious study of Husserl began, Gödel was well aware of the existence of phenomenology. Apart from its likely appearance in the philosophy courses that Gödel took, it reached him from various directions. (shrink)

During the first half of the twentieth century, mainstream answers to the foundational crisis, mainly triggered by Russell and Gödel, remained largely perfectibilist in nature. Along with a general naturalist wave in the philosophy of science, during the second half of that century, this idealist picture was finally challenged and traded in for more realist ones. Next to the necessary preliminaries, the present paper proposes a structured view of various philosophical accounts of mathematics indebted to this general idea, laying the (...) ground for a desirable integration of their strenghts. (shrink)

Leibniz had a well-known argument against the existence of infinite wholes that is based on the part-whole axiom: the whole is greater than the part. The refutation of this argument by Russell and others is equally well known. In this note, I argue (against positions recently defended by Arthur, Breger, and Brown) for the following three claims: (1) Leibniz himself had all the means to devise and accept this refutation; (2) This refutation does not presuppose the consistency of Cantorian set (...) theory; (3) This refutation does not cast doubt on the part-whole axiom. Hence, should there be an obstacle to Gödel's wish to integrate Cantorian set theory within Leibniz' philosophy, it will not be this famous argument of Leibniz'. (shrink)

We document the influence on programming language semantics of the Platonism/formalism divide in the philosophy of mathematics.

In this paper I argue that it is more difficult to see how Godel's incompleteness theorems and related consistency proofs for formal systems are consistent with the views of formalists, mechanists and traditional intuitionists than it is to see how they are consistent with a particular form of mathematical realism. If the incompleteness theorems and consistency proofs are better explained by this form of realism then we can also see how there is room for skepticism about Church's Thesis and the (...) claim that minds are machines. (shrink)

Godel began to seriously study Husserl's phenomenology in 1959, and the Godel Nachlass is known to contain many notes on Husserl. In this paper I describe what is presently known about Godel's interest in phenomenology. Among other things, it appears that the 1963 supplement to "What is Cantor's Continuum Hypothesis?", which contains Godel's famous views on mathematical intuition, may have been influenced by Husserl. I then show how Godel's views on mathematical intuition and objectivity can be readily interpreted in a (...) phenomenological theory of intuition and mathematical knowledge. (shrink)

In a lecture manuscript written around 1961, Gödel describes a philosophical path from the incompleteness theorems to Husserl's phenomenology. It is known that Gödel began to study Husserl's work in 1959 and that he continued to do so for many years. During the 1960s, for example, he recommended the sixth investigation of Husserl's Logical Investigations to several logicians for its treatment of categorial intuition. While Gödel may not have been satisfied with what he was able to obtain from philosophy and (...) Husserl's phenomenology, he nonetheless continued to recommend Husserl's work to logicians as late as the 1970s. In this paper I present and discuss the kinds of arguments that led Gödel to the work of Husserl. Among other things, this should help to shed additional light on Gödel's philosophical and scientific ideas and to show to what extent these ideas can be viewed as part of a unified philosophical outlook. Some of the arguments that led Gödel to Husserl's work are only hinted at in Gödel's 1961 paper, but they are developed in much more detail in Gödel's earlier philosophical papers. In particular, I focus on arguments concerning Hilbert's program and an early version of Carnap's program.§1. Some ideas from phenomenology. Since Husserl's work is not generally known to mathematical logicians, it may be helpful to mention briefly a few details about his background. (shrink)

In his 1951 Gibbs Lecture Gödel formulates the central implication of the incompleteness theorems as a disjunction: either the human mind infinitely surpasses the powers of any finite machine or there exist absolutely unsolvable diophantine problems (of a certain type). In his later writings in particular Gödel favors the view that the human mind does infinitely surpass the powers of any finite machine and there are no absolutely unsolvable diophantine problems. I consider how one might defend such a view in (...) light of Gödel's remark that one can turn to ideas in Husserlian transcendental phenomenology to show that the human mind ‘contains an element totally different from a finite combinatorial mechanism’. (shrink)

The paper is devoted to phenomenological ideas in conceptions of modern philosophy of mathematics. Views of Husserl, Weyl, Becker andGödel will be discussed and analysed. The aim of the paper is to show the influence of phenomenological ideas on the philosophical conceptions concerning mathematics. We shall start by indicating the attachment of Edmund Husserl to mathematics and by presenting the main points of his philosophy of mathematics. Next, works of two philosophers who attempted to apply Husserl’s phenomenological ideas to the (...) philosophy of mathematics, namely Hermann Weyl and Oskar Becker, will be briefly discussed. Lastly, the connections between Husserl’s ideas and the philosophy of mathematics of Kurt Gödel will be studied. (shrink)

The use of tensed language and the metaphor of set ‘formation’ found in informal descriptions of the iterative conception of set are seldom taken at all seriously. Both are eliminated in the nonmodal stage theories that formalise this account. To avoid the paradoxes, such accounts deny the Maximality thesis, the compelling thesis that any sets can form a set. This paper seeks to save the Maximality thesis by taking the tense more seriously than has been customary (although not literally). A (...) modal stage theory, MST, is developed in a bimodal language, governed by a tenselike logic. Such a language permits a very natural axiomatisation of the iterative conception, which upholds the Maximality thesis. It is argued that the modal approach is consonant with mathematical practice and a plausible metaphysics of sets and shown that MST interprets a natural extension of Zermelo set theory less the axiom of Infinity and, when extended with a further axiom concerning the extent of the hierarchy, interprets Zermelo–Fraenkel set theory. (shrink)

Neologicists have sought to ground mathematical knowledge in abstraction. One especially obstinate problem for this account is the bad company problem. The leading neologicist strategy for resolving this problem is to attempt to sift the good abstraction principles from the bad. This response faces a dilemma: the system of ‘good’ abstraction principles either falls foul of the Scylla of inconsistency or the Charybdis of being unable to recover a modest portion of Zermelo–Fraenkel set theory with its intended generality. This article (...) argues that the bad company problem is due to the ‘static’ character of abstraction on the neologicist's account and develops a ‘dynamic’ account of abstraction that avoids both horns of the dilemma. 1 Introduction2ion Reconstructed3 From Bad to Worse4 Abstraction Reconceived5 Bad Company Made GoodA AppendixA.1SemanticsA.2LogicA.3ConsistencyA.4Strength. (shrink)

The incompleteness theorems constitute the mathematical core of Gödel’s philosophical challenge. They are given in their “most satisfactory form”, as Gödel saw it, when the formality of theories to which they apply is characterized via Turing machines. These machines codify human mechanical procedures that can be carried out without appealing to higher cognitive capacities. The question naturally arises, whether the theorems justify the claim that the human mind has mathematical abilities that are not shared by any machine. Turing admits that (...) non-mechanical steps of intuition are needed to transcend particular formal theories. Thus, there is a substantive point in comparing Turing’s views with Gödel’s that is expressed by the assertion, “The human mind infinitely surpasses any finite machine”. The parallelisms and tensions between their views are taken as an inspiration for beginning to explore, computationally, the capacities of the human mathematical mind. (shrink)

The idea that logic and reasoning are somehow related goes back to antiquity. It clearly underlies much of the work in logic, as witnessed by the development of computability, and formal and mechanical deductive systems, for example. On the other hand, a platitude is that logic is the study of correct reasoning; and reasoning is cognitive if anything Is. Thus, the relationship between logic, computation, and correct reasoning makes an interesting and historically central case study for mechanism. The purpose of (...) this article is to begin the articulation of this relationship, pointing out its sources and its limitations. (shrink)

§1. Overview. Philosophers and mathematicians have drawn lots of conclusions from Gödel's incompleteness theorems, and related results from mathematical logic. Languages, minds, and machines figure prominently in the discussion. Gödel's theorems surely tell us something about these important matters. But what?A descriptive title for this paper would be “Gödel, Lucas, Penrose, Turing, Feferman, Dummett, mechanism, optimism, reflection, and indefinite extensibility”. Adding “God and the Devil” would probably be redundant. Despite the breath-taking, whirlwind tour, I have the modest aim of forging (...) connections between different parts of this literature and clearing up some confusions, together with the less modest aim of not introducing any more confusions.I propose to focus on three spheres within the literature on incompleteness. The first, and primary, one concerns arguments that Gödel's theorem refutes the mechanistic thesis that the human mind is, or can be accurately modeled as, a digital computer or a Turing machine. The most famous instance is the much reprinted J. R. Lucas [18]. To summarize, suppose that a mechanist provides plans for a machine,M, and claims that the output ofMconsists of all and only the arithmetic truths that a human, or the totality of human mathematicians, will ever or can ever know. We assume that the output ofMis consistent. (shrink)

1. Philosophical background: iteration, ineffability, reflection. There are at least two heuristic motivations for the axioms of standard set theory, by which we mean, as usual, first-order Zermelo–Fraenkel set theory with the axiom of choice (ZFC): the iterative conception and limitation of size (see Boolos, 1989). Each strand provides a rather hospitable environment for the hypothesis that the set-theoretic universe is ineffable, which is our target in this paper, although the motivation is different in each case.

This is a critical analysis of the first part of Go¨del’s 1951 Gibbs lecture on certain philosophical consequences of the incompleteness theorems. Go¨del’s discussion is framed in terms of a distinction between objective mathematics and subjective mathematics, according to which the former consists of the truths of mathematics in an absolute sense, and the latter consists of all humanly demonstrable truths. The question is whether these coincide; if they do, no formal axiomatic system (or Turing machine) can comprehend the mathematizing (...) potentialities of human thought, and, if not, there are absolutely unsolvable mathematical problems of diophantine form. (shrink)

Justified belief is a core concept in epistemology and there has been an increasing interest in its logic over the last years. While many logical investigations consider justified belief as an operator, in this paper, we propose a logic for justified belief in which the relevant notion is treated as a predicate instead. Although this gives rise to the possibility of liar-like paradoxes, a predicate treatment allows for a rich and highly expressive framework, which lives up to the universal ambitions (...) of investigating epistemological concepts. We start with a base theory for justified belief, and then systematically present putative additional axioms for justified belief. We provide an overview of consistency results when the additional principles are added to the base theory, and discuss their philosophical plausibility. (shrink)

Normal 0 21 false false false PT-BR X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Tabela normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin-top:0cm; mso-para-margin-right:0cm; mso-para-margin-bottom:10.0pt; mso-para-margin-left:0cm; line-height:115%; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} No presente artigo expomos alguns aspectos das concepções gödelianas acerca da percepção. Procuramos mostrar aqui que a comparação realizada por Gödel entre percepção sensível e racional, bem como suas concepções sobre esta última, correspondem a (...) uma análise do conceito de percepção. Em uma primeira seção, expomos a analogia gödeliana entre percepção sensível e racional, salientando que ambas são comparadas tendo em vista seu status de relação de acesso a entes. A partir disto, argumentamos, na segunda seção, que subjazendo à analogia há uma análise do conceito de percepção como o conceito geral ou formal de uma relação de acesso, do qual a percepção sensível e a racional são casos particulares. Tal análise, como defendemos, acaba por ser mais adequada ao uso comum que fazemos deste conceito do que pareceria à primeira vista. (shrink)

The formalism of mathematics has always inspired ontological theorization based on it. As is evident from his magnum opus Being and Event, Alain Badiou remains one of the most important contemporary contributors to this enterprise. His famous maxim—“mathematics is ontology” has its basis in the ingenuity that he has shown in capitalizing on Gödel’s and Cohen’s work in the field of set theory. Their work jointly establish the independence of the continuum hypothesis from the standard axioms of Zermelo–Fraenkel set theory, (...) with Gödel’s result showing their consistency to the affirmative, while Cohen’s showing it to the negative. These results serve as the cornerstone of Badiou’s mathematical ontology. In it, drawing heavily on Cohen’s technically formidable method of forcing, Badiou makes the latter result the key to his defense of the possibility of a faithful tracing of the consequences in the ‘state’ of an ‘event’ by a ‘subject’. Whereas, Gödel’s result based on the assumption of constructability becomes the pivot for criticism of the general philosophical orientation that Badiou calls ‘constructivism’. Viewed from a position internal to mathematical formalism itself, and taking into account the twentieth century developments in the relevant field, Badiou’s stance seems to be neither appreciative of the actual course of such developments, nor just to the philosophical view point that was actually maintained by Gödel. In the present paper, this concern is intended to be substantiated through an exposition of certain facts pertaining to the said developments as well as to Gödel’s philosophical inclinations. (shrink)

This paper reassesses the criticism of the Lucas-Penrose anti-mechanist argument, based on Gödel’s incompleteness theorems, as formulated by Krajewski : this argument only works with the additional extra-formal assumption that “the human mind is consistent”. Krajewski argues that this assumption cannot be formalized, and therefore that the anti-mechanist argument – which requires the formalization of the whole reasoning process – fails to establish that the human mind is not mechanistic. A similar situation occurs with a corollary to the argument, that (...) the human mind allegedly outperforms machines, because although there is no exhaustive formal definition of natural numbers, mathematicians can successfully work with natural numbers. Again, the corollary requires an extra-formal assumption: “PA is complete” or “the set of all natural numbers exists”. I agree that extra-formal assumptions are necessary in order to validate the anti-mechanist argument and its corollary, and that those assumptions are problematic. However, I argue that formalization is possible and the problem is instead the circularity of reasoning that they cause. The human mind does not prove its own consistency, and outperforms the machine, simply by making the assumption “I am consistent”. Starting from the analysis of circularity, I propose a way of thinking about the interplay between informal and formal in mathematics. (shrink)

Turing and Church formulated two different formal accounts of computability that turned out to be extensionally equivalent. Since the accounts refer to different properties they cannot both be adequate conceptual analyses of the concept of computability. This insight has led to a discussion concerning which account is adequate. Some authors have suggested that this philosophical debate—which shows few signs of converging on one view—can be circumvented by regarding Church’s and Turing’s theses as explications. This move opens up the possibility that (...) both accounts could be adequate, albeit in their own different ways. In this paper, I focus on the question of whether Church’s thesis can be seen as an explication in the precise Carnapian sense. Most importantly, I address an additional constraint that Carnap puts on the explicative power of axiomatic systems—an axiomatisation explicates when it is clear which mathematical entities form the theory’s intended model—and that implicitly applies to axiomatisations of recursion theory used in Church’s account of computability. To overcome this difficulty, I propose two possible clarifications of the pre-systematic concept of “computability” that can both be captured in recursion theory, and I show how both clarifications avoid an objection arising from Carnap’s constraint. (shrink)

del's appeal to mathematical intuition to ground our grasp of the axioms of set theory, is notorious. I extract from his writings an account of this form of intuition which distinguishes it from the metaphorical platonism of which Gödel is sometimes accused and brings out the similarities between Gödel's views and Dummett's.

This paper concerns Alan Turing’s ideas about machines, mathematical methods of proof, and intelligence. By the late 1930s, Kurt Gödel and other logicians, including Turing himself, had shown that no finite set of rules could be used to generate all true mathematical statements. Yet according to Turing, there was no upper bound to the number of mathematical truths provable by intelligent human beings, for they could invent new rules and methods of proof. So, the output of a human mathematician, for (...) Turing, was not a computable sequence (i.e., one that could be generated by a Turing machine). Since computers only contained a finite number of instructions (or programs), one might argue, they could not reproduce human intelligence. Turing called this the “mathematical
objection” to his view that machines can think. Logico-mathematical reasons, stemming from his own work, helped to convince Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. He felt it
should be possible to program a computer so that it could learn or discover new rules, overcoming the limitations imposed by the incompleteness and undecidability results in the same way that human
mathematicians presumably do. (shrink)

Kurt Gödel made many affirmations of robust realism but also showed serious engagement with the idealist tradition, especially with Leibniz, Kant, and Husserl. The root of this apparently paradoxical attitude is his conviction of the power of reason. The paper explores the question of how Gödel read Kant. His argument that relativity theory supports the idea of the ideality of time is discussed critically, in particular attempting to explain the assertion that science can go beyond the appearances and ‘approach the (...) things’. Leibniz and post-Kantian idealism are discussed more briefly, the latter as documented in the correspondence with Gotthard Günther. (shrink)

For over a decade, the hypercomputation movement has produced computational models that in theory solve the algorithmically unsolvable, but they are not physically realizable according to currently accepted physical theories. While opponents to the hypercomputation movement provide arguments against the physical realizability of specific models in order to demonstrate this, these arguments lack the generality to be a satisfactory justification against the construction of any information-processing machine that computes beyond the universal Turing machine. To this end, I present a more (...) mathematically concrete challenge to hypercomputability, and will show that one is immediately led into physical impossibilities, thereby demonstrating the infeasibility of hypercomputers more generally. This gives impetus to propose and justify a more plausible starting point for an extension to the classical paradigm that is physically possible, at least in principle. Instead of attempting to rely on infinities such as idealized limits of infinite time or numerical precision, or some other physically unattainable source, one should focus on extending the classical paradigm to better encapsulate modern computational problems that are not well-expressed/modeled by the closed-system paradigm of the Turing machine. I present the first steps toward this goal by considering contemporary computational problems dealing with intractability and issues surrounding cyber-physical systems, and argue that a reasonable extension to the classical paradigm should focus on these issues in order to be practically viable. (shrink)

In his text ‘The modern development of the foundations of mathematics in the light of philosophy’ from around 1961, Gödel announces a turn to Husserl's phenomenology to find the foundations of mathematics. In Gödel's archive there are two draft letters that shed some further light on the exact strategy that he formulated for himself in the early 1960s. Transcriptions of these letters are presented, together with some comments.

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

Intuitively, an object is something that coheres internally and is largely independent of its environment. But what is the environment? Viewed at one scale, it surrounds and separates objects and differentiates them. Viewed at another scale, it is itself a collection of objects surrounded by environment. At all scales, we describe the world in terms of objects in an environment. I examine the nature of the environment and its role in mediating the object-subject relation. This dedicated analysis of the environment (...) provides a new perspective on the notion of objectivity. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Naturalism in philosophy is sometimes thought to imply both scientific realism and a brand of mathematical realism that has methodological consequences for the practice of mathematics. I suggest that naturalism does not yield such a brand of mathematical realism, that naturalism views ontology as irrelevant to mathematical methodology, and that approaching methodological questions from this naturalistic perspective illuminates issues and considerations previously overshadowed by (irrelevant) ontological concerns.

The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy (...) of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent, and that we cannot fully describe our notion of a natural number. (shrink)

During the first half of the twentieth century, mainstream answers to the foundational crisis, mainly triggered by Russell and Gödel, remained largely perfectibilist in nature. Along with a general naturalist wave in the philosophy of science, during the second half of that century, this idealist picture was finally challenged and traded in for more realist ones. Next to the necessary preliminaries, the present paper proposes a structured view of various philosophical accounts of mathematics indebted to this general idea, laying the (...) ground for a desirable integration of their strenghts. (shrink)

This article serves to present a large mathematical perspective and historical basis for the Axiom of Replacement as well as to affirm its importance as a central axiom of modern set theory.

Ernst Friedrich Ferdinand Zermelo (1871–1953) transformed the set theory of Cantor and Dedekind in the first decade of the 20th century by incorporating the Axiom of Choice and providing a simple and workable axiomatization setting out generative set-existence principles. Zermelo thereby tempered the ontological thrust of early set theory, initiated the delineation of what is to be regarded as set-theoretic, drawing out the combinatorial aspects from the logical, and established the basic conceptual framework for the development of modern set theory. (...) Two decades later Zermelo promoted a distinctive cumulative hierarchy view of models of set theory and championed the use of infinitary logic, anticipating broad modern developments. In this paper Zermelo's published mathematical work in set theory is described and analyzed in its historical context, with the hindsight afforded by the awareness of what has endured in the subsequent development of set theory. Elaborating formulations and results are provided, and special emphasis is placed on the to and fro surrounding the Schröder-Bernstein Theorem and the correspondence and comparative approaches of Zermelo and Gödel. Much can be and has been written about philosophical and biographical issues and about the reception of the Axiom of Choice, and we will refer and defer to others, staying the course through the decidedly mathematical themes and details. (shrink)

In set theory, a maximality principle is a principle that asserts some maximality property of the universe of sets or some part thereof. Set theorists have formulated a variety of maximality principles in order to settle statements left undecided by current standard set theory. In addition, philosophers of mathematics have explored maximality principles whilst attempting to prove categoricity theorems for set theory or providing criteria for selecting foundational theories. This article reviews recent work concerned with the formulation, investigation and justification (...) of maximality principles. (shrink)