A completeness proof for an infinitary tense-logic
From MaRDI portal
Publication:4138711
Cited in
(13)- A formal system for parallel programs in discrete time and space
- A model existence theorem in infinitary propositional modal logic
- Infinitary calculus for a restricted first-order linear temporal logic without contraction on quantified formulas
- Discrete tense logic with infinitary inference rules and systematic frame constants: A Hilbert-style axiomatization
- Loop-check specification for a sequent calculus of temporal logic
- Loop-type sequent calculi for temporal logic
- Invertible infinitary calculus without loop rules for restricted FTL
- Logics with Probability Operators
- A derivation-loop method for temporal logic
- More efficient proof-search for sequents of temporal logic
- A variant of the lindenbaum lemma for infinitary closure systems
- Modal logics with intersection modality
- Global condition check strategy for a cyclic sequent calculus of temporal logic
This page was built for publication: A completeness proof for an infinitary tense-logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138711)