Completeness theorem for logic with imprecise and conditional probabilities.
Ognjanović, Zoran, Marković, Zoran, Rašković, Miodrag (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Ognjanović, Zoran, Marković, Zoran, Rašković, Miodrag (2005)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Angelina Ilić-Stepić (2010)
Publications de l'Institut Mathématique
Similarity:
Dragan Doder, Bojan Marinković, Petar Maksimović, Aleksandar Perović (2010)
Publications de l'Institut Mathématique
Similarity:
Vladimir Ristić (2009)
Kragujevac Journal of Mathematics
Similarity:
Vladimir Ristić (2010)
Kragujevac Journal of Mathematics
Similarity:
Celani, Sergio (2001)
Divulgaciones Matemáticas
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...
Miloš Milošević (2010)
Publications de l'Institut Mathématique
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.
A. Simon (1993)
Banach Center Publications
Similarity:
de Paiva, Valeria, Ritter, Eike (2006)
Theory and Applications of Categories [electronic only]
Similarity: