Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.

We construct a machine that knows its own code, at the price of not knowing its own factivity.

If mathematics is regarded as a science, then the philosophy of mathematics can be regarded as a branch of the philosophy of science, next to disciplines such as the philosophy of physics and the philosophy of biology. However, because of its subject matter, the philosophy of mathematics occupies a special place in the philosophy of science. Whereas the natural sciences investigate entities that are located in space and time, it is not at all obvious that this is also the case (...) with respect to the objects that are studied in mathematics. In addition to that, the methods of investigation of mathematics differ markedly from the methods of investigation in the natural sciences. Whereas the latter acquire general knowledge using inductive methods, mathematical knowledge appears to be acquired in a different way, namely, by deduction from basic principles. The status of mathematical knowledge also appears to differ from the status of knowledge in the natural sciences. The theories of the natural sciences appear to be less certain and more open to revision than mathematical theories. For these reasons mathematics poses problems of a quite distinctive kind for philosophy. Therefore philosophers have accorded special attention to ontological and epistemological questions concerning mathematics. (shrink)

Though my ultimate concern is with issues in epistemology and metaphysics, let me phrase the central question I will pursue in terms evocative of philosophy of religion: What are the implications of our logic-in particular, of Cantor and G6del-for the possibility of omniscience?

The emperor's new mind (hereafter Emperor) is an attempt to put forward a scientific alternative to the viewpoint of according to which mental activity is merely the acting out of some algorithmic procedure. John Searle and other thinkers have likewise argued that mere calculation does not, of itself, evoke conscious mental attributes, such as understanding or intentionality, but they are still prepared to accept the action the brain, like that of any other physical object, could in principle be simulated by (...) a computer. In Emperor I go further than this and suggest that the outward manifestations ofconscious mental activity cannot even be properly simulated by calculation. To support this view, I use various arguments to show that the results of mathematical insight, in particular, do not seem to be obtained algorithmically. The main thrust ofthis work, however, is to present an overview ofthe present state of physical understanding and to show that an important gap exists at the point where, quantum and classical physics meet, as well as to speculate on how the conscious brain might be taking advantage ofwhatever new physics is needed to fill this gap to achieve its nonalgorithmic effects. (shrink)

Philosophical Perspectives, Volume 35, Issue 1, Page 189-205, December 2021.

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)

We study the structure of families of theories in the language of arithmetic extended to allow these families to refer to one another and to themselves. If a theory contains schemata expressing its own truth and expressing a specific Turing index for itself, and contains some other mild axioms, then that theory is untrue. We exhibit some families of true self-referential theories that barely avoid this forbidden pattern.

A critique of algorithmic rationalisation offers at best some initial reasons and preliminary ideas. Critique is understood as a reflection on validity. It is limited to an “epistemological investigation” of the limits of the calculable or of what appears “knowable” in the mode of the algorithmic. The argumentation aims at the mathematical foundations of computer science and goes back to the so-called “foundational crisis of mathematics” at the beginning of the 20th century with the attempt to formalise concepts such as (...) calculability, decidability and provability. The Gödel theorems and Turing’s halting problem prove to be essential for any critical approach to “algorithmic rationalisation”. Both, however, do not provide unambiguous results, at best they run towards what later became known as “Gödel’s disjunction”. The chosen path here, however, suggests the opposite way, insofar as, on the one hand, the topos of creativity appear constitutive for what can be regarded as cognitive “algorithmic rationalisation” and which encounters systematic difficulties in the evaluation of non-trivial results. On the other hand, the investigations lead to a comparison between the “mediality” of formally generated structures, which have to distinguish between object-and metalanguages, and the “volatile” differentiality of human thought, which calls for syntactically non-simulatable sense structures. (shrink)

This paper investigates the determinacy of mathematics. We begin by clarifying how we are understanding the notion of determinacy before turning to the questions of whether and how famous independence results bear on issues of determinacy in mathematics. From there, we pose a metasemantic challenge for those who believe that mathematical language is determinate, motivate two important constraints on attempts to meet our challenge, and then use these constraints to develop an argument against determinacy and discuss a particularly popular approach (...) to resolving indeterminacy, before offering some brief closing reflections. We believe our discussion poses a serious challenge for most philosophical theories of mathematics, since it puts considerable pressure on all views that accept a non-trivial amount of determinacy for even basic arithmetic. (shrink)

This is the most comprehensive book ever published on philosophical methodology. A team of thirty-eight of the world's leading philosophers present original essays on various aspects of how philosophy should be and is done. The first part is devoted to broad traditions and approaches to philosophical methodology. The entries in the second part address topics in philosophical methodology, such as intuitions, conceptual analysis, and transcendental arguments. The third part of the book is devoted to essays about the interconnections between philosophy (...) and neighbouring fields, including those of mathematics, psychology, literature and film, and neuroscience. (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)

We first discuss Michael Dummett’s philosophy of mathematics and Robert Brandom’s philosophy of language to demonstrate that inferentialism entails the falsity of Church’s Thesis and, as a consequence, the Computational Theory of Mind. This amounts to an entirely novel critique of mechanism in the philosophy of mind, one we show to have tremendous advantages over the traditional Lucas-Penrose argument.

Two unpublished contributions to meetings can be found in the Alfred Tarski Papers, at the University of California, Berkeley. The meetings took place in 1965, in Chicago and London, respectively....

Sections 3.16 and 3.23 of Roger Penrose's Shadows of the mind (Oxford, Oxford University Press, 1994) contain a subtle and intriguing new argument against mechanism, the thesis that the human mind can be accurately modeled by a Turing machine. The argument, based on the incompleteness theorem, is designed to meet standard objections to the original Lucas-Penrose formulations. The new argument, however, seems to invoke an unrestricted truth predicate (and an unrestricted knowability predicate). If so, its premises are inconsistent. The usual (...) ways of restricting the predicates either invalidate Penrose's reasoning or require presuppositions that the mechanist can reject. (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)

The article discusses the V.V. Tselishchev’s original and unique systematic study of the specific and extremely complicated problems of Gödel results regarding the question of artificial intelligence essence. Tselishchev argues that the reflexive property should be considered not only as an advantage of human reasoning, but also as an objective internal limitation that appears in case of adding Gödel sentence to a theory to build a new theory. The article analyzes so-called mentalistic Gödel’s argument for fundamental superiority of human intelligence (...) over machine one and the non-algorithmic nature of natural thinking. The discussion about the Gödel argument is not entirely speculative, but contains new knowledge. An example of such knowledge are the results of R. Smullyan levels of computers “awareness,” which are may be interpreted in a psychophysical sense. The concept of “zero level of intelligence” is proposed for such a reflexive property as “awareness of selfconsciousness.” Reflexive ranks below the awareness of self-consciousness can be considered negative levels of thinking in the sense that the intelligence, being reduced to them, significantly loses its completeness. Even self-consciousness turns out to be a negative level of thinking, since, according to Smullyan, the subject of self-consciousness is unaware of the type of thought to which he belongs. A thought experiment is proposed that allows us to establish the distribution of the properties of Smullyan stability and normality and to answer the question “Does an intuitive belief in the truth of a formal proof affect the truth of a proposition being proved?” According to intuitionism, the most unpleasant epistemic property is instability: beliefs that are not based on deep intuitions have no value. According to the constructivist philosophy of mathematics, instability is a less negative property than abnormality: the fact that high-ranking beliefs cannot be immersed to the very foundations is not significant because violation of truth due to lowering the rank of reflection is not critical. (shrink)

More intellectual modesty, but also conceptual clarity is urgently needed in AI, perhaps more than in many other disciplines. AI research has been coined by hypes and hubris since its early beginnings in the 1950s. For instance, the Nobel laureate Herbert Simon predicted after his participation in the Dartmouth workshop that “machines will be capable, within 20 years, of doing any work that a man can do”. And expectations are in some circles still high to overblown today. This paper addresses (...) the demand for conceptual clarity and introduces precise definitions of “strong AI”, “superintelligence”, the “technological singularity”, and “artificial general intelligence” which ground in the work by the computer scientist Judea Pearl and the psychologist Howard Gardner. These clarifications allow us to embed famous arguments from the philosophy of AI in a more analytic context. (shrink)

This is a paper for a special issue of Semiotic Studies devoted to Stanislaw Krajewski’s paper. This paper gives some supplementary notes to Krajewski’s on the Anti-Mechanist Arguments based on Gödel’s incompleteness theorem. In Section 3, we give some additional explanations to Section 4–6 in Krajewski’s and classify some misunderstandings of Gödel’s incompleteness theorem related to AntiMechanist Arguments. In Section 4 and 5, we give a more detailed discussion of Gödel’s Disjunctive Thesis, Gödel’s Undemonstrability of Consistency Thesis and the definability (...) of natural numbers as in Section 7–8 in Krajewski’s, describing how recent advances bear on these issues. (shrink)

Lucas-Penrose type arguments have been the focus of many papers in the literature. In the present paper we attempt to evaluate the consequences of Gödel’s incompleteness theorems for the philosophy of the mind. We argue that the best answer to this question was given by Gödel already in 1951 when he realized that either our intellectual capability is not representable by a Turing Machine, or we can never know with mathematical certainty what such a machine is. But his considerations became (...) known only in recent times when many scholars were already aware of Benacerraf’s and Chihara’s analyses on the consequences of Gödel’s incompleteness theorems for the philosophy of the mind. Benacerraf and Chihara, in fact, discussing Lucas’ paper, arrived at the same conclusions as Gödel in the sixties, but in a more formal way. After Penrose’s provocative arguments, Shapiro again shed light on the question. In our paper, after a broad and simple presentation of the contributions to the debate made by different authors, we show how to present Gödel’s argument in a rigorous way, highlighting the necessary philosophical premises of Gödel’s argument and more in general of Gödelian arguments. (shrink)

This paper presents, from a historical and logical-philosophical perspective, the Gödelian arguments of two Oxford scholars, John Lucas and Roger Penrose. Both have been based on Gödel's Theorem to refute mechanism, computationalism and the possibility of creating an AI capable of simulating or duplicating the human mind. In the conclusions, the growing application of empirical methods in mathematics is mentioned and a possible path that would support Lucas and Penrose's arguments is speculated.

Artificial Neural Networks have reached “grandmaster” and even “super-human” performance across a variety of games, from those involving perfect information, such as Go, to those involving imperfect information, such as “Starcraft”. Such technological developments from artificial intelligence (AI) labs have ushered concomitant applications across the world of business, where an “AI” brand-tag is quickly becoming ubiquitous. A corollary of such widespread commercial deployment is that when AI gets things wrong—an autonomous vehicle crashes, a chatbot exhibits “racist” behavior, automated credit-scoring processes (...) “discriminate” on gender, etc.—there are often significant financial, legal, and brand consequences, and the incident becomes major news. As Judea Pearl sees it, the underlying reason for such mistakes is that “... all the impressive achievements of deep learning amount to just curve fitting.” The key, as Pearl suggests, is to replace “reasoning by association” with “causal reasoning” —the ability to infer causes from observed phenomena. It is a point that was echoed by Gary Marcus and Ernest Davis in a recent piece for theNew York Times: “we need to stop building computer systems that merely get better and better at detecting statistical patterns in data sets—often using an approach known as ‘Deep Learning’—and start building computer systems that from the moment of their assembly innately grasp three basic concepts: time, space, and causality.” In this paper, foregrounding what in 1949 Gilbert Ryle termed “a category mistake”, I will offer an alternative explanation for AI errors; it is not so much that AI machinery cannot “grasp” causality, but that AI machinery (qua computation) cannot understand anything at all. (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)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

We argue that the set of humanly known mathematical truths (at any given moment in human history) is finite and so recursive. But if so, then given various fundamental results in mathematical logic and the theory of computation (such as Craig’s in J Symb Log 18(1): 30–32(1953) theorem), the set of humanly known mathematical truths is axiomatizable. Furthermore, given Godel’s (Monash Math Phys 38: 173–198, 1931) First Incompleteness Theorem, then (at any given moment in human history) humanly known mathematics must (...) be either inconsistent or incomplete. Moreover, since humanly known mathematics is axiomatizable, it can be the output of a Turing machine. We then argue that any given mathematical claim that we could possibly know could be the output of a Turing machine, at least in principle. So the Lucas-Penrose (Lucas in Philosophy 36:112–127, 1961; Penrose, in The Emperor’s new mind. Oxford University Press, Oxford (1994)) argument cannot be sound. (shrink)

This piece continues the tradition of arguments by John Lucas, Roger Penrose and others to the effect that the human mind is not a machine. Kurt Gödel thought that the intensional paradoxes stand in the way of proving that the mind is not a machine. According to Gödel, a successful proof that the mind is not a machine would require a solution to the intensional paradoxes. We provide what might seem to be a partial vindication of Gödel and show that (...) if a particular solution to the intensional paradoxes is adopted, one can indeed give an argument to the effect that the mind is not a machine. (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)