Pages that link to "Item:Q1839245"

The following pages link to Deterministic propositional dynamic logic: finite models, complexity, and completeness (Q1839245):

Displaying 12 items.

• The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
• An essay in combinatory dynamic logic (Q809068) (← links)
• Determinism and looping in combinatory PDL (Q921968) (← links)
• Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
• Satisfiability in many-valued sentential logic is NP-complete (Q1100196) (← links)
• A modal perspective on the computational complexity of attribute value grammar (Q1314274) (← links)
• The price of universality (Q1815426) (← links)
• Propositional dynamic logic with quantification over regular computation sequences (Q2151417) (← links)
• Program schemata technique for propositional program logics: a 30-year history (Q2216719) (← links)
• Decision procedures and expressiveness in the temporal logic of branching time (Q2265816) (← links)
• Mechanizing common knowledge logic using COQ (Q2643149) (← links)
• MODAL RESTRICTION SEMIGROUPS: TOWARDS AN ALGEBRA OF FUNCTIONS (Q3112579) (← links)