Computer Science Logic
From MaRDI portal
Publication:5311271
Recommendations
Cited in
(18)- HasCasl: integrated higher-order specification and program development
- Decidability of the restriction equational theory in the partial lambda calculus
- Equational programming in -calculus via SL-systems. Part 1
- On elementary equivalence for equality-free logic
- A finitely axiomatized formalization of predicate calculus with equality
- SCL(EQ): SCL for first-order logic with equality
- The HASCASL prologue: Categorical syntax and semantics of the partial \(\lambda\)-calculus
- EQ-logics with delta connective
- Classifying categories for partial equational logic
- scientific article; zbMATH DE number 2185719 (Why is no real title available?)
- scientific article; zbMATH DE number 5147179 (Why is no real title available?)
- scientific article; zbMATH DE number 4021100 (Why is no real title available?)
- scientific article; zbMATH DE number 3557745 (Why is no real title available?)
- scientific article; zbMATH DE number 1950261 (Why is no real title available?)
- scientific article; zbMATH DE number 814613 (Why is no real title available?)
- Computer Science Logic
- Truth-value semantics and functional extensions for classical logic of partial terms based on equality
- Introduction to Turing categories
This page was built for publication: Computer Science Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311271)