We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...) historical and conceptual analysis of computability and recursion we make several recommendations in section §7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions; the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory.". (shrink)

Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

In this paper, we sketch the development of two important themes of modern set theory, both of which can be regarded as growing out of work of Kurt Gödel. We begin with a review of some basic concepts and conventions of set theory.§0. The ordinal numbers were Georg Cantor's deepest contribution to mathematics. After the natural numbers 0, 1, …, n, … comes the first infinite ordinal number ω, followed by ω + 1, ω + 2, …, ω + ω, (...) … and so forth. ω is the first limit ordinal as it is neither 0 nor a successor ordinal. We follow the von Neumann convention, according to which each ordinal number α is identified with the set {ν ∣ ν α} of its predecessors. The ∈ relation on ordinals thus coincides with <. We have 0 = ∅ and α + 1 = α ∪ {α}. According to the usual set-theoretic conventions, ω is identified with the first infinite cardinal ℵ0, similarly for the first uncountable ordinal number ω1 and the first uncountable cardinal number ℵ1, etc. We thus arrive at the following picture:The von Neumann hierarchy divides the class V of all sets into a hierarchy of sets Vα indexed by the ordinal numbers. The recursive definition reads: ;Vλ = ∪v<λVv for limit ordinals λ. We can represent this hierarchy by the following picture. (shrink)

) Modern theories of formal truth have traditionally been used to analyse semantic paradoxes, but their field of application goes well beyond this field to include ontological issues, Godel′s incompleteness phenomena, and the relationship between object language, meta language and reduction. All these fields have had new light sched upon them by studies on the theories of truth. In providing a first summary of the various approaches in this field the author documents their respective advantages and areas of application. The (...) emphasis here is on the axiomatic theories of truth developed by Cantini, Feferman, Friedman and the autor himself, which over the past ten years have increasingly gained ground over the semantic theories of Kripke et al. The book describes the way in which many of the aciomatic proposals are built up and expand on semantic theories. This ist the first time that the results in this field have been made accessible to readers in their larger context. The book deals in detail with the technical aspects and so is ideal as a point of entry into the vast array of literature on the metamathematics of this field. A key objective of the book is to extablish a connection between the latest theories of truth and the older constructions elaborated by Tarski. He made a number of important findings about the formal properties of truth back in the 1930s, but some of his constructions are now considered to be obsolete. Tarski′s views appear in a new light in this book since some of his ideas have only been formulated in recent years. (shrink)

Naturalism in Mathematics investigates how the most fundamental assumptions of mathematics can be justified. One prevalent philosophical approach to the problem--realism--is examined and rejected in favor of another approach--naturalism. Penelope Maddy defines this naturalism, explains the motivation for it, and shows how it can be successfully applied in set theory. Her clear, original treatment of this fundamental issue is informed by current work in both philosophy and mathematics, and will be accessible and enlightening to readers from both disciplines.

Wilfred Sieg. Mechanical Procedures and Mathematical Experience.

Russell’s way out of his paradox via the impre-dicative theory of types has roughly the same logical power as Zermelo set theory - which supplanted it as a far more flexible and workable axiomatic foundation for mathematics. We discuss some new formalisms that are conceptually close to Russell, yet simpler, and have the same logical power as higher set theory - as represented by the far more powerful Zermelo-Frankel set theory and beyond. END.

Is the continuum hypothesis still open? If we interpret it as finding the laws of cardinal arithmetic, it was thought to be essentially solved by the independence results of Godel and Cohen with some isolated positive results. It was expected that only more independence results remained to be proved. The author has come to change his view. This enables us to get new results for the conventional cardinal arithmetic, thus supporting the interest in our view. We also find other applications, (...) extend older methods of using normal fiters and prove the existence of Jonsson algebra. (shrink)