Algebraic Composition and Refinement of Proofs

We present an algebraic calculus for proof composition and refinement. Fundamentally, proofs are expressed at successive levels of abstraction, with the perhaps unconventional principle that a formula is considered to be its own most abstract proof, which may be refined into increasingly concrete proofs. Consequently, we suggest a new paradigm for expressing proofs, which views theorems and proofs as inhabiting the same semantic domain. This algebraic/model-theoretical view of proofs distinguishes our approach from conventional typetheoretical or sequent-based approaches in which theorems and proofs are different entities. All the logical concepts that make up a formal system — formulas, inference rules, and derivations — are expressible in terms of the calculus itself. Proofs are constructed and structured by means of a composition operator and a consequential rule-forming operator. Their interplay and their relation wrt. the refinement order are expressed as algebraic laws.

[1]  J. Dunn.  Partial-Gaggles Applied to Logics with Restricted Structural Rules , 1991 .

[2]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[3]  Matthias Weber,et al.  The Generic Development Language Deva , 1993, Lecture Notes in Computer Science.

[4]  H. Wansing.  Kosta Dosen and Peter Schroeder-Heister (eds.), substructural logics , 1996 .

[5]  K. I. Rosenthal.  Quantales and their applications , 1990 .

[6]  Steven J. Vickers,et al.  Quantales, observational logic and process semantics , 1993, Mathematical Structures in Computer Science.

[7]  Martin Simons.  Proof Presentation for Isabelle , 1997, TPHOLs.

[8]  C. A. R. Hoare,et al.  The Weakest Prespecification , 1987, Information Processing Letters.

[9]  Leslie Lamport,et al.  How to Write a Proof , 1995 .

[10]  Vaughan R. Pratt,et al.  Chu Spaces and Their Interpretation as Concurrent Objects , 1995, Computer Science Today.

[11]  H. Wansing.  Substructural logics , 1996 .

[12]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[13]  Marcelo P Fiore,et al.  Topology via Logic , 1999 .

[14]  R. A. G. Seely,et al.  Weakly distributive categories , 1997 .

[15]  J. Michael Dunn,et al.  Gaggle Theory: An Abstraction of Galois Connections and Residuation with Applications to Negation, Implication, and Various Logical Operations , 1990, JELIA.

[16]  David N. Yetter,et al.  Quantales and (noncommutative) linear logic , 1990, Journal of Symbolic Logic.

[17]  Samson Abramsky.  Interaction categories and communicating sequential processes , 1994 .

[18]  Matthias Weber,et al.  The Generic Development Language Deva: Presentation and Case Studies , 1993 .

[19]  Michel Sintzoff,et al.  Endomorphic Typing , 1993, Formal Program Development.

[20]  藤原 靖.  Lectures on Linear Logic, Anne S. Troelstra, CSLI, 1992 , 1994 .