Pages that link to "Item:Q851144"
From MaRDI portal
The following pages link to Ordinal arithmetic: Algorithms and mechanization (Q851144):
Displaying 12 items.
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations (Q485843) (← links)
- Ordinal arithmetic based on Skolem hulling (Q866560) (← links)
- Inference rules for proving the equivalence of recursive procedures (Q938300) (← links)
- A mechanizable first-order theory of ordinals (Q1694476) (← links)
- Natural addition of ordinals (Q2337334) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings (Q3295146) (← links)
- Inference Rules for Proving the Equivalence of Recursive Procedures (Q3587255) (← links)
- Trees, ordinals and termination (Q5044740) (← links)
- Formal Methods in Computer-Aided Design (Q5492968) (← links)
- An ordinal calculus for proving termination in term rewriting (Q5878912) (← links)
- Automated Deduction – CADE-19 (Q5900722) (← links)