On Lamport's comparison between linear and branching time temporal logic
Susanne Graf (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Susanne Graf (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Colin McLarty (1989)
Diagrammes
Similarity:
G. Rousseau (1970)
Fundamenta Mathematicae
Similarity:
Reiner Hähnle, Gonzalo Escalada-Imaz (1997)
Mathware and Soft Computing
Similarity:
Vincent Degauquier (2018)
Bulletin of the Section of Logic
Similarity:
The temporal logic KtT4 is the modal logic obtained from the minimal temporal logic Kt by requiring the accessibility relation to be reflexive (which corresponds to the axiom T) and transitive (which corresponds to the axiom 4). This article aims, firstly, at providing both a model-theoretic and a proof-theoretic characterisation of a four-valued extension of the temporal logic KtT4 and, secondly, at identifying some of the most useful properties of this extension in the context of partial...
M.-A. Nait Abdallah (1988)
Banach Center Publications
Similarity:
James J. Lu, Jacques Calmet, Joachim Schü (1997)
Mathware and Soft Computing
Similarity:
The logic of signed formula can be used to reason about a wide variety of multiple-valued logics [Häh94b, LMR97]. The formal theoretical foundation of multiple-valued logic programming based on signed formulas is set forth in [Lu96]. The current paper is an investigation into the operational semantics of such signed logic programming. The connection of signed logic programming to constraint logic programming is presented, search space issues are briefly discussed for both general and...
Gemma Robles, Sandra M. López, José M. Blanco, Marcos M. Recio, Jesús R. Paradela (2016)
Bulletin of the Section of Logic
Similarity:
The logic BN4 can be considered as the 4-valued logic of the relevant conditional and the logic E4, as the 4-valued logic of (relevant) entailment. The aim of this paper is to endow E4 with a 2-set-up Routley-Meyer semantics. It is proved that E4 is strongly sound and complete w.r.t. this semantics.
Krister Segerberg (1982)
Banach Center Publications
Similarity:
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: