Computer Science Logic
From MaRDI portal
Publication:5292638
DOI10.1007/b13224zbMath1116.03318MaRDI 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
The small‐is‐very‐small principle, The Interpretation Existence Lemma, The second incompleteness theorem and bounded interpretations, A complexity analysis of functional interpretations, On the elimination of quantifier-free cuts, Faith \& falsity, Corrected upper bounds for free-cut elimination, Transductions in arithmetic, On the form of witness terms, Efficient elimination of Skolem functions in \(\text{LK}^\text{h} \), The arithmetics of a theory, Ceres in intuitionistic logic, Structure of proofs and the complexity of cut elimination, Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\), Interpretability degrees of finitely axiomatized sequential theories, Extracting Herbrand disjunctions by functional interpretation, The role of quantifier alternations in cut elimination