37 search results - page 4 / 8 » Weak Equivalence in Propositional Calculus |
109
Voted
WOLLIC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We introduce a tree-sequent calculus for inquisitive logic (Groenendijk 2008) as a special form of labelled deductive system (Gabbay 1996). In particular, we establish th...
127
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
132
click to vote
FMOODS
2008
15 years 5 months ago
2008
We analyse the relationship between object-oriented modelling and session-based, service-oriented modelling, starting from a typical UML Sequence Diagram and providing a program tr...
111
click to vote
APAL
2004
15 years 3 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
163
click to vote
QEST
2007
IEEE
15 years 10 months ago
2007
IEEE
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...