70 search results - page 2 / 14 » A Hierarchical Completeness Proof for Propositional Temporal... |
PLPV
2012
ACM
12 years 13 days ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
TIME
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
IANDC
2006
13 years 4 months ago
2006
A finitary axiomatization for EQPL (exogenous quantum propositional logic) is presented. The axiomatization is shown to be weakly complete relative to an oracle for analytical rea...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...