The following pages link to (Q3487327):
Displayed 14 items.
- A simple proof of Parsons' theorem (Q558443) (← links)
- The provably terminating operations of the subsystem PETJ of explicit mathematics (Q639690) (← links)
- The counting hierarchy in binary notation (Q1008842) (← links)
- Binary models generated by their tally part (Q1337500) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- What are the \(\forall \Sigma_ 1^ b\)-consequences of \(T_ 2^ 1\) and \(T_ 2^ 2\)? (Q1899145) (← links)
- An algebraic treatment of quantifier-free systems of arithmetic (Q1915125) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- Reflecting and unfolding (Q2094161) (← links)
- Bounded theories for polyspace computability (Q2450770) (← links)
- Herbrand analyses (Q2641297) (← links)
- The axiom of choice and combinatory logic (Q4650272) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- Unfolding Schematic Systems (Q5214786) (← links)