





Peter SchroederHeisterProoftheoretic semanticsAdvanced Course, ESSLLI, Bordeaux, 2731 July 2009This page as pdf — Contents — Summary — Materials Contents0. Preliminaries
I. E rules as syntactical functions of I rules
II. Prooftheoretic validity
III. Local inversion and reflection
IV. Assertion and denial
V. Generalized definitional reflection and the sequent calculus
SummaryProofTheoretic Semantics (PTS) is an alternative to modeltheoretic (or truthcondition) semantics. It is based on the idea that the central notion in terms of which meanings are assigned to expressions is "proof" rather than "truth". In this sense PTS is inferential rather than denotational in spirit. Although the claim that meaning is use has been quite prominent in philosophy for more than half a century, the modeltheoretic approach has always dominated formal semantics. This is, as I see it, due to the fact that for denotational semantics very sophisticated formal theories are available, going back to Tarski's definition of truth, whereas "meaning is use" has often been just a slogan without much formal underpinning. However, within general proof theory several formal approaches to PTS have been developed which promise to provide a "real" alternative to the modeltheoretic approach. They are all based on ideas of Gentzenstyle prooftheory, which are then turned into logicophilosophical principles. After recalling certain basics from the theory of natural deduction, this course presents in its first part the idea of generalized introduction and elimination rules for logical or nonlogical (atomic) constants, discusses adequacy criteria for such rules and investigates, as a case study, the example of negative circularity as it occurs with the paradoxes. In its second part it develops and discusses the DummettPrawitz approach to PTS and their definition of prooftheoretic validity. It discusses various options of how to define the validity of proofs and relates them to corresponding notions of logical consequence. It puts particular emphasis on the "universal" aspects of these ideas, dealing with general proof structures and arbitrary proof reduction systems as models with respect to which validity is defined. The third part is devoted to definitional and clausal approaches to PTS as developed by the instructor himself jointly with Lars Hallnäs (Gothenburg) using the principle of "definitional reflection". This approach puts the validity of rules and inference steps (rather than that of whole proofs) first. As compared to the DummettPrawitz approach, it is local rather than global and does not require that global properties of proofs such as normalization or cut elimination hold in every possible case. This approach is is not restricted to logical constants but uses clausal definitions as the basis of reasoning, which means that it goes far beyond logic in the narrower sense. Interesting applications are theories of equality, circular reasoning, universal theories of denial and negation, and extensions of logic programming. The fourth part deals with the treatment of denial and negation in the general framework developed. After making precise in which sense duality principles, which are wellknown from classical logic, also hold in the constructive realm, it pleads for a "direct" treatment of negation in terms of rules for the denial of sentences, where the denial operator only occurs in outermost position (and thus cannot be iterated). This leads to a framework of clausal definitions for assertion and denial, formally related to extended logic programming. Principles of definitional reflection and definitional closure with respect to such definitions are discussed. Overall, this approach is intended as an alternative to the "indirect" approach to negation prevailing in the intuitionistic tradition. The approach favoured is "bidirectional" in that assertions and assumptions are treated on par. Technically, this implies a shift from natural deduction to the sequent calculus as the basic model of reasoning, or at least to some bidirectional variant of natural deduction. Therefore, in the final fifth part, the idea of definitional reflection is used to deal with the symmetry features of the sequent calculus, in which the duality between assertions and assumptions is much more explicit than in natural deduction. Various approaches are discussed and related to existing theories. Particular emphasis is given to substructural issues. A tutorial comprising (essentially) parts IIII of the present course was given at the School on Universal Logic, Xi'an (China) in August 2007. Parts IV and V are new. MaterialsGeneral
Part I: E rules as functions of I rules
Part II: Prooftheoretic validity
Part III: Local inversion and reflection
Part IV: Assertion and denial
Part V: Generalized definitional reflection and the sequent calculus
Further materials are available from the (password protected) webpage http://ls.informatik.unituebingen.de/esslli/esslli09/materials.html. The password will be disclosed to those who attend or plan to attend my course. Email: psh@informatik.unituebingen.de. 
