View : 225 Download: 0
Formalizing the meta-theory of first-order predicate logic
- Formalizing the meta-theory of first-order predicate logic
- Herberlin H.; Kim S.; Lee G.
- Ewha Authors
- SCOPUS Author ID
- Issue Date
- Journal Title
- Journal of the Korean Mathematical Society
- Journal of the Korean Mathematical Society vol. 54, no. 5, pp. 1521 - 1536
- Completeness; First-order predicate logic; Formal proofs; Kripke semantics; Soundness
- Korean Mathematical Society
- SCIE; SCOPUS; KCI
- Document Type
Show the fulltext
- This paper introduces a representation style of variable bind-ing using dependent types when formalizing meta-theoretic properties. The style we present is a variation of the Coquand-McKinna-Pollack’s locally-named representation. The main characteristic is the use of de-pendent families in defining expressions such as terms and formulas. In this manner, we can handle many syntactic elements, among which well-formedness, provability, soundness, and completeness are critical, in a compact manner. Another point of our paper is to investigate the roles of free variables and constants. Our idea is that fresh constants can entirely play the role of free variables in formalizing meta-theories of first-order predicate logic. In order to show the feasibility of our idea, we formalized the soundness and completeness of LJT with respect to Kripke semantics using the proof assistant Coq, where LJT is the intuitionistic first-order predicate calculus. The proof assistant Coq supports all the functionalities we need: intentional type theory, dependent types, inductive families, and simultaneous substitution. © 2017 Korean Mathematical Society.
- Appears in Collections:
- 자연과학대학 > 수학전공 > Journal papers
- Files in This Item:
There are no files associated with this item.
- RIS (EndNote)
- XLS (Excel)
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.