925 search results - page 60 / 185 » Connectivity on Complete Lattices |
TABLEAUX
1997
Springer
15 years 4 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
131
click to vote
CORR
2004
Springer
14 years 11 months ago
2004
Springer
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
DM
2000
14 years 11 months ago
2000
We characterize the finite graph algebras which are dualizable. Indeed, a finite graph algebra is dualizable if and only if each connected component of the underlying graph is eith...
WOLLIC
2009
Springer
15 years 6 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...
110
click to vote
SASN
2005
ACM
15 years 5 months ago
2005
ACM
Sensor network has a great potential in applications such as habitat monitoring, wildlife tracking, building surveillance, and military combat. The design of a sensor network syst...