The following pages link to First-order dynamic logic (Q1255942):
Displaying 50 items.
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Modal logics for communicating systems (Q578896) (← links)
- Predicative specifications for functional programs describing communicating networks (Q579917) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Iterative and recursive matrix theories (Q595766) (← links)
- Toward automatic verification of quantum programs (Q667515) (← links)
- On the logic of UNITY (Q673960) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- The temporal logic of branching time (Q789895) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- The comparison of the expressive power of first-order dynamic logics (Q791517) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Hierarchies of program logics (Q801048) (← links)
- Necessary and sufficient conditions for the universality of programming formalisms (Q801666) (← links)
- Equivalences among logics of programs (Q801684) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- An essay in combinatory dynamic logic (Q809068) (← links)
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- Interval extensions of orders and temporal approximation spaces (Q820474) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Proving total correctness of recursive procedures (Q913478) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- On infinite computations in denotational semantics (Q1051414) (← links)
- Ten years of Hoare's logic: A survey. II: Nondeterminism (Q1056534) (← links)
- DAL -- a logic for data analysis (Q1058847) (← links)
- Propositional dynamic logic with local assignments (Q1062972) (← links)
- PDL with data constants (Q1065545) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- Formal theories of knowledge in AI and robotics (Q1079021) (← links)
- An algebraic study of well-foundedness (Q1087540) (← links)
- A simple dynamic logic (Q1087866) (← links)
- First-order approximation of algorithmic theories (Q1095655) (← links)
- Arithmetical axiomatization of first-order temporal logic (Q1101100) (← links)
- Infinitary propositional normal modal logic (Q1102267) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- Some general incompleteness results for partial correctness logics (Q1110500) (← links)
- An automata theoretic decision procedure for the propositional mu- calculus (Q1119630) (← links)
- The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
- Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) (← links)
- On the total correctness of nondeterministic programs (Q1143163) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- Arithmetical completeness in first-order dynamic logic for concurrent programs (Q1155351) (← links)
- Proving total correctness of nondeterministic programs in infinitary logic (Q1155605) (← links)
- A formal system for parallel programs in discrete time and space (Q1157161) (← links)
- Definability in dynamic logic (Q1158140) (← links)
- Floyd's principle, correctness theories and program equivalence (Q1158948) (← links)
- A complete logic for reasoning about programs via nonstandard model theory. I (Q1159460) (← links)
- On termination problems for finitely interpreted ALGOL-like programs (Q1161274) (← links)
- On logic of complex algorithms (Q1162145) (← links)
