scientific article

M. A. Reynolds, I. M. Hodkinson, Dov M. Gabbay

Publication date: 24 April 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

expressive power axiomatization fixed-point operators propositional temporal logic predicate temporal logic temporal flow

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Logic in computer science (03B70)

Related Items

Time and determinism, Combinations of \textit{stit} with \textit{ought} and \textit{know}, Multiagent temporal logics with multivaluations, Future temporal logic needs infinitely many modalities, Finite \(H\)-dimension does not imply expressive completeness, Linear temporal logic vehicle routing with applications to multi-UAV mission planning, The structure of lattices of subframe logics, T \(\times\) W completeness, Invariant-free clausal temporal resolution, The complexity of model checking multi-stack systems, Connectionist modal logic: representing modalities in neural networks, Temporal multi-valued logic with lost worlds in the past, Many-valued multi-modal logics, satisfiability problem, Bounded variability of metric temporal logic, Temporal logics with incommensurable distances are undecidable, Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, A decidable temporal logic of parallelism, Temporal logic and its application to normative reasoning, A propositional probabilistic logic with discrete linear time for reasoning about evidence, On Almost Future Temporal Logics, On Topologically Relevant Fragments of the Logic of Linear Flows of Time, Separation logics and modalities: a survey, A survey on temporal logics for specifying and verifying real-time systems, Counting on CTL\(^*\): On the expressive power of monadic path logic, The complexity of the temporal logic with ``until over general linear time, On the equational definition of the least prefixed point., Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms, Temporal logics over linear time domains are in PSPACE, Continuous time temporal logic with counting, Axiomatizing hybrid products. How can we reason many-dimensionally in hybrid logic?, On the mosaic method for many-dimensional modal logics: a case study combining tense and modal operators, Axiomatising the Prior future in predicate logic, Predicate metric tense logic for `now' and `then', A new combination procedure for the word problem that generalizes fusion decidability results in modal logics, Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions, The complexity of temporal logic over the reals, Multi-agent logics with multi-valuations and intensional logical operations, Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic, Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of \(\Sigma\)-automata, Multi-agent temporal nontransitive linear logics and the admissibility problem, Mathematical modal logic: A view of its evolution, An analytic tableau calculus for a temporalised belief logic, Operator precedence temporal logic and model checking, A propositional linear time logic with time flow isomorphic to \(\omega^2\), Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms, Complexity of Metric Temporal Logics with Counting and the Pnueli Modalities, MTL with Bounded Variability: Decidability and Complexity, A two dimensional tense-modal sortal logic, Geometrical structures and modal logic, A tableau calculus for first-order branching time logic, Principles Of Talmudic Logic, Arity hierarchy for temporal logics, On Gabbay's temporal fixed point operator, First-order rewritability of ontology-mediated queries in linear temporal logic, The \(k\)-variable property is stronger than H-dimension \(k\), Planning temporal events using point-interval logic, The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT, An axiomatization of full Computation Tree Logic, Temporal reference in linear tense logic, An approach to infinitary temporal proof theory, Mechanising first-order temporal resolution, Complexity of metric temporal logics with counting and the Pnueli modalities, Elementary canonical formulae: extending Sahlqvist's theorem, \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\), Timer formulas and decidable metric temporal logic, Quantification over sets of possible worlds in branching-time semantics, Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces, Connectionist computations of intuitionistic reasoning, LTL over integer periodicity constraints, An expressively complete linear time temporal logic for Mazurkiewicz traces, First-order logic with two variables and unary temporal logic, Unnamed Item, Event-based time-stamped claim logic, A system of dynamic modal logic, Combining temporal logic systems, Expressive Completeness for LTL With Modulo Counting and Group Quantifiers, Star free expressions over the reals, Temporal logic with accessibility temporal relations generated by time states themselves, Axiomatising first-order temporal logic: Until and since over linear time, An axiomatization of PCTL*, Branching time agents logics, satisfiability problem by rules in reduced form, Combinations of tense and modality for predicate logic, Axiomatizing the monodic fragment of first-order temporal logic, Decidable fragments of first-order temporal logics, Temporal connectives versus explicit timestamps to query temporal databases, Complexity of monodic guarded fragments over linear and real time, A two-level temporal logic for evolving specifications., Expressive completeness of duration calculus., An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic, An infinite hierarchy of temporal logics over branching time, A Hybridization of Irreflexive Modal Logics, Adding a temporal dimension to a logic system, Propositional \(\text Q\)-logic, LTL is expressively complete for Mazurkiewicz traces, Combining interval-based temporal reasoning with general TBoxes, \({\mathcal E}\)-connections of abstract description systems, No future without (\textit{a hint of}) past. A finite basis for `almost future' temporal logic, Synthesis for continuous time, A theory of hypermodal logics: Mode shifting in modal logic, All finitely axiomatizable tense logics of linear time flows are coNP-complete, Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction, The Expressive Power of Temporal and First-Order Metric Logics, Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge, A separation theorem for discrete-time interval temporal logic, Dynamic temporal logical operations in multi-agent logics, Algebraic characterizations and block product decompositions for first order logic and its infinitary quantifier extensions over countable words, Formulas expressing totally nonstable truth values of formulas, Admissibility and unification in the modal logics related to S4.2, Unnamed Item, Unnamed Item, A Branching Time Logical System for Open Distributed Systems Development, ON FORMALIZING CAUSATION BASED ON CONSTANT CONJUNCTION THEORY, Failure of interpolation in combined modal logics, Unnamed Item, Linear Temporal Logic with Non-transitive Time, Algorithms for Decidability and Verification of Admissibility, Unnamed Item, Similarity saturation for first order linear temporal logic with UNLESS, Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers, Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK, Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality, Unnamed Item, First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries