A completeness theorem in the modal logic of programs
Krister Segerberg (1982)
Banach Center Publications
Similarity:
Displaying similar documents to “A closure and complement result for nested topologies”
A completeness theorem in the modal logic of programs
Time conditional propositions
Jan Štěpán (1988)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Assertions depending on time and corresponding logical calculi
Andrzej Grzegorczyk (1968)
Compositio Mathematica
Similarity:
Individualised normative logic
Jan Štěpán (1989)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Reasoning in Basic Description Logics and Description Logics with Modal Operators
Milenko Mosurović, Tatjana Stojanović, Ana Kaplarević-Mališić (2009)
Zbornik Radova
Similarity:
Completeness Theorem for a First Order Linear-time Logic
Zoran Ognjanović (2001)
Publications de l'Institut Mathématique
Similarity:
Information frames, implication systems and modalities.
Marcello D'Agostino, Dov M. Gabbay, Alessandra Russo (1996)
Mathware and Soft Computing
Similarity:
We investigate the logical systems which result from introducing the modalities L and M into the family of substructural implication logics (including relevant, linear and intuitionistic implication). Our results lead to the formulation of a uniform labelled refutation system for these logics.
The First Lecture on Non-classical Logics
Alexandros Pefku (2001)
The Teaching of Mathematics
Similarity: