70 search results - page 10 / 14 » A Hierarchical Completeness Proof for Propositional Temporal... |
IGPL
2002
13 years 8 months ago
2002
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
IGPL
2010
13 years 5 months ago
2010
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
CADE
2004
Springer
14 years 9 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
CONCUR
2000
Springer
14 years 6 days ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
CADE
2004
Springer
14 years 2 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...