Binding Logic: proofs and models - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2002

Binding Logic: proofs and models

Résumé

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.
Fichier principal
Vignette du fichier
binders.pdf (344.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00101012 , version 1 (24-05-2023)

Identifiants

Citer

Gilles Dowek, Thérèse Hardin, Claude Kirchner. Binding Logic: proofs and models. 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning - LPAR'2002, Oct 2002, Tbilisi, Georgia. pp.130-144. ⟨inria-00101012⟩
155 Consultations
6 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More