An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Categorical combinators, sequential algorithms, and functional programming (2nd ed.)
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Higher order unification via explicit substitutions
Information and Computation
X.R.S: Explicit Reduction Systems - A First-Order Calculus for Higher-Order Calculi
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Abstract Syntax and Variable Binding
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Journal of Automated Reasoning
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Permissive-nominal logic: First-order logic over nominal terms and sets
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.