The following pages link to (Q4395612):
Displayed 5 items.
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Cobham recursive set functions (Q904151) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Constructibility and decidability versus domain independence and absoluteness (Q2482456) (← links)