A decidable temporal logic of parallelism
DOI10.1305/NDJFL/1039700748zbMATH Open0904.03010OpenAlexW2040022302MaRDI QIDQ1130239FDOQ1130239
Authors: Mark Alexander Reynolds
Publication date: 19 January 1999
Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1305/ndjfl/1039700748
Recommendations
- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
- The temporal logic of branching time
- Decidability and complexity via mosaics of the temporal logic of the lexicographic products of unbounded dense linear orders
- scientific article; zbMATH DE number 1305046
- Temporal logic of Minkowski spacetime
decidabilitydistributed systemstemporal logicparallel processesmultiple agentsfinite model propertyparallel universesmosaic method
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Other applications of logic (03B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A finite axiomatization of the set of strongly valid Ockhamist formulas
- Adding a temporal dimension to a logic system
- A decidable temporal logic of parallelism
- Complexity of products of modal logics
- Two-dimensional modal logic
- Logic and time
- Extending partial isomorphisms of graphs
- Combining temporal logic systems
- Extending partial isomorphisms on finite structures
- A multiprocess network logic with temporal and spatial modalities
- Title not available (Why is that?)
- Causation
- The decision problem for branching time logic
- T \(\times\) W completeness
- A Gabbay-rule free axiomatization of \(T\times W\) validity
- Independent propositional modal logics
- Title not available (Why is that?)
Cited In (20)
- Non-primitive recursive decidability of products of modal logics with expanding domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Системы временной логики I: моменты, истории, деревья
- A Paraconsistent Linear-time Temporal Logic
- The decision problem of modal product logics with a diagonal, and faulty counter machines
- The complexity of the temporal logic with ``until over general linear time
- Products of ‘transitive” modal logics
- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms
- A Temporal Logic for Multi-threaded Programs
- A decidable temporal logic of parallelism
- Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
- On the mosaic method for many-dimensional modal logics: a case study combining tense and modal operators
- THE TEMPORAL LOGIC OF TWO DIMENSIONAL MINKOWSKI SPACETIME IS DECIDABLE
- Completeness of a functional system for surjective functions
- Generalization of some properties of relations in the context of functional temporal×modal logic
- On the axiomatizability of some first-order spatio-temporal theories
- About the temporal logic of the lexicographic products of unbounded dense linear orders: a new study of its computability
- Modal logics of succession for 2-dimensional integral spacetime
- Title not available (Why is that?)
This page was built for publication: A decidable temporal logic of parallelism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1130239)