The following pages link to Computer Science Logic (Q5292638):
Displaying 25 items.
- The second incompleteness theorem and bounded interpretations (Q454368) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- On the elimination of quantifier-free cuts (Q650922) (← links)
- Faith \& falsity (Q705533) (← links)
- Corrected upper bounds for free-cut elimination (Q719283) (← links)
- Transductions in arithmetic (Q904144) (← links)
- On the form of witness terms (Q982183) (← links)
- Algebraic aspects of cut elimination (Q1770974) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) (Q2144618) (← links)
- The arithmetics of a theory (Q2345393) (← links)
- Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination (Q2350976) (← links)
- Ceres in intuitionistic logic (Q2363201) (← links)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) (Q2400502) (← links)
- Interpretability degrees of finitely axiomatized sequential theories (Q2436609) (← links)
- Sufficient conditions for cut elimination with complexity analysis (Q2461191) (← links)
- Extracting Herbrand disjunctions by functional interpretation (Q2486989) (← links)
- The role of quantifier alternations in cut elimination (Q2565988) (← links)
- Sharpened lower bounds for cut elimination (Q2892684) (← links)
- (Q4601841) (← links)
- Cut-Elimination for SBL (Q5013907) (← links)
- The small‐is‐very‐small principle (Q5108874) (← links)
- The Interpretation Existence Lemma (Q5214783) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
