I LOGIC IN PHILOSOPHY— PHILOSOPHY OF LOGIC i. On the relation of logic to philosophy I n this book, the consequences of certain logical insights for ...

Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic. However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modified proof theory which more closely models relevant logics. In addition, we use this proof theory to show decidability for a large range of substructural logics.

Since the first chapter of this book presents an intro duction to the present state of game-theoretical semantics (GTS), there is no point in giving a briefer survey here. Instead, it may be helpful to indicate what this volume attempts to do. The first chapter gives a short intro duction to GTS and a survey of what is has accomplished. Chapter 2 puts the enterprise of GTS into new philo sophical perspective by relating its basic ideas to Kant's phi losophy (...) of mathematics, space, and time. Chapters 3-6 are samples of GTS's accomplishments in understanding different kinds of semantical phenomena, mostly in natural languages. Beyond presenting results, some of these chapters also have other aims. Chapter 3 relates GTS to an interesting line of logical and foundational studies - the so-called functional interpretations - while chapter 4 leads to certain important methodological theses. Chapter 7 marks an application of GTS in a more philo sophical direction by criticizing the Frege-Russell thesis that words like "is" are multiply ambiguous. This leads in turn to a criticism of recent logical languages (logical notation), which since Frege have been based on the ambi guity thesis, and also to certain methodological sug gestions. In chapter 8, GTS is shown to have important implications for our understanding of Aristotle's doctrine of categories, while chapter 9 continues my earlier criticism of Chomsky's generative approach to linguistic theorizing. (shrink)

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem''s modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap''s display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to (...) be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules. (shrink)

In this paper functional completeness results are obtained for certain positive and constructive propositional logics associated with a Tarski-type structured consequence relation as defined by Gabbay.

The framework of natural deduction is extended by permitting rules as assumptions which may be discharged in the course of a derivation. this leads to the concept of rules of higher levels and to a general schema for introduction and elimination rules for arbitrary n-ary sentential operators. with respect to this schema, (functional) completeness "or", "if..then" and absurdity is proved.

This paper is a revised version of a talk given at the Logic and Logical Philosophy conference in Poland in September 1995. In it, I sketch the connections between Nuel Belnap's Display Logic and J. Michael Dunn's Gaggle Theory.

It is shown that every displayable propositional logic enjoys strong cut-elimination. This result strengthens Belnap's general cut-elimination theorem for Display Logic.