3047 search results - page 143 / 610 » On the Meaning of Logical Completeness |
WOLLIC
2009
Springer
15 years 4 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
TABLEAUX
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We give an optimal (exptime), sound and complete tableaubased algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. ...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
PPDP
2001
Springer
15 years 2 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI. CBI differs from exi...