Pages that link to "Item:Q3541686"
From MaRDI portal
The following pages link to On Automating the Calculus of Relations (Q3541686):
Displaying 13 items.
- Programming and automating mathematics in the Tarski-Kleene hierarchy (Q406433) (← links)
- Hopscotch -- reaching the target hop by hop (Q406451) (← links)
- Cardinality of relations with applications (Q738869) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- Cryptomorphic topological structures: a computational, relation-algebraic approach (Q1633340) (← links)
- Relational characterisations of paths (Q2210868) (← links)
- Solving quantifier-free first-order constraints over finite sets and binary relations (Q2303241) (← links)
- Modal algebra and Petri nets (Q2340252) (← links)
- An algebra of database preferences (Q2347915) (← links)
- Using relation-algebraic means and tool support for investigating and computing bipartitions (Q2360655) (← links)
- Implementing a relational theorem prover for modal logic (Q3008387) (← links)
- Completeness for Identity-free Kleene Lattices (Q5009432) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)
