Pages that link to "Item:Q801682"

The following pages link to The propositional dynamic logic of deterministic, well-structured programs (Q801682):

Displaying 35 items.

• Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
• Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
• A dynamic logic for QASM programs (Q777899) (← links)
• Propositional dynamic logic of nonregular programs (Q792083) (← links)
• An essay in combinatory dynamic logic (Q809068) (← links)
• Propositional dynamic logic of context-free programs and fixpoint logic with chop (Q845832) (← links)
• A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
• A probabilistic PDL (Q1063584) (← links)
• PDL with data constants (Q1065545) (← links)
• Belief, awareness, and limited reasoning (Q1096610) (← links)
• A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
• Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
• The complexity of reasoning about knowledge and time. I: Lower bounds (Q1119565) (← links)
• Determinism and non-determinism in PDL (Q1177157) (← links)
• The complexity of PDL with interleaving (Q1351943) (← links)
• The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
• A sound and complete Hoare logic for dynamically-typed, object-oriented programs (Q2026792) (← links)
• Model checking propositional dynamic logic with all extras (Q2494725) (← links)
• Mechanizing common knowledge logic using COQ (Q2643149) (← links)
• Propositional dynamic logic with recursive programs (Q2643333) (← links)
• Independence in dynamically scheduled logic languages (Q2956712) (← links)
• MODAL RESTRICTION SEMIGROUPS: TOWARDS AN ALGEBRA OF FUNCTIONS (Q3112579) (← links)
• Frame Theory, Dependence Logic and Strategies (Q3455191) (← links)
• From Philosophical to Industrial Logics (Q3601803) (← links)
• PDL with negation of atomic programs (Q3647227) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• Decision complexity of variants of propositional dynamic logic (Q3897033) (← links)
• (Q4964729) (← links)
• On proving properties of completion strategies (Q5055777) (← links)
• Propositional Dynamic Logic with Storing, Recovering and Parallel Composition (Q5179014) (← links)
• Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL (Q5271051) (← links)
• Automated Reasoning (Q5307064) (← links)
• From Monadic Logic to PSL (Q5452203) (← links)
• 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)
• Dynamic logic as a uniform framework for theorem proving in intensional logic (Q6488557) (← links)