The following pages link to (Q4395612):
Displaying 11 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)
- Soft linear set theory (Q941435) (← links)
- The standardization principle in the theory of bounded sets (Q1280333) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Constructibility and decidability versus domain independence and absoluteness (Q2482456) (← links)
- Wholly \((o)\)-bounded sets (Q2734076) (← links)
- (Q3222891) (← links)
- The Essential Boundary of Certain Sets (Q3726388) (← links)
- Bounded finite set theory (Q6047677) (← links)