Computer Science Logic
From MaRDI portal
Publication:5292638
DOI10.1007/b13224zbMath1116.03318OpenAlexW2623947920MaRDI QIDQ5292638
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Related Items (17)
Ceres in intuitionistic logic ⋮ Structure of proofs and the complexity of cut elimination ⋮ Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \) ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ The small‐is‐very‐small principle ⋮ Transductions in arithmetic ⋮ Interpretability degrees of finitely axiomatized sequential theories ⋮ The second incompleteness theorem and bounded interpretations ⋮ On the elimination of quantifier-free cuts ⋮ Extracting Herbrand disjunctions by functional interpretation ⋮ Faith \& falsity ⋮ A complexity analysis of functional interpretations ⋮ On the form of witness terms ⋮ Corrected upper bounds for free-cut elimination ⋮ The Interpretation Existence Lemma ⋮ The role of quantifier alternations in cut elimination ⋮ The arithmetics of a theory
This page was built for publication: Computer Science Logic
