Pages that link to "Item:Q5387851"
From MaRDI portal
The following pages link to Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic (Q5387851):
Displaying 5 items.
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- A mechanical verification of the stressing algorithm for negative cost cycle detection in networks (Q532429) (← links)
- Linear quantifier elimination (Q707743) (← links)
- Proof synthesis and reflection for linear arithmetic (Q945055) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)