The following pages link to (Q3800030):
Displaying 42 items.
- Introduction to clarithmetic. II (Q259084) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Circuit lower bounds in bounded arithmetics (Q466447) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- Transductions in arithmetic (Q904144) (← links)
- Taking the Pirahã seriously (Q907196) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Completeness proofs for propositional logic with polynomial-time connectives (Q1123883) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- On some formalized conservation results in arithmetic (Q1264147) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals (Q1362334) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Intuitionistic formal theories with realizability in subrecursive classes (Q1377631) (← links)
- Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) (Q1392020) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- On constructivity and the Rosser property: a closer look at some Gödelean proofs (Q1653263) (← links)
- Elementary arithmetic (Q1772782) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- A strong induction scheme that leads to polynomially computable realizations (Q1885030) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Unprovability of consistency statements in fragments of bounded arithmetic (Q1896613) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- On efficiency of notations for natural numbers (Q2143116) (← links)
- Friedman-reflexivity (Q2159935) (← links)
- Applicative theories for logarithmic complexity classes (Q2346995) (← links)
- Circuit principles and weak pigeonhole variants (Q2383589) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- A feasible theory of truth over combinatory algebra (Q2637706) (← links)
- An algebra and a logic for \(NC^ 1\) (Q2638772) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Structural properties for feasibly computable classes of type two (Q4009811) (← links)
- Graded multicategories of polynomial-time realizers (Q5096260) (← links)
- Finitely axiomatized theories lack self‐comprehension (Q6051417) (← links)
