The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Definability in Dynamic Logic
The work
| Authors | Albert R. Meyer; Rohit Parikh |
|---|---|
| Editors | |
| Type | misc |
| Year | 1980 |
| Citekey | meyer1980definability |
Where it appeared
| Published in | ACM Symposium on Theory of Computing (STOC) |
|---|---|
| Pages | 1--7 |
Identifiers
| DOI | 10.1145/800141.804646 |
|---|---|
| OpenAlex | W2078208691 |
Access
| Landing page | https://doi.org/10.1145/800141.804646 |
|---|---|
| Free full text | https://dl.acm.org/doi/pdf/10.1145/800141.804646 |
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
We study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary logic LCKω1ω, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals ωω and ω ω.2 are indistinguishable by formulas of regular Dynamic Logic.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-24 07:58 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{meyer1980definability,
title = {Definability in Dynamic Logic},
author = {Albert R. Meyer and Rohit Parikh},
year = {1980},
journal = {ACM Symposium on Theory of Computing (STOC)},
pages = {1--7},
doi = {10.1145/800141.804646},
}
This record lives at https://refs.drheap.org/meyer1980definability/ and will keep doing so.