Binding Logic: proofs and models
Autor: | Dowek, Gilles, Hardin, Thérèse, Kirchner, Claude |
---|---|
Rok vydání: | 2023 |
Předmět: | |
Zdroj: | 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR'2002, Oct 2002, Tbilisi, Georgia. pp.130-144 |
Druh dokumentu: | Working Paper |
Popis: | We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness theorem there. Comment: Colloque avec actes et comit{\'e} de lecture. internationale |
Databáze: | arXiv |
Externí odkaz: |