Abstract
Logical frameworks such as the Edinburgh LF or Isabelle are not suitable for general metatheory, since they do not allow induction. On the other hand it is hard to encode a logic in an inductive definition-style framework so that it is usable for object theory. We propose a solution to this problem that borrows techniques from the type-theory tradition of logical frameworks for use with a language of inductive definitions, providing us with a notation suitable for practical object and metatheory both.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Avron. Simple consequence relations. Information and Computation, 92:105–139, 1991.
A. Avron. Axiomatic systems, deduction and implication. J. Logic Computat., 2:51–98, 1992.
A. Avron, F. Honsell, I. Mason, and R. Pollack. Using typed lambda calculus to implement formal systems on a machine. J. Automated Reasoning, 9:309–352, 1992.
D. Basin and S. Matthews. Structuring metatheory on inductive definitions. In M. A. McRobbie and J. K. Slaney, editors, Proc. CADE-13. Springer, Berlin, 1996.
S. Feferman. Finitary inductive systems. In Logic Colloquium '88. North-Holland, Amsterdam, 1990.
J.-Y. Girard. Proof Theory and Logical Complexity, vol. 1. Bibliopolis, Naples, 1987.
R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. J. ACM, 40:143–184, 1993.
S. Matthews. Implementing FS0 in Isabelle: adding structure at the metalevel. In J. Calmet and C. Limongelli, editors, Proc. Disco'96. Springer, Berlin, 1996.
R. McDowell and D. Miller. A logic for reasoning with higher-order abstract syntax. In Proc. 12th IEEE Ann. Symp. Logic Comp. Sci. IEEE Computer Society Press, 1997.
R. P. Nederpelt, J. H. Geuvers, and R. C. de Vrijer, editors. Selected papers on Automath. Elsevier, Amsterdam, 1994.
L. C. Paulson. The foundation of a generic theorem prover. J. Automated Reasoning, 5:363–397, 1989.
L. C. Paulson. Isabelle: A generic theorem prover. Springer, Berlin, 1994.
F. Pfenning. Elf: A language for logic definition and verified meta-programming. In Proc. 4th IEEE Ann. Symp. Logic Comp. Sci. IEEE Computer Society Press, 1989.
E. Rohwedder. Verifying the meta-theory of deductive systems. thesis proposal, CMU, 1994.
C. Talcott. A theory of binding structures, and applications to rewriting. Theoret. Comput. Sci., 112:99–143, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matthews, S. (1997). A practical implementation of simple consequence relations using inductive definitions. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_31
Download citation
DOI: https://doi.org/10.1007/3-540-63104-6_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63104-0
Online ISBN: 978-3-540-69140-2
eBook Packages: Springer Book Archive