The following pages link to (Q4215631):
Displayed 31 items.
- J-Calc: a typed lambda calculus for intuitionistic justification logic (Q276037) (← links)
- Strict finitism and the happy sorites (Q427227) (← links)
- A simple proof of Parsons' theorem (Q558443) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Independence results for variants of sharply bounded induction (Q716498) (← links)
- Preservation theorems for bounded formulas (Q866887) (← links)
- Integer factoring and modular square roots (Q896029) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- Harrington's conservation theorem redone (Q948908) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- The implicit commitment of arithmetical theories and its semantic core (Q2051133) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Partially definable forcing and bounded arithmetic (Q2257103) (← links)
- Truth, disjunction, and induction (Q2312097) (← links)
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) (Q2388433) (← links)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- Typical forcings, NP search problems and an extension of a theorem of Riis (Q2659102) (← links)
- Collapsing modular counting in bounded arithmetic and constant depth propositional proofs (Q2944908) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- The strength of sharply bounded induction (Q3418091) (← links)
- A note on the Σ<sub>1</sub>collection scheme and fragments of bounded arithmetic (Q3552388) (← links)
- On the correspondence between arithmetic theories and propositional proof systems – a survey (Q3619867) (← links)
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS (Q4959663) (← links)
- (Q5014441) (← links)
- Parity Games and Propositional Proofs (Q5169973) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
- Mining the surface: witnessing the low complexity theorems of arithmetic (Q6160756) (← links)