The following pages link to Silvia Steila (Q324246):
Displaying 14 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)
- Ramsey Theorem for Pairs As a Classical Principle in Intuitionistic Arithmetic (Q2968410) (← links)
- The Strength of the SCT Criterion (Q2988827) (← links)
- A Combinatorial Bound for a Restricted Form of the Termination Theorem (Q3295155) (← links)
- From Mathesis Universalis to Fixed Points and Related Set-Theoretic Concepts (Q3305630) (← links)
- ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS (Q4579812) (← links)
- The strength of SCT soundness (Q4612439) (← links)
- A DIRECT PROOF OF SCHWICHTENBERG’S BAR RECURSION CLOSURE THEOREM (Q4638975) (← links)
- RAMSEY’S THEOREM FOR PAIRS AND<i>K</i>COLORS AS A SUB-CLASSICAL PRINCIPLE OF ARITHMETIC (Q4977228) (← links)
- An analysis of the Podelski–Rybalchenko termination theorem via bar recursion (Q5225855) (← links)
- Some algebraic equivalent forms of $\mathbb {R}\subseteq L$ (Q5226507) (← links)
- An Intuitionistic Analysis of Size-change Termination (Q5277982) (← links)
- GENERIC LARGE CARDINALS AND SYSTEMS OF FILTERS (Q5359568) (← links)
