Pages that link to "Item:Q4023582"
From MaRDI portal
The following pages link to Deduction and Declarative Programming (Q4023582):
Displaying 6 items.
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- An upper bound on the derivational complexity of Knuth-Bendix orderings. (Q1401942) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Expander2: Program Verification Between Interaction and Automation (Q2873787) (← links)
- Generic induction proofs (Q5881185) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
