Notes on logic and set theory
Basic proof theory
Handbook of logic in computer science
Universes for generic programs and proofs in dependent type theory
Nordic Journal of Computing
First-order logic with dependent types
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.00 |
We propose syntax and semantics for systems of intuitionistic and classical first order dependently sorted logic, with and without equality, retaining type dependency, but otherwise abstracting, from systems for dependent type theory, and which can be seen as generalised systems of multisorted logic. These are presented as extensions to Gentzen systems for first order logic in which the logic is developed relative to a context of variable declarations over a theory of dependent sorts. A generalised notion of Kripke structure provides the semantics for the intuitionistic systems.