A Logic with Conditional Probability Operators
Dragan Doder, Bojan Marinković, Petar Maksimović, Aleksandar Perović (2010)
Publications de l'Institut Mathématique
Similarity:
Dragan Doder, Bojan Marinković, Petar Maksimović, Aleksandar Perović (2010)
Publications de l'Institut Mathématique
Similarity:
Zoran Ognjanović, Miodrag Rašković, Zoran Marković (2009)
Zbornik Radova
Similarity:
Ognjanović, Zoran, Marković, Zoran, Rašković, Miodrag (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Vladimir Ristić (2010)
Kragujevac Journal of Mathematics
Similarity:
Mariusz Giero (2012)
Formalized Mathematics
Similarity:
This is a preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [12]. We introduce n-ary connectives and prove their properties. We derive temporal logic formulas.
Vladimir Ristić (2009)
Kragujevac Journal of Mathematics
Similarity:
A. Simon (1993)
Banach Center Publications
Similarity:
de Paiva, Valeria, Ritter, Eike (2006)
Theory and Applications of Categories [electronic only]
Similarity:
Mariusz Giero (2012)
Formalized Mathematics
Similarity:
This is a second preliminary article to prove the completeness theorem of an extension of basic propositional temporal logic. We base it on the proof of completeness for basic propositional temporal logic given in [17]. We introduce two modified definitions of a subformula. In the former one we treat until-formula as indivisible. In the latter one, we extend the set of subformulas of until-formulas by a special disjunctive formula. This is needed to construct a temporal model. We also...
Vladimir Ristić (2009)
Kragujevac Journal of Mathematics
Similarity:
Szabolcs Mikulás (1993)
Banach Center Publications
Similarity:
In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.
Jan Jaspars (1993)
Banach Center Publications
Similarity:
A "partial" generalization of Fine's definition [Fin] of normal forms in normal minimal modal logic is given. This means quick access to complete axiomatizations and decidability proofs for partial modal logic [Thi].
Tatjana Stojanović, Ana Kaplarević-Mališić, Zoran Ognjanović (2010)
Kragujevac Journal of Mathematics
Similarity: