scientific article; zbMATH DE number 3943779

MaRDI QIDQ3715089zbMATH OpenFDO

Authors Max Michel

Publication date 1985

zbMATH Keywords

decidabilitydecision algorithmsBüchi automataDiscrete propositional temporal logicsecond order monadic arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 3871318
• The complexity of propositional linear temporal logics
• The temporal logic of branching time
• Propositional temporal logics: decidability and completeness
• A generalized nexttime operator in temporal logic

Cited in

(2)

• The compound interest in relaxing punctuality
• A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715089)