Structural Frameworks with Higher-Level Rules

Read and Neil Tennant for helpful comments and discussions on topics related to this work. Drafts of Chapters 5 and 6 were written during a research stay at the Department of Logic and Metaphysics of the University of St. Andrews in Spring 1985. I am grateful to the Fritz Thyssen Stiftung for supporting this stay with a travel grant. I should like to thank my colleagues, especially Gereon Wolters, for contributing to a congenial and stimulating atmosphere at the Department of Philosophy here in Konstanz. In particular, I wish to express my appreciation to Jürgen Mittelstraß for continuously supporting me in my work and giving me the opportunity to pursue the research interests that resulted in this study. Finally, a note of thanks to Ron Feemster and especially to Raoul Eshelman for revising the English manuscript. Added 2003: I am very grateful to Thomas Piecha for converting the original file into L A T E X. He carried out this tedious task with extreme diligence. Concerning the content of this work I should mention that the logical system of positive relevance logic arrived at in Chapter 5 is not R, as claimed on p. 48, but the system RM of relevance logic with the mingle rule.

[1]  D. Prawitz.  Natural Deduction: A Proof-Theoretical Study , 1965 .

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Dag Prawitz,et al.  Dummett on a Theory of Meaning and Its Impact on Logic , 1987 .

[4]  Nuel Belnap,et al.  Display logic , 1982, J. Philos. Log..

[5]  Franz Kutschera.  Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle , 1969 .

[6]  G. Gentzen.  Die Widerspruchsfreiheit der reinen Zahlentheorie , 1936 .

[7]  Per Martin-Löf,et al.  Constructive mathematics and computer programming , 1984 .

[8]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[9]  Dale Miller,et al.  A Theory of Modules for Logic Programming , 1986, SLP.

[10]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[11]  D. Prawitz.  Proofs and the Meaning and Completeness of the Logical Constants , 1979 .

[12]  Lars Hallnäs.  Generalized horn clauses , 1986 .

[13]  M. Beeson.  Foundations of Constructive Mathematics: Metamathematical Studies , 1985 .

[14]  D. J. Shoesmith,et al.  Multiple-Conclusion Logic , 1978 .

[15]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[16]  Kosta Dosen,et al.  Uniqueness, definability and interpolation , 1988, Journal of Symbolic Logic.

[17]  Peter Schroeder-Heister,et al.  The completeness of intuitionistic logic with respect to a validity concept based on an inversion principle , 1983, J. Philos. Log..

[18]  P. Martin-Löf.  An Intuitionistic Theory of Types: Predicative Part , 1975 .

[19]  Kosta Dosen,et al.  Sequent-systems for modal logic , 1985, Journal of Symbolic Logic.

[21]  Kosta Dosen,et al.  Sequent-systems and groupoid models. I , 1988, Stud Logica.

[22]  Dag Prawitz,et al.  On the idea of a general proof theory , 1974, Synthese.

[23]  N. Tennant.  Anti-Realism and Logic: Truth as Eternal , 1987 .

[24]  P. Lorenzen.  Einführung in die operative Logik und Mathematik , 1955 .

[25]  Peter Schroeder-Heister,et al.  Generalized rules for quantifiers and the completeness of the intuitionistic operators &, ν, ⊃, λ, ∀, ε , 1984 .

[26]  K. Dosen.  Logical constants : an essay in proof theory , 1980 .

[27]  Peter Schroeder-Heister.  Proof-theoretic Validity and the Completeness of Intuitionistic Logic , 1985 .

[28]  Dag Prawitz,et al.  Philosophical aspects of proof theory , 1981 .

[29]  Franz Kutschera,et al.  Die Vollständigkeit des Operatorensystems {¬, ∨, ⊃} für die Intuitionistische Aussagenlogik im Rahmen der Gentzensematik , 1968 .

[30]  Richard Routley,et al.  Relevant Logics and Their Rivals: Part 1. The Basic Philosophical and Semantical Theory , 1988 .

[31]  Kosta Dosen,et al.  Logical Constants as Punctuation Marks , 1989, Notre Dame J. Formal Log..

[32]  Lars Hallnäs,et al.  A proof-theoretic approach to logic programming, I. Generalized horn clauses , 1988 .

[33]  H. Hornich.  Die gegenwärtige Lage in der mathematischen Grundlagenforschung. — Neue Fassung des Widerspruchsfreiheitsbeweises für die reine Zahlentheorie , 1939 .

[34]  M. Dummett.  The Philosophical Basis of Intuitionistic Logic , 1975 .

[35]  Dag Prawitz,et al.  Towards A Foundation of A General Proof Theory , 1973 .

[36]  P. Aczel.  Frege Structures and the Notions of Proposition, Truth and Set* , 1980 .

[37]  W. V. Quine,et al.  Natural deduction , 2021, An Introduction to Proof Theory.

[38]  Dov M. Gabbay,et al.  N-Prolog: An Extension of Prolog with Hypothetical Implications I , 1984, J. Log. Program..

[39]  W. A. Pogorzelski,et al.  Review: J. H. Woodger, Alfred Tarski, Logic, semantics, metamathematics, papers from 1923 to 1938 , 1969 .

[40]  Jeffery I. Zucker,et al.  The adequacy problem for inferential logic , 1978, J. Philos. Log..

[41]  Nuel D. Belnap,et al.  Entailment : the logic of relevance and necessity , 1975 .

[42]  Jan M. Smith,et al.  An interpretation of Martin-Löf's type theory in a type-free theory of propositions , 1984, Journal of Symbolic Logic.

[43]  Richmond H. Thomason,et al.  Symbolic logic : an introduction , 1969 .

[44]  Richard Routley,et al.  Relevant logics and their rivals , 1982 .

[45]  Peter Schroeder-Heister,et al.  A natural extension of natural deduction , 1984, Journal of Symbolic Logic.

[46]  David Hilbert.  Die logischen Grundlagen der Mathematik , 1922 .