The following pages link to (Q3794177):
Displaying 50 items.
- A note on typed truth and consistency assertions (Q263089) (← links)
- Provability and interpretability logics with restricted realizations (Q435232) (← links)
- Construction of models of bounded arithmetic by restricted reduced powers (Q506954) (← links)
- Conservative fragments of \({{S}^{1}_{2}}\) and \({{R}^{1}_{2}}\) (Q535152) (← links)
- Nested PLS (Q535153) (← links)
- A simple proof of Parsons' theorem (Q558443) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Admissible closures of polynomial time computable arithmetic (Q634777) (← links)
- The strength of sharply bounded induction requires MSP (Q636290) (← links)
- Bootstrapping. I (Q636291) (← links)
- On the computational complexity of cut-reduction (Q636310) (← links)
- The provably total NP search problems of weak second order bounded arithmetic (Q639650) (← links)
- Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem (Q647334) (← links)
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
- P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
- A contribution to the end-extension problem and the \(\Pi_ 1\) conservativeness problem (Q685067) (← links)
- On the provability logic of bounded arithmetic (Q685071) (← links)
- Improving known solutions is hard (Q687508) (← links)
- Subsystems of true arithmetic and hierarchies of functions (Q688433) (← links)
- The unprovability of small inconsistency. A study of local and global interpretability (Q688510) (← links)
- Polynomial-time Martin-Löf type theory (Q688850) (← links)
- Faith \& falsity (Q705533) (← links)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem (Q731897) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Preservation theorems for bounded formulas (Q866887) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Generalized quantifier and a bounded arithmetic theory for LOGCFL (Q884960) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Cobham recursive set functions (Q904151) (← links)
- Exponentiation and second-order bounded arithmetic (Q922540) (← links)
- Tuples of disjoint \(\mathsf{NP}\)-sets (Q929286) (← links)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic (Q929293) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- The counting hierarchy in binary notation (Q1008842) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- Combinatorial principles in elementary number theory (Q1182430) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- A note on sharply bounded arithmetic (Q1325055) (← links)
- On the complexity of the parity argument and other inefficient proofs of existence (Q1329155) (← links)
- Separations of theories in weak bounded arithmetic (Q1344280) (← links)
- Toward the limits of the Tennenbaum phenomenon (Q1377555) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
