Definability in dynamic logic

DOI10.1016/0022-0000(81)90016-7zbMath0472.03013OpenAlexW2007469624MaRDI QIDQ1158140

Rohit Parikh, Albert R. Meyer

Publication date: 1981

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(81)90016-7

zbMATH Keywords

infinitary logicexpressive powerdistinct classes of program constructionsrandom and array assignments

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65)

Related Items

``During cannot be expressed by ``after ⋮ Concurrent program schemes and their logics ⋮ Communication in concurrent dynamic logic ⋮ Expressing program looping in regular dynamic logic ⋮ Definability with bounded number of bound variables ⋮ Process logic: Expressiveness, decidability, completeness ⋮ Definability by programs in first-order structures ⋮ More on looping vs. repeating in dynamic logic ⋮ Some applications of topology to program semantics ⋮ Decidability and definability with circumscription ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Necessary and sufficient conditions for the universality of programming formalisms ⋮ Equivalences among logics of programs ⋮ Propositional dynamic logic with local assignments

Cites Work

• Finiteness is mu-ineffable
• First-order dynamic logic
• Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
• An application of games to the completeness problem for formalized theories
• Proving termination with multiset orderings
• Infinitary logic and admissible sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item