37 search results - page 2 / 8 » Weak Equivalence in Propositional Calculus |
FOSSACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
CSL
2002
Springer
13 years 6 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
LFCS
2009
Springer
14 years 24 days ago
2009
Springer
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
JSYML
2000
13 years 6 months ago
2000
The class of weakly algebrizable logics is defined as the class of logics having monotonic and injective Leibniz operator. We show that "monotonicity" cannot be discarde...
FSTTCS
2007
Springer
14 years 13 days ago
2007
Springer
We examine a bidirectional Propositional Dynamic Logic (PDL) for message sequence charts (MSCs) extending LTL and TLC− . Every formula is translated into an equivalent communicat...