Abstract
Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that fits intuitionistic logic: Heyting algebras are a more algebraic alternative.
In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm for a natural deduction calculus, in the propositional fragment. Our main contributions is that we prove in a direct way completeness of natural deduction with respect to Heyting algebras, that the underlying algorithm natively deals with disjunction, that we formalized those proofs in Coq, and give an extracted algorithm.
Keywords
- Heyting Algebra
- Kripke Structure
- Natural Deduction Calculus
- Propositional Fragment
- Normalization Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
namely, the programming language in which the evaluation function is written.
References
Altenkirch, T., Dybjer, P., Hofmann, M., Scott, P.: Normalization by evaluation for typed lambda calculus with coproducts. In: 16th Annual IEEE Symposium on Logic in Computer Science, pp. 303–310 (2001)
Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed \(\lambda \)-calculus. In: Vemuri, R. (ed.) Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 203–211. IEEE Computer Society Press, Los Alamitos (1991)
Bonichon, R., Hermant, O.: On constructive cut admissibility in deduction modulo. In: Altenkirch, T., McBride, C. (eds.) TYPES 2006. LNCS, vol. 4502, pp. 33–47. Springer, Heidelberg (2007)
Coquand, C.: From semantics to rules: a machine assisted analysis. In: Meinke, K., Börger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol. 832, pp. 91–105. Springer, Heidelberg (1994)
Danvy, O.: Type-directed partial evaluation. In: Hatcliff, J., Thiemann, P. (eds.) Practice and Theory DIKU 1998. LNCS, vol. 1706, pp. 367–411. Springer, Heidelberg (1999)
Herbelin, H., Lee, G.: Formalizing logical metatheory: semantical cut-elimination using kripke models for first-order predicate logic, 2014. http://formal.hknu.ac.kr/Kripke/, Accessed on 06–11–2014
Hermant, O., Lipton, J.: A constructive semantic approach to cut elimination in type theories with axioms. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 169–183. Springer, Heidelberg (2008)
Ilik, D.: Continuation-passing style models complete for intuitionistic logic. Ann. Pure Appl. Logic 164(6), 651–662 (2012)
Ilik, D., Lee, G., Herbelin, H.: Kripke models for classical logic. Ann. Pure Appl. Logic 161(11), 1367–1378 (2010)
Krivine, J.-L.: Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. Bull. Symbolic Logic 2, 405–421 (1996)
Maehara, S.: Lattice-valued representation of the cut-elimination theorem. Tsukuba J. Math. 15(2), 509–521 (1991)
Okada, M.: An introduction to linear logic: expressiveness and phasesemantics. In: Takahashi, M., Okada, M., Dezani-Ciancaglini, M., (eds.) Theories of Types and Proofs, MSJ Memoirs, vol. 2, pp. 255–295. The Mathematical Society of Japan, Tokyo, Japan (1998)
Okada, M.: Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic. Theoret. Comput. Sci. 227, 333–396 (1999)
Rasiowa, H., Sikorski, R.: The Mathematics of Metamathematics. Polish Scientific Publishers PWN, Warszawa (1963)
Tait, W.W.: A non constructive proof of gentzen’s hauptsatz for second order logic. Bull. AMS 72, 980–983 (1966)
Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics. North-Holland, Amsterdam (1988)
Veldman, W.: An intuitionistic completeness theorem for intuitionistic predicate logic. J. Symbolic Logic 41, 159–166 (1976)
Acknowledgments
The authors would like to thanks the reviewers for their insightful and constructive comments and pointers. Unfortunately we lacked time to include them all.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilbert, G., Hermant, O. (2015). Normalisation by Completeness with Heyting Algebras. In: Davis, M., Fehnker, A., McIver, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2015. Lecture Notes in Computer Science(), vol 9450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48899-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-662-48899-7_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48898-0
Online ISBN: 978-3-662-48899-7
eBook Packages: Computer ScienceComputer Science (R0)