The following pages link to (Q4513965):
Displaying 7 items.
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Computable structures and the hyperarithmetical hierarchy (Q1572657) (← links)
- Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts (Q2784778) (← links)
- (Q3136460) (← links)
- The atomic model theorem and type omitting (Q3642694) (← links)
- A Complete Axiomatization of Computer Arithmetic (Q3694696) (← links)
- Techniques of computable set theory with applications to proof verification (Q4884662) (← links)