Penrose proved that a computational or formalizable theory of the brainís cognitive functioning is impossible, but suggested that a physical non-computational and non-formalizable one may be viable. Arguments as to why Penroseís program is unrealizable are presented. The main argument is that a non-formalizable theory should be verbal. However, verbal paradoxes based on Cantorís diagonal processes show the impossibility of a consistent verbal theory of the brain comprising its arithmetical cognition. It is suggested that comprehensive theories of the human brain (...) and of physical experience are Kantian rather than Platonic ideas. This suggestion is likewise based on arguments related to diagonal processes. (shrink)

This accessible book gives a new, detailed and elementary explanation of the Gödel incompleteness theorems and presents the Chaitin results and their relation to the da Costa-Doria results, which are given in full, but with no ...

In “Minds, Machines, and Gödel”, J. R. Lucas claims that Goedel's incompleteness theorem constitutes a proof “that Mechanism is false, that is, that minds cannot be explained as machines”. He claims further that “if the proof of the falsity of mechanism is valid, it is of the greatest consequence for the whole of philosophy”. It seems to me that both of these claims are exaggerated. It is true that no minds can be explained as machines. But it is not (...) true that Goedel's theorem proves this. At most, Goedel's theorem proves that not all minds can be explained as machines. Since this is so, Goedel's theorem cannot be expected to throw much light on why minds are different from machines. Lucas overestimates the importance of Goedel's theorem for the topic of mechanism, I believe, because he presumes falsely that being unable to follow any but mechanical procedures in mathematics makes something a machine. (shrink)

The Jewish religious tradition summons its adherents to save life. For religious Jews preservation of life is the ultimate religious commandment. At the same time Jewish law recognizes that the agony of a moribund person may not be stretched. When the time to die has come this has to be respected. The process of dying should not needlessly be prolonged. We discuss the position of two prominent Orthodox Jewish authorities – the late Rabbi Moshe Feinstein and Rabbi J David Bleich (...) – towards the role of life-sustaining treatment in end-of-life care. From the review, the characteristic halachic and heterogeneous character of Jewish ethical reasoning appears. The specificity of Jewish dealing with ethical dilemmas in health care indicates the importance for contemporary healthcare professionals of providing care which is sensitive to a patient’s culture and worldview. (shrink)

Gödel's Theorem is often used in arguments against machine intelligence, suggesting humans are not bound by the rules of any formal system. However, Gödelian arguments can be used to support AI, provided we extend our notion of computation to include devices incorporating random number generators. A complete description scheme can be given for integer functions, by which nonalgorithmic functions are shown to be partly random. Not being restricted to algorithms can be accounted for by the availability of an (...) arbitrary random function. Humans, then, might not be rule-bound, but Gödelian arguments also suggest how the relevant sort of nonalgorithmicity may be trivially made available to machines. (shrink)

A layman's guide to the mechanics of Gödel's proof together with a lucid discussion of the issues which it raises. Includes an essay discussing the significance of Gödel's work in the light of Wittgenstein's criticisms.

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

Halin in 1965 proved that if a graph has [Formula: see text] many pairwise disjoint rays for each [Formula: see text] then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. The statement of Halin’s theorem and the construction proving it seem very much like standard versions of compactness arguments such as König’s Lemma. Those results, while not computable, are relatively simple. They only (...) use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. We show that several Halin-type theorems are much more complicated. They are among the theorems of hyperarithmetic analysis. Such theorems imply the ability to iterate the Turing jump along any computable well ordering. Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. Friedman, Steel and others in the 1960s and 1970s. Until now, only one purely mathematical example was known. Our work provides many more and so answers Question 30 of Montalbán’s Open Questions in Reverse Mathematics in 2011. Some of these theorems including ones in Halin in 1965 are also shown to have unusual proof theoretic strength as well. (shrink)

This book discusses how rational choice theory grew out of RAND's work for the US Air Force. It concentrates on the work of William J. Riker, Kenneth J. Arrow, James M. Buchanan, Russel Hardin, and John Rawls. It argues that within the context of the US Cold War with its intensive anti-communist and anti-collectivist sentiment, the foundations of capitalist democracy were grounded in the hyper individualist theory of non-cooperative games.

"The Emperor's New Mind" by Roger Penrose has received a great deal of both praise and criticism. This review discusses philosophical aspects of the book that form an attack on the "strong" AI thesis. Eight different versions of this thesis are distinguished, and sources of ambiguity diagnosed, including different requirements for relationships between program and behaviour. Excessively strong versions attacked by Penrose (and Searle) are not worth defending or attacking, whereas weaker versions remain problematic. Penrose (like Searle) regards the notion (...) of an algorithm as central to AI, whereas it is argued here that for the purpose of explaining mental capabilities the architecture of an intelligent system is more important than the concept of an algorithm, using the premise that what makes something intelligent is not what it does but how it does it. What needs to be explained is also unclear: Penrose thinks we all know what consciousness is and claims that the ability to judge Go "del's formula to be true depends on it. He also suggests that quantum phenomena underly consciousness. This is rebutted by arguing that our existing concept of "consciousness" is too vague and muddled to be of use in science. This and related concepts will gradually be replaced by a more powerful theory-based taxonomy of types of mental states and processes. The central argument offered by Penrose against the strong AI thesis depends on a tempting but unjustified interpretation of Goedel's incompleteness theorem. Some critics are shown to have missed the point of his argument. A stronger criticism is mounted, and the relevance of mathematical Platonism analysed. Architectural requirements for intelligence are discussed and differences between serial and parallel implementations analysed. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces-so-called "topological semantics". The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

In 1931 the mathematical logician Kurt Godel published a revolutionary paper that challenged certain basic assumptions underpinning mathematics and logic. A colleague of Albert Einstein, his theorem proved that mathematics was partly based on propositions not provable within the mathematical system and had radical implications that have echoed throughout many fields. A gripping combination of science and accessibility, Godel’s Proof by Nagel and Newman is for both mathematicians and the idly curious, offering those with a taste for logic and (...) philosophy the chance to satisfy their intellectual curiosity. (shrink)

Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in graphs. They (...) seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

In 1929 Carnap gave a paper in Prague on Investigations in General Axiomatics; a briefsummary was published soon after. Its subject lookssomething like early model theory, and the mainresult, called the Gabelbarkeitssatz, appears toclaim that a consistent set of axioms is complete justif it is categorical. This of course casts doubt onthe entire project. Though there is no furthermention of this theorem in Carnap''s publishedwritings, his Nachlass includes a largetypescript on the subject, Investigations inGeneral Axiomatics. We examine this work (...) here,showing that it provides important insights intoCarnap''s development during this critical period, thetransition from Aufbau to Syntax,especially regarding the nature and motivation ofCarnap''s logicism. Moreover, we show how theAxiomatics influenced Carnap''s student Gödel inreaching the fundamental logical results that soonafterwards undermined Carnap''s project. (shrink)

Arrow’s axiomatic foundation of social choice theory can be understood as an application of Tarski’s methodology of the deductive sciences—which is closely related to the latter’s foundational contribution to model theory. In this note we show in a model-theoretic framework how Arrow’s use of von Neumann and Morgenstern’s concept of winning coalitions allows to exploit the algebraic structures involved in preference aggregation; this approach entails an alternative indirect ultrafilter proof for Arrow’s dictatorship result. This link also connects Arrow’s seminal result (...) to key developments and concepts in the history of model theory, notably ultraproducts and preservation results. (shrink)

This book provides an invaluable overview of the reach of logic. It provides reference to some of the most important, well-established results in logic, while at the same time offering insight into the latest research issues in the area. It also has a balance of theory and practice, containing essays in the areas of modal logic, intuitionistic logic, logic and language, nonmonotonic logic and logic programming, temporal logic, logic and learning, combination of logics, practical reasoning, logic and artificial intelligence, abduction, (...) theorem proving and goal-directed reasoning. It will be invaluable reading for researchers and graduate students in logic and computer science, and a fabulous source of inspiration for research students in search of a topic for a PhD in logic and theoretical computer science. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

We prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: There exists a nonzero noncuppable ∑20 enumeration degree. Theorem B: Every nonzero Δ20enumeration degree is cuppable to 0′e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low Δ20 enumeration degree with the anticupping property.

Cauchy's sum theorem is a prototype of what is today a basic result on the convergence of a series of functions in undergraduate analysis. We seek to interpret Cauchy’s proof, and discuss the related epistemological questions involved in comparing distinct interpretive paradigms. Cauchy’s proof is often interpreted in the modern framework of a Weierstrassian paradigm. We analyze Cauchy’s proof closely and show that it finds closer proxies in a different modern framework.

Northern Ireland physicist John Stewart Bell's possible understanding of quantum theory.

This short book has two main purposes. The first is to explain Kurt Gödel's first and second incompleteness theorems in informal terms accessible to a layperson, or at least a non-logician. The author claims that, to follow this part of the book, a reader need only be familiar with the mathematics taught in secondary school. I am not sure if this is sufficient. A grasp of the incompleteness theorems, even at the level of ‘the big picture’, might require some (...) experience with the rigor of mathematical proof. Moreover, since the incompleteness theorems concern formal deductive systems, it would help for a potential reader of this book to have some familiarity with at least elementary logic.There are, of course, a number of informal expositions of the incompleteness theorems. I do not see the need to engage in a comparative study. The second, and more important, goal of the present book is to discuss some alleged consequences of the incompleteness theorems and, in particular, to debunk thoroughly claims in philosophy, religion, and literary criticism that are supposed to be established, or at least bolstered, by incompleteness. The execution of this part of the book is masterly. The arguments are clear and compelling.The book has eight chapters, each between eight and twenty-eight pages. The opening chapter gives a very brief account of the incompleteness theorems and a sketch of Gödel's life and work. Chapter 2 gives the main overview of the incompleteness theorems, plus …. (shrink)

There are three distinct questions associated with Simpson's paradox, (i) Why or in what sense is Simpson's paradox a paradox? (ii) What is the proper analysis of the paradox? (iii) How one should proceed when confronted with a typical case of the paradox? We propose a "formar" answer to the first two questions which, among other things, includes deductive proofs for important theorems regarding Simpson's paradox. Our account contrasts sharply with Pearl's causal (and questionable) account of the first two questions. (...) We argue that the "how to proceed question?" does not have a unique response, and that it depends on the context of the problem. We evaluate an objection to our account by comparing ours with Blyth's account of the paradox. Our research on the paradox suggests that the "how to proceed question" needs to be divorced from what makes Simpson's paradox "paradoxical.". (shrink)

There are three distinct questions associated with Simpson’s paradox. Why or in what sense is Simpson’s paradox a paradox? What is the proper analysis of the paradox? How one should proceed when confronted with a typical case of the paradox? We propose a “formal” answer to the first two questions which, among other things, includes deductive proofs for important theorems regarding Simpson’s paradox. Our account contrasts sharply with Pearl’s causal account of the first two questions. We argue that the “how (...) to proceed question?” does not have a unique response, and that it depends on the context of the problem. We evaluate an objection to our account by comparing ours with Blyth’s account of the paradox. Our research on the paradox suggests that the “how to proceed question” needs to be divorced from what makes Simpson’s paradox “paradoxical.”. (shrink)

The main theorem of this paper is: If ƒ is a partial function from ℵ 1 to ℵ 1 which is ∑ 1 1 -bounded, then there is a weakly finite primitive recursive dilator D such that for all infinite αϵdom , ƒ ⩽ D . The proof involves only elementary combinatorial constructions of trees. A generalization to ptykes is also given.

George Boolos was one of the most prominent and influential logician-philosophers of recent times. This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; on Frege, Dedekind, Cantor, and Russell; and on miscellaneous topics in logic and proof theory, including three papers on various aspects of the Gödel theorems. Boolos is universally recognized as the leader in the renewed interest in studies of Frege's work on logic and (...) the philosophy of mathematics. John Burgess has provided introductions to each of the three parts of the volume, and also an afterword on Boolos's technical work in provability logic, which is beyond the scope of this volume. (shrink)

A set S of degrees is said to be an initial segment if c ≤ d ∈ S→-c∈S. Shoenfield has shown that if P is the lattice of all subsets of a finite set then there is an initial segment of degrees isomorphic to P. Rosenstein [2] (independently) proved the same to hold of the lattice of all finite subsets of a countable set. We shall show that “countable set” may be replaced by “set of cardinality at most that of (...) the continuum.” This result is also an extension of [3, Corollary 2 to Theorem 15], which states that there is a sublattice of degrees isomorphic to the lattice of all finite subsets of 2N. (A sublattice of degrees is a subset closed under ∪ and ∩; an initial segment closed under ∪ is necessarily a sublattice, but not conversely.)It seems worth noting that the proof of the present result was preceded in time by our proof [4] of the analogous theorem for hyperdegrees, and is in fact an adaptation of that proof. Thus the present work has been influenced much more directly by the Gandy-Sacks forcing construction of a minimal hyperdegree [1] than by previous work on initial segments of degrees. (shrink)

In this paper we review some properties of fuzzy observables, mainly as realized by commutative positive operator valued measures. In this context we discuss two representation theorems for commutative positive operator valued measures in terms of projection valued measures and describe, in some detail, the general notion of fuzzification. We also make some related observations on joint measurements.

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)

Abstract.A keystone of the theory of noncommutative noetherian rings is the theorem that establishes a necessary and sufficient condition for a given ring to have a quotient ring. We trace the development of this theorem, and its applications, from its first version for noncommutative domains in the 1930s to Goldie’s theorems in the late 1950s.

In a fluent, clear, and lively style this translation by two of Maslov's junior colleagues brings the work of the late Soviet scientist S. Yu. Maslov to a wider audience. Maslov was considered by his peers to be a man of genius who was making fundamental contributions in the fields of automatic theorem proving and computational logic. He published little, and those few papers were regarded as notoriously difficult. This book, however, was written for a broad audience of readers (...) and describes elegant examples of applications in such fields as computer science, artificial intelligence, operations research, economic modeling, and biological modeling, among others. The book also brings to light the work by the American mathematician E. L. Post, which inspired Maslov's own work in the development of a general theory and which has been long neglected by mathematicial logicians and systems theorists in the United States. The book's first chapter introduces the Rules of the Game. Part I, Mathematics of Calculi, covers E. L. Post's canonical systems, deductive systems and algorithms, and probabilistic calculi and deductive information. Part II, Horizonal Modeling, takes up a "toy" economy, the calculi of technological possibilities, and the development of rules. Part III, Vertical Modeling, deals with the topics of "to fight and to search" and the consequences of the asymmetry of cognitive mechanisms. Vladimir Lifschitz is affiliated with the Department of Computer Science at Stanford University, and Michael Gelfond with the Department of Electrical Engineering and Computer Science at the University of Texas, El Paso. Theory of Deductive Systems and Its Applicationsis included in the Foundation of Computing Series, edited by Michael Garey. (shrink)

By indirect-deduction theorems introduced in the present paper we mean the theorems that allow to formalize indirect reasonings occurring in deductive practice in general and in mathematics in particular. We discuss the relationship between the introduced theorems and some logical calculi being virtually confined to propositional calculi with implication and negation. It is worth to notice that the above theorems are very handy and effective in proving logical theses.

Charles Chihara's new book develops and defends a structural view of the nature of mathematics, and uses it to explain a number of striking features of mathematics that have puzzled philosophers for centuries. The view is used to show that, in order to understand how mathematical systems are applied in science and everyday life, it is not necessary to assume that its theorems either presuppose mathematical objects or are even true. Chihara builds upon his previous work, in which he presented (...) a new system of mathematics, the constructibility theory, which did not make reference to, or presuppose, mathematical objects. Now he develops the project further by analysing mathematical systems currently used by scientists to show how such systems are compatible with this nominalistic outlook. He advances several new ways of undermining the heavily discussed indispensability argument for the existence of mathematical objects made famous by Willard Quine and Hilary Putnam. And Chihara presents a rationale for the nominalistic outlook that is quite different from those generally put forward, which he maintains have led to serious misunderstandings.A Structural Account of Mathematics will be required reading for anyone working in this field. (shrink)