Jurado: Mario Gómez-Torrente (presidente), Miguel Ángel Fernández Vargas (vocal), Santiago Echeverri Saldarriaga (secretario). [Graduado con Mención Honorífica.].

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.

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)

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)

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)

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)

Gödel has argued that we can cultivate the intuition or perception of abstractconcepts in mathematics and logic. Gödel's ideas about the intuition of conceptsare not incidental to his later philosophical thinking but are related to many otherthemes in his work, and especially to his reflections on the incompleteness theorems.I describe how some of Gödel's claims about the intuition of abstract concepts are related to other themes in his philosophy of mathematics. In most of this paper, however,I focus on a central (...) question that has been raised in the literature on Gödel: what kind of account could be given of the intuition of abstract concepts? I sketch an answer to this question that uses some ideas of a philosopher to whom Gödel also turned in this connection: Edmund Husserl. The answer depends on how we understand the conscious directedness toward objects and the meaning of the term abstract in the context of a theory of the intentionality of cognition. (shrink)

Gödel has argued that we can cultivate the intuition or ‘perception’ of abstractconcepts in mathematics and logic. Gödel's ideas about the intuition of conceptsare not incidental to his later philosophical thinking but are related to many otherthemes in his work, and especially to his reflections on the incompleteness theorems.I describe how some of Gödel's claims about the intuition of abstract concepts are related to other themes in his philosophy of mathematics. In most of this paper, however,I focus on a central (...) question that has been raised in the literature on Gödel: what kind of account could be given of the intuition of abstract concepts? I sketch an answer to this question that uses some ideas of a philosopher to whom Gödel also turned in this connection: Edmund Husserl. The answer depends on how we understand the conscious directedness toward ‘objects’ and the meaning of the term ‘abstract’ in the context of a theory of the intentionality of cognition. (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 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)

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)

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)

We consider certain predicative classes with respect to their bearing on set theory, namely on its semantics, and on its ontological power. On the one hand, our predicative classes will turn out to be perfectly suited for establishing a nice hierarchy of metalanguages starting from the usual set theoretical language. On the other hand, these classes will be seen to be fairly inappropriate for the formulation of strong principles of infinity. The motivation for considering this very type of classes is (...) a reasonable philosophy of set theory. Familiarity is assumed only with basic concepts of both set theory and its philosophy. (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)

Michael Dummett’s realism debate is a semantic dispute about the kind of truth conditions had by a given class of sentences. According to his semantic realist, the truth conditions are potentially verification-transcendent in that they may obtain (or not) despite the fact that we may be forever unable to recognize whether they obtain. According to Dummett’s semantic anti-realist, the truth conditions are of a different sort. Essentially, for the anti-realist, that the truth conditions obtain (whenever they do) is a matter (...) that is always recognizable by us in principle. On this view, truth cannot outrun all possible human knowledge. Unsurprisingly, the outcome of the debate is sometimes said to hinge on whether all truths are knowable.1 More carefully the point of contention is the following.. (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)

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)

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.

In the paper some applications of Gödel's incompleteness theorems to discussions of problems of computer science are presented. In particular the problem of relations between the mind and machine (arguments by J.J.C. Smart and J.R. Lucas) is discussed. Next Gödel's opinion on this issue is studied. Finally some interpretations of Gödel's incompleteness theorems from the point of view of the information theory are presented.

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

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)

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)

According to the iterative conception of set, sets can be arranged in a cumulative hierarchy divided into levels. But why should we think this to be the case? The standard answer in the philosophical literature is that sets are somehow constituted by their members. In the first part of the paper, I present a number of problems for this answer, paying special attention to the view that sets are metaphysically dependent upon their members. In the second part of the paper, (...) I outline a different approach, which circumvents these problems by dispensing with the priority or dependence relation altogether. Along the way, I show how this approach enables the mathematical structuralist to defuse an objection recently raised against her view. (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 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)

Essay review of Daniel Garber, 1992, Descartes' Metaphysical Physics, University of Chicago Press, Chicago and London, xiv + 389 pp., and Michael Friedman,: 1992, Kant and the Exact Sciences, Harvard University Press, Cambridge, Mass., and London, xvii + 357 pp. These two books display the historical connection between science and philosophy in the writings of Descartes and Kant. They show the place of science in, or the scientific context of, these authors' central metaphysical doctrines, pertaining to substance and its properties, (...) the metaphysics of force and causal agency, the relation of geometry to matter and to space, and the structure of cognition. In so doing, they provide an image of philosophy as an intellectually and culturally engaged enterprise, an image according to which it makes little sense to make pronouncements about the foundations of knowledge or the possibilities for science without direct engagement with the living practice of scientific and other cognitive enterprises. However, in some areas they did not engage the context as fully as needed; their interpretations of particular arguments and indeed of whole philosophical programs suffered thereby. (shrink)

Michael Dummett's argument for intuitionism can be criticized for the implicit reliance on the existence of what might be called absolutely undecidable statements. Neil Tennant attacks epistemic optimism, the view that there are no such statements. I expose what seem serious flaws in his attack, and I suggest a way of defending the use of classical logic in arithmetic that circumvents the issue of optimism. I would like to thank an anonymous referee for helpful comments. CiteULike Connotea Del.icio.us What's this?

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)

Ernest Nagel Lecture, Columbia University, Sept. 27, 2007.