AbstractA unified single proof is given which implies theorems in such diverse fields as continuous algebras of algebraic semantics, dynamic algebras of logics of programs, and program verification methods for total correctness. The proof concerns ultraproducts and diagonalization
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about dynamic topologica...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
AbstractA unified single proof is given which implies theorems in such diverse fields as continuous ...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractA system of dynamic predicate logic is presented. It allows nonstandard modelling of time, w...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractWe introduce and discuss a notion of strictly arithmetical completeness related to relative ...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
AbstractWe give an algorithm for “before-after” reasoning about action. The algorithm decides satisf...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
This paper introduces a method to build dynamic logics with a graded semantics. The construction is ...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about dynamic topologica...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
AbstractA unified single proof is given which implies theorems in such diverse fields as continuous ...
We make explicit a connection between the “unwind property” and first-order logics of programs. Usin...
AbstractA system of dynamic predicate logic is presented. It allows nonstandard modelling of time, w...
The present author as well as Andréka's group has experienced, while writing program- verifying prog...
AbstractWe introduce and discuss a notion of strictly arithmetical completeness related to relative ...
AbstractSeveral different first-order formal logics of programs—Algorithmic Logic, Dynamic Logic, an...
Propositional dynamic logic is a formal system for reasoning about the before—after behavior of regu...
AbstractWe give an algorithm for “before-after” reasoning about action. The algorithm decides satisf...
AbstractWe consider a restricted propositional dynamic logic, Strict Deterministic Propositional Dyn...
AbstractA simplified proof of the result stating that deterministic dynamic logic is strictly weaker...
Several versions of quantified dynamic logic are shown to be equivalent in expressive power to “stat...
This paper introduces a method to build dynamic logics with a graded semantics. The construction is ...
AbstractWe study the expressive power of various versions of Dynamic Logic and compare them with eac...
Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about dynamic topologica...
AbstractAssertional s-rings are introduced to provide an algebraic setting in which the finite and i...
DOI
Add to ORKG