Decidability for branching time

From MaRDI portal
Publication:1155599

DOI10.1007/BF00370320zbMath0467.03006MaRDI QIDQ1155599

John P. Burgess

Publication date: 1980

Published in: Studia Logica (Search for Journal in Brave)




Related Items (23)

Axiomatization of a branching time logic with indistinguishability relationsHyperboolean Algebras and Hyperboolean Modal LogicСистемы временной логики I: моменты, истории, деревьяDerivation rules as anti-axioms in modal logicMoment/history duality in Prior's logics of branching-timeA quantitative analysis of modal logicA letter on the present state of affairs. Prior, indeterminism and relativity 40 years laterA CLASSICAL MODAL THEORY OF LAWLESS SEQUENCESCompleteness of a branching-time logic with possible choicesOn the mosaic method for many-dimensional modal logics: a case study combining tense and modal operatorsBranching-time logic with quantification over branches: The point of view of modal logicA propositional linear time logic with time flow isomorphic to \(\omega^2\)Decidability of a partial order based temporal logicTABLEAUX: A general theorem prover for modal logicsA logical characterization of well branching event structuresAn axiomatization of full Computation Tree LogicQuantification over sets of possible worlds in branching-time semanticsAxiomatization of `Peircean' branching-time logicModels and logics for true concurrency.First-order definability of transition structuresA strict implication calculus for compact Hausdorff spacesAdmissibility of \(\Pi_2\)-inference rules: interpolation, model completion, and contact algebrasModal logics of domains on the real plane



Cites Work


This page was built for publication: Decidability for branching time