Pages that link to "Item:Q801684"
From MaRDI portal
The following pages link to Equivalences among logics of programs (Q801684):
Displaying 5 items.
- Computational inductive definability (Q598276) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- A simplified proof of \(DDL<DL\) (Q1117214) (← links)
- A logic of recursion (Q1262303) (← links)
