Axiomatization of `Peircean' branching-time logic
From MaRDI portal
Publication:2276944
\textit{J. P. Burgess} [Stud. Logica 39, 203-218 (1980; Zbl 0467.03006)] has given a complete and finite axiomatization of the ``Peircean branching time logic involving, yet, a rather unusual derivation rule which proved to be a version of the irreflexivity rule of \textit{D. Gabbay} [Aspects of philosophical logic, Synth. Libr. 147, 67-89 (1981; Zbl 0519.03008)]. The author gives here a complete, but infinite axiomatization of the same logic using only ``standard derivation rules of tense logic.
Recommendations
Cites work
Cited in
(10)- A note about the axioms for branching-time logic
- First-order definability of transition structures
- Quantification over sets of possible worlds in branching-time semantics
- Axiomatization of a branching time logic with indistinguishability relations
- Derivation rules as anti-axioms in modal logic
- Branching-time logic with quantification over branches: The point of view of modal logic
- Системы временной логики I: моменты, истории, деревья
- Axioms for Branching Time
- Completeness of a branching-time logic with possible choices
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics
This page was built for publication: Axiomatization of `Peircean' branching-time logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276944)