3239 search results - page 24 / 648 » A Logical Process Calculus |
INFORMATICALT
2008
14 years 10 months ago
2008
A transitive distributed knowledge logic is considered. The considered logic S4nD is obtained from multi-modal logic S4n by adding transitive distributed knowledge operator. For a ...
102
click to vote
SOSL
1993
15 years 2 months ago
1993
In this paper we study automatic veri cation of proofs in process algebra. Formulas of process algebra are represented by types in typed -calculus. Inhabitants (terms) of these ty...
MLQ
2008
14 years 10 months ago
2008
We observe that removing contraction from a standard sequent calculus for first-order predicate logic preserves completeness for the modal fragment.
CADE
2009
Springer
15 years 2 months ago
2009
Springer
98
Voted
IJCAI
2001
14 years 11 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...