The following pages link to (Q3757915):
Displaying 12 items.
- Operational closure and stability (Q385076) (← links)
- Explicit mathematics: power types and overloading (Q556826) (← links)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
- The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Partial Horn logic and Cartesian categories (Q866572) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- On Feferman's operational set theory \textsf{OST} (Q2463480) (← links)
