446 search results - page 38 / 90 » Automating Theories in Intuitionistic Logic |
CADE
2003
Springer
14 years 8 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
ELP
1991
13 years 11 months ago
1991
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
CADE
2001
Springer
14 years 8 months ago
2001
Springer
We present a tool deciding a fragment of set theory. It is designed to be easily accessible via the internet and intuitively usable by anyone who is working with sets to describe a...
LPAR
2005
Springer
14 years 1 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...