The following pages link to Automated Deduction – CADE-19 (Q5900722):
Displaying 10 items.
- Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by \(\omega\) (Q783293) (← links)
- Ordinal arithmetic: Algorithms and mechanization (Q851144) (← links)
- A mechanical analysis of program verification strategies (Q928673) (← links)
- Integrating external deduction tools with ACL2 (Q1006728) (← links)
- A proof of strongly uniform termination for Gödel's \(T\) by methods from local predicativity (Q1374676) (← links)
- A mechanizable first-order theory of ordinals (Q1694476) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Specification and verification of concurrent programs through refinements (Q2351261) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- Formal Methods in Computer-Aided Design (Q5492968) (← links)
