Search results for 'temporal logic' (try it on Scholar)

1000+ found
Sort by:
See also:
  1. Temporal Logic (forthcoming). Temporal Logic. Stanford Encyclopedia of Philosophy.score: 1740.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Natasha Kurtonina & Maarten de Rijke (1997). Bisimulations for Temporal Logic. Journal of Logic, Language and Information 6 (4):403-425.score: 246.0
    We define bisimulations for temporal logic with Since and Until. This new notion is compared to existing notions of bisimulations, and then used to develop the basic model theory of temporal logic with Since and Until. Our results concern both invariance and definability. We conclude with a brief discussion of the wider applicability of our ideas.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  3. Mark Brown & Valentin Goranko (1999). An Extended Branching-Time Ockhamist Temporal Logic. Journal of Logic, Language and Information 8 (2):143-166.score: 246.0
    For branching-time temporal logic based on an Ockhamist semantics, we explore a temporal language extended with two additional syntactic tools. For reference to the set of all possible futures at a moment of time we use syntactically designated restricted variables called fan-names. For reference to all possible futures alternative to the actual one we use a modification of a difference modality, localized to the set of all possible futures at the actual moment of time.We construct an axiomatic (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  4. Joeri Engelfriet & Jan Treur (2002). Linear, Branching Time and Joint Closure Semantics for Temporal Logic. Journal of Logic, Language and Information 11 (4):389-425.score: 246.0
    Temporal logic can be used to describe processes: their behaviour ischaracterized by a set of temporal models axiomatized by a temporaltheory. Two types of models are most often used for this purpose: linearand branching time models. In this paper a third approach, based onsocalled joint closure models, is studied using models which incorporateall possible behaviour in one model. Relations between this approach andthe other two are studied. In order to define constructions needed torelate branching time models, appropriate (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  5. D. M. Gabbay & G. Malod (2002). Naming Worlds in Modal and Temporal Logic. Journal of Logic, Language and Information 11 (1):29-65.score: 246.0
    In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x, y)which states that two time points are at the same distance from the root. We provide the systems studied with complete axiomatizations and illustrate the expressive power gained for modal logic by simulating other logics. The completeness proofs rely on the fairly intuitive notion of a (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  6. Marta Cialdea Mayer, Carla Limongelli, Andrea Orlandini & Valentina Poggioni (2007). Linear Temporal Logic as an Executable Semantics for Planning Languages. Journal of Logic, Language and Information 16 (1):63-89.score: 246.0
    This paper presents an approach to artificial intelligence planning based on linear temporal logic (LTL). A simple and easy-to-use planning language is described, Planning Domain Description Language with control Knowledge (PDDL-K), which allows one to specify a planning problem together with heuristic information that can be of help for both pruning the search space and finding better quality plans. The semantics of the language is given in terms of a translation into a set of LTL formulae. Planning is (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Heinrich Wansing & Norihiro Kamide (2011). Synchronized Linear-Time Temporal Logic. Studia Logica 99 (1-3):365-388.score: 240.0
    A new combined temporal logic called synchronized linear-time temporal logic (SLTL) is introduced as a Gentzen-type sequent calculus. SLTL can represent the n -Cartesian product of the set of natural numbers. The cut-elimination and completeness theorems for SLTL are proved. Moreover, a display sequent calculus δ SLTL is defined.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  8. Marcelo Finger & Dov M. Gabbay (1992). Adding a Temporal Dimension to a Logic System. Journal of Logic, Language and Information 1 (3):203-233.score: 216.0
    We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  9. Joeri Engelfriet, Catholijn M. Jonker & Jan Treur (2002). Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic. Journal of Logic, Language and Information 11 (2):195-225.score: 216.0
    Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  10. F. Montagna, G. M. Pinna & E. B. Tiezzi (2000). A Cut-Free Proof System for Bounded Metric Temporal Logic Over a Dense Time Domain. Mathematical Logic Quarterly 46 (2):171-182.score: 216.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  11. S. Baratella (2004). An Infinitary Variant of Metric Temporal Logic Over Dense Time Domains. Mathematical Logic Quarterly 50 (3):249.score: 216.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  12. Stefano Baratella & Andrea Masini (2006). A Note on Unbounded Metric Temporal Logic Over Dense Time Domains. Mathematical Logic Quarterly 52 (5):450-456.score: 216.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  13. Franco Montagna, G. Michele Pinna & B. P. Tiezzi (2002). Investigations on Fragments of First Order Branching Temporal Logic. Mathematical Logic Quarterly 48 (1):51-62.score: 216.0
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. Tomohiro Hoshi & Audrey Yap (2009). Dynamic Epistemic Logic with Branching Temporal Structures. Synthese 169 (2):259 - 281.score: 210.0
    van Bentham et al. (Merging frameworks for interaction: DEL and ETL, 2007) provides a framework for generating the models of Epistemic Temporal Logic ( ETL : Fagin et al., Reasoning about knowledge, 1995; Parikh and Ramanujam, Journal of Logic, Language, and Information, 2003) from the models of Dynamic Epistemic Logic ( DEL : Baltag et al., in: Gilboa (ed.) Tark 1998, 1998; Gerbrandy, Bisimulations on Planet Kripke, 1999). We consider the logic TDEL on the merged (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Joeri Engelfriet & Jan Treur (1998). An Interpretation of Default Logic in Minimal Temporal Epistemic Logic. Journal of Logic, Language and Information 7 (3):369-388.score: 210.0
    When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  16. Sara L. Uckelman (2013). A Quantified Temporal Logic for Ampliation and Restriction. Vivarium 51 (1-4):485-510.score: 210.0
  17. V. Rybakov (2008). Discrete Linear Temporal Logic with Current Time Point Clusters, Deciding Algorithms. Logic and Logical Philosophy 17 (1-2):143-161.score: 208.0
    The paper studies the logic TL(NBox+-wC) – logic of discrete linear time with current time point clusters. Its language uses modalities Diamond+ (possible in future) and Diamond- (possible in past) and special temporal operations, – Box+w (weakly necessary in future) and Box-w (weakly necessary in past). We proceed by developing an algorithm recognizing theorems of TL(NBox+-wC), so we prove that TL(NBox+-wC) is decidable. The algorithm is based on reduction of formulas to inference rules and converting the rules (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  18. Norihiro Kamide (2009). Temporal Non-Commutative Logic: Expressing Time, Resource, Order and Hierarchy. Logic and Logical Philosophy 18 (2):97-126.score: 204.0
    A first-order temporal non-commutative logic TN[l], which has no structural rules and has some l-bounded linear-time temporal operators, is introduced as a Gentzen-type sequent calculus. The logic TN[l] allows us to provide not only time-dependent, resource-sensitive, ordered, but also hierarchical reasoning. Decidability, cut-elimination and completeness (w.r.t. phase semantics) theorems are shown for TN[l]. An advantage of TN[l] is its decidability, because the standard first-order linear-time temporal logic is undecidable. A correspondence theorem between TN[l] and (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. Swarup Mohalik & R. Ramanujam (2010). Automata for Epistemic Temporal Logic with Synchronous Communication. Journal of Logic, Language and Information 19 (4):451-484.score: 198.0
    We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages has good closure (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  20. Stefano Aguzzoli, Matteo Bianchi & Vincenzo Marra (2009). A Temporal Semantics for Basic Logic. Studia Logica 92 (2):147 - 162.score: 196.0
    In the context of truth-functional propositional many-valued logics, Hájek’s Basic Fuzzy Logic BL [14] plays a major rôle. The completeness theorem proved in [7] shows that BL is the logic of all continuous t -norms and their residua. This result, however, does not directly yield any meaningful interpretation of the truth values in BL per se . In an attempt to address this issue, in this paper we introduce a complete temporal semantics for BL. Specifically, we show (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Mark Reynolds (1997). A Decidable Temporal Logic of Parallelism. Notre Dame Journal of Formal Logic 38 (3):419-436.score: 186.0
    In this paper we shall introduce a simple temporal logic suitable for reasoning about the temporal aspects of parallel universes, parallel processes, distributed systems, or multiple agents. We will use a variant of the mosaic method to prove decidability of this logic. We also show that the logic does not have the finite model property. This shows that the mosaic method is sometimes a stronger way of establishing decidability.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22. V. V. Rybakov (2005). Logical Consecutions in Discrete Linear Temporal Logic. Journal of Symbolic Logic 70 (4):1137 - 1149.score: 186.0
    We investigate logical consequence in temporal logics in terms of logical consecutions. i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be 'correct' in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈L, ≤, ≥〉 of all integer numbers, is the (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  23. Marcelo Finger (1992). Handling Database Updates in Two-Dimensional Temporal Logic. Journal of Applied Non-Classical Logics 2 (2):201-224.score: 182.0
    ABSTRACT We introduce a two-dimensional temporal logic as a formalism which enables the description of both the history of a world and the evolution of an observer's views about the history. We apply such formalism to the description of certain problems that occur in historical database systems due to updates. The historical dimension describes the history of a world according to an observer's view at a certain moment in time. The transaction dimension describes the evolution of an observer's (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  24. Alfredo Burrieza & Inma P. De Guzmán (1992). A New Algebraic Semantic Approach and Some Adequate Connectives for Computation with Temporal Logic Over Discrete Time. Journal of Applied Non-Classical Logics 2 (2):181-200.score: 182.0
    ABSTRACT In this paper we present a new semantic approach for propositional linear temporal logic with discrete time, strongly based in the well-order of IN (the set of natural numbers). We consider temporal connectives which express precedence, posteriority and simultaneity, and they provide a family of expressively complete temporal logics. The selection of the new semantics and connectives used in this work was principally to obtain a suitable executable temporal logic, which can be used (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  25. Bernd-Holger Schlingloff (1992). Expressive Completeness of Temporal Logic of Trees. Journal of Applied Non-Classical Logics 2 (2):157-180.score: 182.0
    ABSTRACT Many temporal and modal logic languages can be regarded as subsets of first order logic, i.e. the semantics of a temporal logic formula is given as a first order condition on points of the underlying models (Kripke structures). Often the set of possible models is restricted to models which are trees. A temporal logic language is (first order) expressively complete, if for every first order condition for a node of a tree there (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  26. Regimantas Pliuskevicius (1998). Replacement of Induction by Similarity Saturation in a First Order Linear Temporal Logic. Journal of Applied Non-Classical Logics 8 (1-2):141-169.score: 182.0
    ABSTRACT A new type of calculi is proposed for a first order linear temporal logic. Instead of induction-type postulates the introduced calculi contain a similarity saturation principle, indicating some form of regularity in the derivations of the logic. In a finitary case we obtained the finite set of saturated sequents, showing that ?nothing new? can be obtained continuing the derivation process. Instead of the ?-type rule of inference, an infinitary saturated calculus has an infinite set of saturated (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  27. Thomas Ågotnes (2006). Action and Knowledge in Alternating-Time Temporal Logic. Synthese 149 (2):375 - 407.score: 180.0
    Alternating-time temporal logic (ATL) is a branching time temporal logic in which statements about what coalitions of agents can achieve by strategic cooperation can be expressed. Alternating-time temporal epistemic logic (ATEL) extends ATL by adding knowledge modalities, with the usual possible worlds interpretation. This paper investigates how properties of agents’ actions can be expressed in ATL in general, and how properties of the interaction between action and knowledge can be expressed in ATEL in particular. (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  28. Seiki Akama, Yasunori Nagata & Chikatoshi Yamada (2008). Three-Valued Temporal Logic Q T and Future Contingents. Studia Logica 88 (2):215 - 231.score: 180.0
    Prior's three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued temporal logic $Q_t $ and give its axiomatization and semantics. We also argue that $Q_t $ provides a smooth solution to the (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  29. Mark Reynolds (1996). Axiomatising First-Order Temporal Logic: Until and Since Over Linear Time. Studia Logica 57 (2-3):279 - 302.score: 180.0
    We present an axiomatisation for the first-order temporal logic with connectives Until and Since over the class of all linear flows of time. Completeness of the axiom system is proved.We also add a few axioms to find a sound and complete axiomatisation for the first order temporal logic of Until and Since over rational numbers time.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  30. Giacomo Bonanno (2007). Axiomatic Characterization of the AGM Theory of Belief Revision in a Temporal Logic. Artificial Intelligence 171 (2-3):144-160.score: 180.0
    Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  31. Walter Hussak (2008). Decidable Cases of First-Order Temporal Logic with Functions. Studia Logica 88 (2):247 - 261.score: 180.0
    We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be decided with EXPSPACE-complete complexity. A single rigid function is sufficient to make the logic not recursively enumerable. However, the monadic monodic fragment with rigid functions, where no two distinct terms have variables bound by the same quantifier, is decidable and EXPSPACE-complete.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  32. Anatoli Degtyarev, Michael Fisher & Alexei Lisitsa (2002). Equality and Monodic First-Order Temporal Logic. Studia Logica 72 (2):147-156.score: 180.0
    It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e., the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  33. Andrzej Indrzejczak (2003). A Labelled Natural Deduction System for Linear Temporal Logic. Studia Logica 75 (3):345 - 376.score: 180.0
    The paper is devoted to the concise description of some Natural Deduction System (ND for short) for Linear Temporal Logic. The system's distinctive feature is that it is labelled and analytical. Labels convey necessary semantic information connected with the rules for temporal functors while the analytical character of the rules lets the system work as a decision procedure. It makes it more similar to Labelled Tableau Systems than to standard Natural Deduction. In fact, our solution of linearity (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  34. Donald L. M. Baxter (2000). A Humean Temporal Logic. The Proceedings of the Twentieth World Congress of Philosophy 2000 (Analytic Philosophy and Logic):209-216.score: 180.0
    Hume argues that the idea of duration is just the idea of the manner in which several things in succession are arrayed. In other words, the idea of duration is the idea of successiveness. He concludes that all and only successions have duration. Hume also argues that there is such a thing as a steadfast object—something which co-exists with many things in succession, but which is not itself a succession. Thus, it seems that Hume has committed himself to a contradiction: (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  35. Nicholas Rescher (1971). Temporal Logic. New York,Springer-Verlag.score: 162.0
  36. Jean-Pierre Desclés, Anca Christine Pascu & Hee-Jin Ro (2014). Aspecto-Temporal Meanings Analysed by Combinatory Logic. Journal of Logic, Language and Information 23 (3):253-274.score: 162.0
    What is the meaning of language expressions and how to compute or calculate it? In this paper, we give an answer to this question by analysing the meanings of aspects and tenses in natural languages inside the formal model of an grammar of applicative, cognitive and enunciative operations (GRACE) (Desclés and Ro in Math Sci Hum 194:39–70, 2011), using the applicative formalism, functional types of categorial grammars and combinatory logic (CL) (Curry and Feys in Combinatory Logic. North-Holland Publishing, (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  37. L. E. Moser, P. M. Melliar-Smith, Y. S. Ramakrishna, G. Kutty & L. K. Dillon (1996). Automated Deduction in a Graphical Temporal Logic. Journal of Applied Non-Classical Logics 6 (1):29-47.score: 158.0
    ABSTRACT Real-time graphical interval logic is a modal logic for reasoning about time in which the basic modality is the interval. The logic differs from other logics in that it has a natural intuitive graphical representation that resembles the timing diagrams drawn by system designers. We have developed an automted deduction system for the logic, which includes a theorem prover and a user interface. The theorem prover checks the validity of proofs in the logic and (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  38. Avi Sion (1990). Future Logic: Categorical and Conditional Deduction and Induction of the Natural, Temporal, Extensional, and Logical Modalities. Lulu.com.score: 156.0
    Future Logic is an original and wide-ranging treatise of formal logic. It deals with deduction and induction, of categorical and conditional propositions, involving the natural, temporal, extensional, and logical modalities. This is the first work ever to strictly formalize the inductive processes of generalization and particularization, through the novel methods of factorial analysis, factor selection and formula revision. This is the first work ever to develop a formal logic of the natural, temporal and extensional types (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  39. Robert F. Barnes (1981). Interval Temporal Logic: A Note. [REVIEW] Journal of Philosophical Logic 10 (4):395 - 397.score: 156.0
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Ullrich Hustadt (2001). Temporal Logic: Mathematical Foundations and Computational Aspects, Volume 2, Dov M. Gabbay, Mark A. Reynolds, and Marcelo Finger. [REVIEW] Journal of Logic, Language and Information 10 (3):406-410.score: 156.0
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  41. John P. Burgess & Yuri Gurevich (1985). The Decision Problem for Linear Temporal Logic. Notre Dame Journal of Formal Logic 26 (2):115-128.score: 156.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  42. Marcelo Finger & Dov Gabbay (1996). Combining Temporal Logic Systems. Notre Dame Journal of Formal Logic 37 (2):204-232.score: 156.0
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Joeri Engelfriet (1996). Minimal Temporal Epistemic Logic. Notre Dame Journal of Formal Logic 37 (2):233-259.score: 156.0
    In the study of nonmonotonic reasoning the main emphasis has been on static (declarative) aspects. Only recently has there been interest in the dynamic aspects of reasoning processes, particularly in artificial intelligence. We study the dynamics of reasoning processes by using a temporal logic to specify them and to reason about their properties, just as is common in theoretical computer science. This logic is composed of a base temporal epistemic logic with a preference relation on (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  44. Luis Fariñas Del Cerro (1990). Temporal Logics and Their Applications, Edited by Galton Antony, Academic Press, London, San Diego, Etc., 1987, Xii+ 244 Pp.—Therein: Galton Antony. Temporal Logic and Computer Science: An Overview. Pp. 1–52. Barringer Howard. The Use of Temporal Logic in the Compositional Specification of Concurrent Systems. Pp. 53–90. Hale Roger. Temporal Logic Programming. Pp. 91–119. Sadri Fariba. Three Recent Approaches to Temporal Reasoning. Pp. 121–168. Galton Antony. The Logic of Occurrence. Pp. 169–196. Gabbay Dov. Modal and Temporal Logic Programming. Pp. 197–237. [REVIEW] Journal of Symbolic Logic 55 (1):364-366.score: 156.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  45. Angelo Montanari & Alberto Policriti (1997). Review: Peter Ohrstrom, Per F. V. Hasle, Temporal Logic. From Ancient Ideas to Artificial Intelligence. [REVIEW] Journal of Symbolic Logic 62 (3):1044-1046.score: 156.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Sergey Babenyshev & Vladimir Rybakov (2011). Unification in Linear Temporal Logic LTL. Annals of Pure and Applied Logic 162 (12):991-1000.score: 156.0
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  47. Robert A. Bull (1975). Review: Nicholas Rescher, Temporal Logic. [REVIEW] Journal of Symbolic Logic 40 (2):252-253.score: 156.0
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. Luis Farinas Del Cerro (1990). Review: Antony Galton, Temporal Logics and Their Applications; Antony Galton, Temporal Logic and Computer Science: An Overview. [REVIEW] Journal of Symbolic Logic 55 (1):364-366.score: 156.0
    Direct download  
     
    My bibliography  
     
    Export citation  
  49. Newton da Costa & Steven French (1989). A Note on Temporal Logic. Bulletin of the Section of Logic 18 (2):51-55.score: 156.0
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Luis Farinas Del Cerro (1990). Review: Antony Galton, Temporal Logics and Their Applications; Antony Galton, Temporal Logic and Computer Science: An Overview. [REVIEW] Journal of Symbolic Logic 55 (1):364-366.score: 156.0
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000