The following pages link to A new “feasible” arithmetic (Q4532603):
Displayed 7 items.
- Introduction to clarithmetic. I (Q642523) (← links)
- Radical anti-realism, Wittgenstein and the length of proofs (Q2268776) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Tiering as a Recursion Technique (Q3370611) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)