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)

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)

Mi objetivo es discutir las principales dificultades que Frank P. Ramsey encontró en Principia Mathematica y la solución que, vía el Tractatus Logico-Philosophicus, propuso al respecto. Sostengo que las principales dificultades que Ramsey encontró en Principia Mathematica están, todas, relacionadas con que Russell y Whitehead desatendieron la forma lógica de las proposiciones matemáticas, las cuales, según Ramsey, deben ser tautológicas.

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

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)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent (in an informal sense) and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. 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 book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. 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 book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal and hyperintensional cognitivism and modal and hyperintensional expressivism. I also develop a novel, topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel, dynamic two-dimensional semantics grounded in two-dimensional hyperintensional Turing machines. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that higher observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between interpretational and objective modalities and the truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first-order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals in the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (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)

We review different conceptions of the set-theoretic multiverse and evaluate their features and strengths. In Sect. 1, we set the stage by briefly discussing the opposition between the ‘universe view’ and the ‘multiverse view’. Furthermore, we propose to classify multiverse conceptions in terms of their adherence to some form of mathematical realism. In Sect. 2, we use this classification to review four major conceptions. Finally, in Sect. 3, we focus on the distinction between actualism and potentialism with regard to the (...) universe of sets, then we discuss the Zermelian view, featuring a ‘vertical’ multiverse, and give special attention to this multiverse conception in light of the hyperuniverse programme introduced in Arrigoni and Friedman (2013). We argue that the distinctive feature of the multiverse conception chosen for the hyperuniverse programme is its utility for finding new candidates for axioms of set theory. (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)

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 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)

It is common in cognitive science to equate computation (and in particular digital computation) with information processing. Yet, it is hard to find a comprehensive explicit account of concrete digital computation in information processing terms. An information processing account seems like a natural candidate to explain digital computation. But when ‘information’ comes under scrutiny, this account becomes a less obvious candidate. Four interpretations of information are examined here as the basis for an information processing account of digital computation, namely Shannon (...) information, algorithmic information, factual information and instructional information. I argue that any plausible account of concrete computation has to be capable of explaining at least the three key algorithmic notions of input, output and procedures. Whist algorithmic information fares better than Shannon information, the most plausible candidate for an information processing account is instructional information. (shrink)

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)

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)

Can an epistemic conception of truth and an endorsement of the excluded middle (together with other principles of classical logic abandoned by the intuitionists) cohabit in a plausible philosophical view? In PART I I describe the general problem concerning the relation between the epistemic conception of truth and the principle of excluded middle. In PART II I give a historical overview of different attitudes regarding the problem. In PART III I sketch a possible holistic solution.

The aim of this paper is to clarify the role of category theory in the foundations of mathematics. There is a good deal of confusion surrounding this issue. A standard philosophical strategy in the face of a situation of this kind is to draw various distinctions and in this way show that the confusion rests on divergent conceptions of what the foundations of mathematics ought to be. This is the strategy adopted in the present paper. It is divided into 5 (...) sections. We first show that already in the set theoretical framework, there are different dimensions to the expression foundations of. We then explore these dimensions more thoroughly. After a very short discussion of the links between these dimensions, we move to some of the arguments presented for and against category theory in the foundational landscape. We end up on a more speculative note by examining the relationships between category theory and set theory. (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.

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)

The purpose of this paper is to apply Crispin Wright’s criteria and various axes of objectivity to mathematics. I test the criteria and the objectivity of mathematics against each other. Along the way, various issues concerning general logic and epistemology are encountered.

The papers where Gerhard Gentzen introduced natural deduction and sequent calculi suggest that his conception of logic differs substantially from the now dominant views introduced by Hilbert, Gödel, Tarski, and others. Specifically, (1) the definitive features of natural deduction calculi allowed Gentzen to assert that his classical system nk is complete based purely on the sort of evidence that Hilbert called ?experimental?, and (2) the structure of the sequent calculi li and lk allowed Gentzen to conceptualize completeness as a question (...) about the relationships among a system's individual rules (as opposed to the relationship between a system as a whole and its ?semantics?). Gentzen's conception of logic is compelling in its own right. It is also of historical interest, because it allows for a better understanding of the invention of natural deduction and sequent calculi. (shrink)

Between the two horns of Jørgensen's dilemma, the authors opt for that according to which logic deals not only with truth and falsity but also with those concepts not possessing this semantic reference. Notwithstanding the “descriptive” prejudice, deontic logic has gained validity among modal logics. The technical foundation proposed consists in an abstract characterization of logical consequence. By identifying in the abstract notion of consequence the primitive from which to begin, it is possible to define the connectives - even those (...) of obligation - by means of the rules of introduction or elimination in a context of derivation. (shrink)

I propose to sketch my views on several aspects of the philosophy of mathematics that I take to be especially relevant to philosophy as a whole. The relevance of my discussion would, I think, become more evident, if the reader keeps in mind the function of (the philosophy of) mathematics in philosophy in providing us with more transparent aspects of general issues. I shall consider: (1) three familiar examples; (2) logic and our conceptual frame; (3) communal agreement and objective certainty; (...) (4) the transcommunal universality of mathematics; (5) the big jump to the potential infinite; (6) the reconciliation of local creation with the hypothesis of discovery; (7) Platonism as realism plus conceptualism; (8) foundational studies and mathematical practice; and (9) the decomposition of philosophical disagreements. The views of Gödel and Wittgenstein are emphasized in order to add specificity to the discussions. (shrink)

The essay centers on Gödel's views on the place of our intuitive concept of time in philosophy and in physics. It presents my interpretation of his work on the theory of relativity, his observations on the relationship between Einstein's theory and Kantian philosophy, as well as some of the scattered remarks in his conversations with me in the seventies — namely, those on the philosophies of Leibniz, Hegel and Husserl — as a successor of Kant — in relation to their (...) conceptions of time. (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)

Can a theory turn back, as it were, upon itselfand vouch for its own features? That is, canthe derived elements of a theory be the veryprimitive terms that provide thepresuppositions of the theory? This form of anall-embracing feature assumes a totality inwhich there occurs quantification over thattotality, quantification that is defined bythis very totality. I argue that the Machprinciple exhibits such a feature ofall-embracing nature. To clarify the argument,I distinguish between on the one handcompleteness and on the other wholeness andtotality, (...) as different all-embracing features:the former being epistemic while the latter –ontological.I propose an analogy between the Mach principleas a possible selection principle in generalrelativity, and the vicious-circle principle infoundations of mathematics. I finally concludewith a consequence of this analogyvis-à-vis completeness and totality,viz., both should be constrained if they wereto be valid concepts for a physical theory. (shrink)

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)

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 view that mathematics deals with ideal objects to which we have epistemic access by a kind of perception has troubled many thinkers. Using ideas from Husserl’s phenomenology, I will take a different look at these matters. The upshot of this approach is that there are non-material objects and that they can be recognized in a process very closely related to sense perception. In fact, the perception of physical objects may be regarded as a special case of this more universal (...) way of recognizing objects of any kind. (shrink)

The object of this paper is to study the analogy, drawn both positively and negatively, between mathematics and fiction. The analogy is more subtle and interesting than fictionalism, which was discussed in part I. Because analogy is not common coin among philosophers, this particular analogy has been discussed or mentioned for the most part just in terms of specific similarities that writers have noticed and thought worth mentioning without much attention's being paid to the larger picture. I intend with this (...) analogy (looking at others' comparisons) to shed a little light on what is going on in mathematics, how one can understand it a bit other than experientially. This intention is philosophical and the way that I am attempting to accomplish it is also philosophical. I shall conclude my attempt to explain how it is possible and even natural for mathematics and fiction to have the analogy they have, taking it for granted, as argued in part I, that they are not to be identified. To this end I shall discuss philosophers' comparisons, mainly those of Hodes, Resnik, Tharp, and Wagner, who are the writers that seem to me to have written most thoughtfully and sufficiently extensively about fiction in making the comparison and of Körner, whose comparison is different. Whether either of these comparisons or the more general analogy is of permanent philosophical interest will have to be decided by philosophers now that they have had a fuller examination. I shall mention some other writers' reference to fiction, but not all; indeed, I am sure that I have not even found all the comparisons that there are. (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)

Let g E(m, n)=o mean that n is the Gödel-number of the shortest derivation from E of an equation of the form (m)=k. Hao Wang suggests that the condition for general recursiveness mn(g E(m, n)=o) can be proved constructively if one can find a speedfunction s s, with s(m) bounding the number of steps for getting a value of (m), such that mn s(m) s.t. g E(m, n)=o. This idea, he thinks, yields a constructivist notion of an effectively computable function, (...) one that doesn't get us into a vicious circle since we intuitively know, to begin with, that certain proofs are constructive and certain functions effectively computable. This paper gives a broad possibility proof for the existence of such classes of effectively computable functions, with Wang's idea of effective computability generalized along a number of dimensions. (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)

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.

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)