70 search results - page 4 / 14 » A Hierarchical Completeness Proof for Propositional Temporal... |
104
click to vote
LFCS
2009
Springer
15 years 6 months 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
2007
14 years 11 months ago
2007
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
CADE
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
112
click to vote
TABLEAUX
1997
Springer
15 years 3 months ago
1997
Springer
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
CSL
2010
Springer
15 years 21 days 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...