According to Paul Boghossian and others, inference is subject to the taking condition: it necessarily involves the thinker taking his premises to support his conclusion, and drawing the conclusion because of that fact. Boghossian argues that this condition vindicates the idea that inference is an expression of agency, and that it has several other important implications too. However, we argue in this paper that the taking condition should be rejected. The condition gives rise to several serious prima facie problems and (...) the reasons which have been offered in favour of it fail to convince. (shrink)

Breaking new ground in the debate about the relation of mind and body, David Armstrong's classic text - first published in 1968 - remains the most compelling and comprehensive statement of the view that the mind is material or physical. In the preface to this new edition, the author reflects on the book's impact and considers it in the light of subsequent developments. He also provides a bibliography of all the key writings to have appeared in the materialist debate.

Volume II of Classical Recursion Theory describes the universe from a local (bottom-up or synthetical) point of view, and covers the whole spectrum, from the recursive to the arithmetical sets. The first half of the book provides a detailed picture of the computable sets from the perspective of Theoretical Computer Science. Besides giving a detailed description of the theories of abstract Complexity Theory and of Inductive Inference, it contributes a uniform picture of the most basic complexity classes, ranging from small (...) time and space bounds to the elementary functions, with a particular attention to polynomial time and space computability. It also deals with primitive recursive functions and larger classes, which are of interest to the proof theorist. The second half of the book starts with the classical theory of recursively enumerable sets and degrees, which constitutes the core of Recursion or Computability Theory. Unlike other texts, usually confined to the Turing degrees, the book covers a variety of other strong reducibilities, studying both their individual structures and their mutual relationships. The last chapters extend the theory to limit sets and arithmetical sets. The volume ends with the first textbook treatment of the enumeration degrees, which admit a number of applications from algebra to the Lambda Calculus. The book is a valuable source of information for anyone interested in Complexity and Computability Theory. The student will appreciate the detailed but informal account of a wide variety of basic topics, while the specialist will find a wealth of material sketched in exercises and asides. A massive bibliography of more than a thousand titles completes the treatment on the historical side. (shrink)

I argue that the accounts of inference recently presented (in this journal) by Paul Boghossian, John Broome, and Crispin Wright are unsatisfactory. I proceed in two steps: First, in Sects. 1 and 2, I argue that we should not accept what Boghossian calls the “Taking Condition on inference” as a condition of adequacy for accounts of inference. I present a different condition of adequacy and argue that it is superior to the one offered by Boghossian. More precisely, I point out (...) that there is an analog of Moore’s Paradox for inference; and I suggest that explaining this phenomenon is a condition of adequacy for accounts of inference. Boghossian’s Taking Condition derives its plausibility from the fact that it apparently explains the analog of Moore’s Paradox. Second, in Sect. 3, I show that neither Boghossian’s, nor Broome’s, nor Wright’s account of inference meets my condition of adequacy. I distinguish two kinds of mistake one is likely to make if one does not focus on my condition of adequacy; and I argue that all three—Boghossian, Broome, and Wright—make at least one of these mistakes. (shrink)

In some previous work, I tried to give a concept-based account of the nature of our entitlement to certain very basic inferences (see the papers in Part III of Boghossian 2008b). In this previous work, I took it for granted, along with many other philosophers, that we understood well enough what it is for a person to infer. In this paper, I turn to thinking about the nature of inference itself. This topic is of great interest in its own right (...) and surprisingly understudied by philosophers. A correct understanding of inference promises to shed light on a number of important topics. In particular, it threatens to undermine the sort of concept-based story about entitlement to which I had previously been attracted. (shrink)

The minimalist view of truth endorsed by Paul Horwich denies that truth has any underlying nature. According to minimalism, the truth predicate ‘exists solely for the sake of a certain logical need’; ‘the function of the truth predicate is to enable the explicit formulation of schematic generalizations’. Horwich proposes that all there really is to truth follows from the equivalence schema: The proposition that p is true iff p, or, using Horwich’s notation, ·pÒ is true ´ p. The (unproblematic) instances (...) of the schema form ‘the minimal theory of truth’. Horwich claims that all the facts involving truth can be explained on the basis of the minimal theory. However, it has been pointed out, e.g. by Gupta (1993), that the minimal theory is too weak to entail any general facts about truth, e.g. the fact that.. (shrink)

This bestselling dictionary is written by one of the leading philosophers of our time, and it is widely recognized as the best dictionary of its kind. Comprehensive and authoritative, it covers every aspect of philosophy from Aristotle to Zen. With clear and concise definitions, it provides lively and accessible coverage of not only Western philosophical traditions, but also themes from Chinese, Indian, Islamic, and Jewish philosophy. New entries on philosophy of economics, social theory, neuroscience, philosophy of the mind, and moral (...) conceptions, bring this authoritative third edition up to date. It is the ideal introduction to philosophy for anyone with an interest in the subject, and it is an indispensable work of reference for students and teachers. (shrink)

Mathematical realism is the doctrine that mathematical objects really exist, that mathematical statements are either determinately true or determinately false, and that the accepted mathematical axioms are predominantly true. A realist understanding of set theory has it that when the sentences of the language of set theory are understood in their standard meaning, each sentence has a determinate truth value, so that there is a fact of the matter whether the cardinality of the continuum is א2 or whether there are (...) measurable cardinals, whether or not those facts are knowable by us. (shrink)

In this lucid portrayal of human behavior, Fred Dretske provides an original account of the way reasons function in the causal explanation of behavior.

In this study two strands of inferentialism are brought together: the philosophical doctrine of Brandom, according to which meanings are generally inferential roles, and the logical doctrine prioritizing proof-theory over model theory and approaching meaning in logical, especially proof-theoretical terms.

What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...) argues that our conventions, in the form of syntactic rules of language use, are perfectly suited to explain the truth, necessity, and a priority of logical and mathematical claims, as well as our logical and mathematical knowledge. (shrink)

I argue that to have an attitude is, primarily, (1.) to have a dispositional profile that matches, to an appropriate degree and in appropriate respects, a stereotype for that attitude, typically grounded in folk psychology, and secondarily, (2.) in some cases also to meet further stereotypical attitude-specific conditions. To have an attitude, on the account I will recommend here, is mainly a matter of being apt to interact with the world in patterns that ordinary people would regard as characteristic of (...) having that attitude. I contrast this view with alternative views that treat having an attitude as a matter of possessing some particular internally stored representational content or some other "deep" structural feature. (shrink)

According to McHugh and Way reasoning is a person-level attitude revision that is regulated by its constitutive aim of getting fitting attitudes. They claim that this account offers an explanation of what is wrong with reasoning in ways one believes to be bad and that this explanation is an alternative to an explanation that appeals to the so-called Taking Condition. I argue that their explanation is unsatisfying.

Here I defend dispositionalism about meaning and rule-following from Kripkenstein's infamous anti-dispositionalist arguments. The problems of finitude, error, and normativity are all addressed. The general lesson I draw is that Kripkenstein's arguments trade on an overly simplistic version of dispositionalism.

This is a response to Paul Boghossian’s paper: What is inference?. The paper and the abstract originate from a symposium at the Pacific Division Meeting of the APA in San Diego in April 2011. John Broome was a co-commentator.

ABSTRACTThis paper provides a naturalistic account of inference. We posit that the core of inference is constituted by bare inferential transitions, transitions between discursive mental representations guided by rules built into the architecture of cognitive systems. In further developing the concept of BITs, we provide an account of what Boghossian [2014] calls ‘taking’—that is, the appreciation of the rule that guides an inferential transition. We argue that BITs are sufficient for implicit taking, and then, to analyse explicit taking, we posit (...) rich inferential transitions, which are transitions that the subject is disposed to endorse. (shrink)

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixteenth publication in the Lecture Notes in Logic series, gives a sustained presentation of a particular view of the topic of Gödelian extensions of theories. It presents the basic material in predicate logic, set theory and recursion (...) theory, leading to a proof of Gödel's incompleteness theorems. The inexhaustibility of mathematics is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman. All concepts and results are introduced as needed, making the presentation self-contained and thorough. Philosophers, mathematicians and others will find the book helpful in acquiring a basic grasp of the philosophical and logical results and issues. (shrink)

The standard theory of computation excludes computations whose completion requires an infinite number of steps. Malament-Hogarth spacetimes admit observers whose pasts contain entire future-directed, timelike half-curves of infinite proper length. We investigate the physical properties of these spacetimes and ask whether they and other spacetimes allow the observer to know the outcome of a computation with infinitely many steps.

Many philosophers believe that a deflationist theory of truth must conservatively extend any base theory to which it is added. But when applied to arithmetic, it's argued, the imposition of a conservativeness requirement leads to a serious objection to deflationism: for the Gödel sentence for Peano Arithmetic is not a theorem of PA, but becomes one when PA is extended by adding plausible principles governing truth. This paper argues that no such objection succeeds. The issue turns on how we understand (...) the notion of logical consequence implicit in any conservativeness requirement, and whether we possess a categorical conception of the natural numbers. I offer a disjunctive response: if we possess a categorical conception of arithmetic, then deflationists have principled reason to accept a rich notion of logical consequence according to which the Gödel sentence follows from PA. But if we do not, then the reasons for requiring the derivation of the Gödel sentence lapse, and deflationists are free to accept a conservativeness requirement stated proof-theoretically. Either way, deflationism is in the clear. (shrink)

This chapter contrasts Alfred Tarski's compositional conception (whereby the truth-values of sentences are explained in terms of the referential characteristics of their component words) unfavorably with minimalism (which relies merely on the schema, ‘(p) is true ↔ p’). First, it argues against Tarski that his approach is: (i) misdirected, insofar as it doesn't elucidate our actual concept of truth, which applies to propositions rather than sentences; (ii) ill-motivated, insofar as it reflects an insistence on explicit definitions; (iii) not generally workable, (...) insofar as those definitions cannot devised for all the multifarious constructions that occur in natural languages; and (iv) pointless, insofar as it addresses no question worth answering. Second, it is shown that minimalism can be the basis for a superior treatment of the liar paradoxes. And, finally, a response is developed to the claim (Tarski, Gupta, Soames, Halbach) that Tarski-style compositional definitions are needed in order to accommodate generalizations about truth (e.g., that all instances of ‘p→p’ are true). (shrink)

Deflationsism about truth is a pot-pourri, variously claiming that truth is redundant, or is constituted by the totality of 'T-sentences', or is a purely logical device (required solely for disquotational purposes or for re-expressing finitarily infinite conjunctions and/or disjunctions). In 1980, Hartry Field proposed what might be called a 'deflationary theory of mathematics', in which it is alleged that all uses of mathematics within science are dispensable. Field's criterion for the dispensability of mathematics turns on a property of theories, called (...) conservativeness. I present some technical results, some of which may be found in Tarski (1936), concerning the logical properties of truth theories; in particular, concerning the conservativeness of adding a truth theory for an object level language to any theory expressed in it. It transpires that various deflationary truth theories behave somewhat differently from the standard Tarskian truth theory. These results suggest that Tarskian theories of truth are not redundant or dispensable. Finally, I hint at an analogy between the behaviour of mathematical theories and of standard (Tarskian) theories of truth with respect to their indispensability to, as Quine would put, our 'scientific world-view'. (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)

Within a year of each other, three one-volume general dictionaries of philosophy have recently appeared; when our future colleagues in philosophy look back on the 1990s they may well think of it as the decade of reference works. But however productive these years may prove to be in this genre, clearly visible somewhere around the top of the heap will be this handy, useful, entertaining, and instructive contribution from Simon Blackburn. Its two immediate competitors are the Cambridge Dictionary of Philosophy, (...) edited by Robert Audi, and the Oxford Companion to Philosophy, edited by Ted Honderich. No detailed comparison will be attempted here, but two points stand out as obviously giving Blackburn’s dictionary a rather different use and flavor from the others: while containing a closely comparable number of entries, it is distinctly shorter and handier in format; and it has all been written by a single author. (shrink)

The philosophical literature on reasoning is dominated by the assumption that reasoning is essentially a matter of following rules. This paper challenges this view, by arguing that it misrepresents the nature of reasoning as a personal level activity. Reasoning must reflect the reasoner’s take on her evidence. The rule-following model seems ill-suited to accommodate this fact. Accordingly, this paper suggests replacing the rule-following model with a different, semantic approach to reasoning.

Inferences are familiar movements of thought, but despite important recent work on the topic, we do not yet have a fully satisfying theory of inference. Here I provide a functionalist theory of inference. I argue that the functionalist framework allows us the flexibility to meet various demands on a theory of inference that have been proposed (such as that it must explain inferential Moorean phenomena and epistemological ‘taking’). While also allowing us to compare, contrast, adapt, and combine features of extant (...) theories of inference into one unified theory. In fleshing out the inference role, I also criticize the common assumption that inference requires rule-following. (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

Published with the aid of a grant from the National Endowment for the Humanities. Contains the only complete English-language text of The Concept of Truth in Formalized Languages. Tarski made extensive corrections and revisions of the original translations for this edition, along with new historical remarks. It includes a new preface and a new analytical index for use by philosophers and linguists as well as by historians of mathematics and philosophy.

At the turn of the century, there appeared two comprehensive mathematical systems, which were indeed so vast that it was taken for granted that all mathematics could be decided on the basis of them. However, in 1931, Kurt Gödel surprised the entire mathematical world with his epoch‐making paper which begins with the following startling words: The development of mathematics in the direction of greater precision has led to large areas of it being formalized, so that proofs can be carried out (...) according to a few mechanical rules. The most comprehensive formal systems to date are, on the one hand, the Principia Mathematica of Whitehead and Russell, and, on the other hand the Zermelo‐Fraenkel system of axiomatic set theory. Both systems are so extensive that all methods of proof used in mathematics today can be formalized in them‐i.e., can be reduced to a few axioms and rules of inference. It would seem reasonable, therefore, to surmise that these axioms and rules of inference are sufficient to decide all mathematical questions which can be formulated in the system concerned. In what follows it will be shown that this is not the case, but rather that, in both of the cited systems, there exist relatively simple problems of the theory of ordinary whole numbers which cannot be decided on the basis of the axioms. (shrink)

First published in 2002. Routledge is an imprint of Taylor & Francis, an informa company.