Download:
|
by Jeremy E. Dawson, Rajeev Gore
ENTCS
ftp://arp.anu.edu.au/pub/papers/gore/Embedding-Display-Calculi/embed.ps
Add To MetaCart
Abstract:
Abstract. We compare several methods of implementing the display (sequent) calculus ffiRA for relation algebra in the logical frameworks Isabelle and Twelf. We aim for an implementation enabling us to formalise within the logical framework proof-theoretic results such as the cut-elimination theorem for ffiRA and any associated increase in proof length. We discuss issues arising from this requirement.
Citations
|
604
|
A formulation of the simple theory of types
– Church
- 1940
|
|
530
|
A framework for defining logics
– Harper, Honsell, et al.
- 1993
|
|
491
|
The Definition of Standard ML (Revised
– Milner, Tofte, et al.
- 1997
|
|
266
|
1984] Intuitionistic Type Theory
– Martin-Löf
|
|
186
|
C.: System description: Twelf - a meta-logical framework for deductive systems,Proceedings of the 16th International Conference on Automated Deduction (CADE-16
– Pfenning, Schurmann
- 1999
|
|
126
|
1986], Logic for Computer Science: Foundations of Automatic Theorem Proving
– Gallier
|
|
77
|
Display logic
– Belnap
- 1982
|
|
49
|
Experience with Embedding Hardware Description Languages
– Boulton, Gordon, et al.
- 1992
|
|
44
|
Structural cut elimination
– Pfenning
- 1994
|
|
31
|
Substructural logics on display
– Goré
- 1998
|
|
29
|
Elmasri and Shamkant B. Navathe. Fundamentals of Database Systems. Addison-Wesley, fourth edition
– Ramez
- 2003
|
|
27
|
Prolog: The Standard
– Deransart, Ed-Dbali, et al.
- 1996
|
|
21
|
Introductory course on relation algebras, finitedimensional cylindric algebras, and their interconnections
– Maddux
- 1991
|
|
20
|
Cut-free display calculi for relation algebras
– Gore
- 1997
|
|
17
|
A mechanised proof system for relation algebra using display logic
– Dawson, Goré
- 1998
|
|
15
|
The Isabelle Reference
– Paulson
- 1995
|
|
12
|
Power and weakness of the modal display calculus
– Kracht
- 1996
|
|
10
|
Displaying Modal Logic, volume 3 of Trends in Logic
– Wansing
- 1998
|
|
9
|
A relational approach to the design of deterministic programs
– Mili
- 1983
|
|
4
|
C Gordon and T F Melham. Introduction to HOL: a Theorem Proving Environment for Higher Order Logic
– J
- 1993
|
|
4
|
Proving isomorphism of first-order proof systems
– Mikhajlova, Wright
- 1998
|
|
2
|
A Elmasri and S B Navathe. Fundamentals of Database Systems
– unknown authors
- 1994
|
|
2
|
Mikhajlova and Joakim von Wright. Proving isomorphism of first-order proof systems in HOL
– Anna
- 1998
|
|
1
|
Structural cut elimination
– Pfennig
- 1995
|
