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)

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness.

Structural proof theory is a branch of logic that studies the general structure and properties of logical and mathematical proofs. This book is both a concise introduction to the central results and methods of structural proof theory, and a work of research that will be of interest to specialists. The book is designed to be used by students of philosophy, mathematics and computer science. The book contains a wealth of results on proof-theoretical systems, including extensions of such systems from logic (...) to mathematics, and on the connection between the two main forms of structural proof theory - natural deduction and sequent calculus. The authors emphasize the computational content of logical results. A special feature of the volume is a computerized system for developing proofs interactively, downloadable from the web and regularly updated. (shrink)

How does metaphysical grounding interact with the truth-functions? I argue that the answer varies according to whether one has a worldly conception or a conceptual conception of grounding. I then put forward a logic of worldly grounding and give it an adequate semantic characterisation.

I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relationship between language and the world.

Say that two sentences are factually equivalent when they describe the same facts or situations, understood as worldly items, i.e. as bits of reality rather than as representations of reality. The notion of factual equivalence is certainly of central interest to philosophical semantics, but it plays a role in a much wider range of philosophical areas. What is the logic of factual equivalence? This paper attempts to give a partial answer to this question, by providing an answer the following, more (...) specific question: Given a standard propositional language with negation, conjunction and disjunction as primitive operators, which sentences of the language should be taken to be factually equivalent by virtue of their logical form? The system for factual equivalence advocated in this paper is a proper fragment of the first-degree system for the logic of analytic equivalence put forward in the late seventies by R. B. Angell. I provide the system with two semantics, both formulated in terms of the notion of a situation’s being fittingly described by a linguistic item. In the final part of the paper I argue, contra a view I defended in my “Grounding and Truth-Functions”, that the logic for factual equivalence I advocate here should be preferred to Angell’s logic if one wishes to follow the general conception of the relationships between factual equivalence and the notion of grounding put forward in the 2010 paper. (shrink)

In this article, we consider variations of Nuel Belnap’s ‘artificial reasoner’. In particular, we examine cases in which the artificial reasoner is faulty, e.g. situations in which the reasoner is unable to calculate the value of a formula due to an inability to retrieve the values of its atoms. In the first half of the article, we consider two ways of modelling such circumstances and prove the deductive systems arising from these two types of models to be equivalent to Graham (...) Priest’s first-degree entailment with an ‘emptiness’ value and Richard Angell’s analytic containment, making computational interpretations of these systems possible. The Belnap-type semantics for AC bring FDE φ and AC in line with other containment logics in their neighborhood. The second half of the article examines formal questions, such as whether AC admits an analysis along the lines of that given to the related system of William Parry’s system of analytic implication, as suggested by Kurt Gödel and confirmed by Kit Fine. Furthermore, a natural means of extending these systems to languages with an intensional implication connective is investigated. (shrink)

The aim of this paper is technically to study Belnap's four-valued sentential logic . First, we obtain a Gentzen-style axiomatization of this logic that contains no structural rules while all they are still admissible in the Gentzen system what is proved with using some algebraic tools. Further, the mentioned logic is proved to be the least closure operator on the set of {Λ, V, ⌝}-formulas satisfying Tarski's conditions for classical conjunction and disjunction together with De Morgan's laws for negation. It (...) is also proved that Belnap's logic is the only sentential logic satisfying the above-mentioned conditions together with Anderson-Belnap's Variable-Sharing Property. Finally, we obtain a finite Hilbert-style axiomatization of this logic. As a consequence, we obtain a finite Hilbert-style axiomatization of Priest's logic of paradox. (shrink)

In 1977, R. B. Angell presented a logic for analytic containment, a notion of relevant implication stronger than Anderson and Belnap's entailment. In this paper I provide for the first time the logic of first degree analytic containment, as presented in [2] and [3], with a semantical characterization—leaving higher degree systems for future investigations. The semantical framework I introduce for this purpose involves a special sort of truth-predicates, which apply to pairs of collections of formulas instead of individual formulas, and (...) which behave in some respects like Gentzen's sequents. This semantics captures very general properties of the truth-functional connectives, and for that reason it may be used to model a vast range of logics. I briefly illustrate the point with classical consequence and Anderson and Belnap's tautological entailments. (shrink)

It is shown that certain natural constraints trivialize the concept of partial content and it is suggested, in the light of this difficulty, that the principle that partial content is preserved under the substitution of logical equivalents should be given up.

We explore in an experimental spirit the prospects for extending classical propositional logic with a new operator P intended to be interpreted when prefixed to a formula as saying that formula in question is at least partly true. The paradigm case of something which is, in the sense envisaged, false though still "partly" true is a conjunction one of whose conjuncts is false while the other is true. Ideally, we should like such a logic to extend classical logic - or (...) any fragment thereof under consideration - conservatively, to be closed under uniform substitution (of arbitrary formulas for sentence letters or propositional variables), and to allow the substitutivity of provably equivalent formulas salva provabilitate. To varying degrees, we experience some difficulties only with this last ('congruentiality') desideratum in the two four-valued logics we end up giving our most extended consideration to. (shrink)

The concept of entailment is often connected with deducibility: A is said to entail B iff B is logically deducible from A.1 It has also been connected to the concept of containment in Kant’s sense of analytic containment: A entails B only if the meaning of B is contained in the meaning of A. But the concepts of deducibility and containment are two distinct concepts, and the failure to distinguish them leads to faulty attempts to merge them in formal systems. (...) One such attempt is Anderson and Belnap’s system, E, in which a Fitch-type theory of natural deduction is modified to incorporate a certain sense of “containment”2. Another is Parry’s system, AI, of “analytic implication” which began with a more restricted sense of containment but has usually been presented as a theory of deducibility. (shrink)