Conditional sentences are among the most intriguing and puzzling features of language, and analysis of their meaning and function has important implications for, and uses in, many areas of philosophy. Jonathan Bennett, one of the world's leading experts, distils many years' work and teaching into this Philosophical Guide to Conditionals, the fullest and most authoritative treatment of the subject. An ideal introduction for undergraduates with a philosophical grounding, it also offers a rich source of illumination and stimulation for graduate students (...) and professional philosophers. (shrink)

Reasoning about situations we take to be impossible is useful for a variety of theoretical purposes. Furthermore, using a device of impossible worlds when reasoning about the impossible is useful in the same sorts of ways that the device of possible worlds is useful when reasoning about the possible. This paper discusses some of the uses of impossible worlds and argues that commitment to them can and should be had without great metaphysical or logical cost. The paper then provides an (...) account of reasoning with impossible worlds, by treating such reasoning as reasoning employing counterpossible conditionals, and provides a semantics for the proposed treatment. (shrink)

Aboutness has been studied from any number of angles. Brentano made it the defining feature of the mental. Phenomenologists try to pin down the aboutness-features of particular mental states. Materialists sometimes claim to have grounded aboutness in natural regularities. Attempts have even been made, in library science and information theory, to operationalize the notion. But it has played no real role in philosophical semantics. This is surprising; sentences have aboutness-properties if anything does. Aboutness is the first book to examine through (...) a philosophical lens the role of subject matter in meaning. A long-standing tradition sees meaning as truth-conditions, to be specified by listing the scenarios in which a sentence is true. Nothing is said about the principle of selection--about what in a scenario gets it onto the list. Subject matter is the missing link here. A sentence is true because of how matters stand where its subject matter is concerned. Stephen Yablo maintains that this is not just a feature of subject matter, but its essence. One indicates what a sentence is about by mapping out logical space according to its changing ways of being true or false. The notion of content that results--directed content--is brought to bear on a range of philosophical topics, including ontology, verisimilitude, knowledge, loose talk, assertive content, and philosophical methodology. Written by one of today's leading philosophers, Aboutness represents a major advance in semantics and the philosophy of language. (shrink)

A supertask consists in the performance of an infinite number of actions in a finite time. I show that any attempt to carry out a supertask will produce a divergence of the curvature of spacetime, resulting in the formation of a black hole. I maintain that supertaks, contrarily to a popular view among philosophers, are physically impossible. Supertasks, literally, collapse under their own weight.

Traditionally, many writers, following Kleene (1952), thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing’s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis, what Turing (1936) calls “argument I,” has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, essentially presupposed by Turing (...) himself in what he calls “argument II.” The idea is that computation is a special form of mathematical deduction. Assuming the steps of the deduction can be stated in a first order language, the Church-Turing thesis follows as a special case of Gödel’s completeness theorem (first order algorithm theorem). I propose this idea as an alternative foundation for the Church-Turing thesis, both for human and machine computation. Clearly the relevant assumptions are justified for computations presently known. Other issues, such as the significance of Gödel’s 1931 Theorem IX for the Entscheidungsproblem, are discussed along the way. (shrink)

Under the banner of "hypercomputat ion" various claims are being made for the feasibility of modes of computation that go beyond what is permitted by Turing computability. In this article it will be shown that such claims fly in the face of the inability of all currently accepted physical theories to deal with infinite precision real numbers. When the claims are viewed critically, it is seen that they amount to little more than the obvious comment that if non-computable inputs are (...) permitted, then non-computable outputs are attainable. (shrink)

Written by a distinguished cast of contributors, Alan Turing: Life and Legacy of a Great Thinker is the definitive collection of essays in commemoration of the 90th birthday of Alan Turing. This fascinating text covers the rich facets of his life, thoughts, and legacy, but also sheds some light on the future of computing science with a chapter contributed by visionary Ray Kurzweil, winner of the 1999 National Medal of Technology. Further, important contributions come from the philosopher Daniel Dennett, the (...) Turing biographer Andrew Hodges, and from the distinguished logician Martin Davis, who provides a first critical essay on an emerging and controversial field termed "hypercomputation". (shrink)

Focusing on spacetime singularities, Earman engages with a host of foundational issues at the intersection of science and philosophy, ranging from the big bang to the possibility of time travel.

Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved - independently of Löwenheim and Skolem's earlier work - the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also presented important programmatic remarks on (...) the significance of the decision problem and of decision procedures more generally. The text of this talk as well as a partial English translation are included. (shrink)

The paper clarifies and defends the orthodox view that counterfactual conditionals with impossible antecedents are vacuously true against recent criticisms. It argues that apparent counterexamples to orthodoxy result from uncritical reliance on a fallible heuristic used in the processing of conditionals. A comparison is developed between such counterpossibles and vacuously true universal generalizations.

In this paper I will argue that Professor Goodman was correct in thinking that there is a problem concerning counterfactual conditionals, but that it is somewhat different from the problem he thought it to be, and is one that is even more basic. I will also try to show that this problem is distinct from Hume's "problem" of induction, and that additional assumptions have to be made for counterfactual induction beyond those required for other kinds of induction.

Robert Stalnaker is an actualist who holds that merely possible worlds are uninstantiated properties that might have been instantiated. Stalnaker also holds that there are no metaphysically impossible worlds: uninstantiated properties that couldn't have been instantiated. These views motivate Stalnaker's "two dimensional" account of the necessary a posteriori on which there is no single proposition that is both necessary and a posteriori. For a necessary proposition is true in all possible worlds. If there were necessary a posteriori propositions, that would (...) mean that there were propositions true in all possible worlds but which could only be known to be true by acquiring empirical evidence. Consider such a purported proposition P. The role of empirical evidence for establishing P's truth would have to be to rule out worlds in which P is false. If there were no such worlds to be ruled out, we would not require evidence for P. But by hypothesis, P is necessary and so true in all metaphysically possible worlds. And on Stalnaker's view, the metaphysically possible worlds are all the worlds there are. So there can be no proposition that is true in all possible worlds, but that we require evidence to know. In this way, the motivation for Stalnaker's two dimensional account of the necessary a posteriori rests on his denying that there are metaphysically impossible Worlds. I argue that given his view of what possible worlds are, Stalnaker has no principled reason for denying that there are metaphysically impossible worlds. If I am right, this undercuts Stalnaker's motivation for his two dimensional account of the necessary a posteriori. (shrink)

We begin with the history of the discovery of computability in the 1930’s, the roles of Gödel, Church, and Turing, and the formalisms of recursive functions and Turing automatic machines . To whom did Gödel credit the definition of a computable function? We present Turing’s notion [1939, §4] of an oracle machine and Post’s development of it in [1944, §11], [1948], and finally Kleene-Post [1954] into its present form. A number of topics arose from Turing functionals including continuous functionals on (...) Cantor space and online computations. Almost all the results in theoretical computability use relative reducibility and o-machines rather than a-machines and most computing processes in the real world are potentially online or interactive. Therefore, we argue that Turing o-machines, relative computability, and online computing are the most important concepts in the subject, more so than Turing a-machines and standard computable functions since they are special cases of the former and are presented first only for pedagogical clarity to beginning students. At the end in §10–§13 we consider three displacements in computability theory, and the historical reasons they occurred. Several brief conclusions are drawn in §14. (shrink)

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)

Natural language conditionals seem to be subject to three logical requirements: they invalidate Antecedent Strengthening, they validate so-called Simplification of Disjunctive Antecedents, and they allow for the replacement of logically equivalent clauses in antecedent position. Unfortunately, these requirements are jointly inconsistent. Conservative solutions to the puzzle drop Simplification, treating it as a pragmatic inference. I show that pragmatic accounts of Simplification fail, and develop a truthmaker semantics for conditionals that captures all the relevant data. Differently from existing truthmaker semantics, my (...) semantics extends, rather than replaces, standard possible worlds semantics. The main innovation is the notion of a truthmaker in play: this notion is cognitive, rather than metaphysical, and can be defined in a purely syntactic way. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

Church's thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing's work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church's thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing's work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we must correlate these syntactic (...) entities with numbers. I argue that, in providing this correlation, we must demand that the correlation itself be computable. Otherwise, the Turing machine will compute uncomputable functions. But if we presuppose the intuitive notion of a computable relation between syntactic entities and numbers, then our analysis of computability is circular. (shrink)

Reidel, 1976. This book is out of print, but can be downloaded as a pdf file (3.3 MB).

Church's Thesis (CT) was first published by Alonzo Church in 1935. CT is a proposition that identifies two notions: an intuitive notion of an effectively computable function defined in natural numbers with the notion of a recursive function. Despite the many efforts of prominent scientists, Church's Thesis has never been disproven. There exists a vast literature concerning the thesis. The aim of this book is to provide a one volume summary of the state of research on Church's Thesis. These include (...) the following: different formulations of CT, CT and intuitionism, CT and intensional mathematics, CT and physics, the epistemic status of CT, CT and philosophy of mind, provability of CT and CT and functional programming. Adam Olszewski, is assistant professor of the philosophy of mathematics and mathematical logic at the Department of Philosophy of Pontifical Academy of Theology, Cracow (Poland). Jan Wolenski is professor of philosophy, Institute of Philosphy, Jagiellonian University, Cracow (Poland). He is one of the most distinguished logicians in Poland. Robert Janusz is assistant professor in the Department of Philosophy of Ignatius College, Cracow (Poland). (shrink)

It is well known that reductio ad absurdum arguments raise a number of interesting philosophical questions. What does it mean to assert something with the precise goal of then showing it to be false, i.e. because it leads to absurd conclusions? What kind of absurdity do we obtain? Moreover, in the mathematics education literature number of studies have shown that students find it difficult to truly comprehend the idea of reductio proofs, which indicates the cognitive complexity of these constructions. In (...) this paper, I start by discussing four philosophical issues pertaining to reductio arguments. I then briefly present a dialogical conceptualization of deductive arguments, according to which such arguments are best understood as a dialogue between two participants—Prover and Skeptic. Finally, I argue that many of the philosophical and cognitive difficulties surrounding reductio arguments are dispelled or at least further clarified once one adopts a dialogical perspective. (shrink)

Recently, von Fintel (2001) and Gillies (2007) have argued that certain sequences of counterfactuals, namely reverse Sobel sequences, should motivate us to abandon standard truth conditional theories of counterfactuals for dynamic semantic theories. I argue that we can give a pragmatic account of our judgments about counterfactuals without giving up the standard semantics. In particular, I introduce a pragmatic principle governing assertability, and I use this principle to explain a variety of subtle data concerning reverse Sobel sequences.