Pages that link to "Item:Q801684"
From MaRDI portal
The following pages link to Equivalences among logics of programs (Q801684):
Displaying 14 items.
- Equivalence of two fixed-point semantics for definitional higher-order logic programs (Q512650) (← links)
- Computational inductive definability (Q598276) (← links)
- Programming in equational logic: Beyond strong sequentiality (Q689097) (← links)
- ``During'' cannot be expressed by ``after'' (Q1085154) (← links)
- Some relationships between logics of programs and complexity theory (Q1106839) (← links)
- The problem of equivalence in commutative s-models for programs (Q1111006) (← links)
- A simplified proof of \(DDL<DL\) (Q1117214) (← links)
- A logic of recursion (Q1262303) (← links)
- Equivalence of two formal semantics for functional logic programs (Q2867964) (← links)
- (Q3217582) (← links)
- (Q3316584) (← links)
- (Q4029607) (← links)
- (Q4812966) (← links)
- On logical and concurrent equivalences (Q4917082) (← links)