A decidable temporal logic of parallelism

DOI10.1305/NDJFL/1039700748MaRDI QIDQ1130239zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

decidabilitydistributed systemstemporal logicparallel processesmultiple agentsfinite model propertyparallel universesmosaic method

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 747023 (Why is no real title available?)
• scientific article; zbMATH DE number 1303433 (Why is no real title available?)
• scientific article; zbMATH DE number 1028832 (Why is no real title available?)
• scientific article; zbMATH DE number 1536560 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• A Gabbay-rule free axiomatization of T W validity
• A decidable temporal logic of parallelism
• A finite axiomatization of the set of strongly valid Ockhamist formulas
• A multiprocess network logic with temporal and spatial modalities
• Adding a temporal dimension to a logic system
• Causation
• Combining temporal logic systems
• Complexity of products of modal logics
• Extending partial isomorphisms of graphs
• Extending partial isomorphisms on finite structures
• Independent propositional modal logics
• Logic and time
• T W completeness
• The decision problem for branching time logic
• Two-dimensional modal logic

Cited in

(20)

• scientific article; zbMATH DE number 7445165 (Why is no real title available?)
• Modal logics of succession for 2-dimensional integral spacetime
• Non-primitive recursive decidability of products of modal logics with expanding domains
• scientific article; zbMATH DE number 1612560 (Why is no real title available?)
• scientific article; zbMATH DE number 1424541 (Why is no real title available?)
• Системы временной логики 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

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)