The following pages link to Stop When You Are Almost-Full (Q2914747):
Displayed 8 items.
- Reverse mathematical bounds for the termination theorem (Q324248) (← links)
- An intuitionistic version of Ramsey's theorem and its use in program termination (Q499082) (← links)
- Certified Kruskal’s Tree Theorem (Q2938047) (← links)
- A Mechanized Proof of Higman’s Lemma by Open Induction (Q3295156) (← links)
- RAMSEY’S THEOREM FOR PAIRS AND<i>K</i>COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC (Q4977228) (← links)
- (Q5013829) (← links)
- Constructive decision via redundancy-free proof-search (Q5919012) (← links)
- Admissible ordering on monomials is well-founded: a constructive proof (Q6094419) (← links)
