Handbook of proof theory
From MaRDI portal
Publication:1264579
zbMath0898.03001MaRDI QIDQ1264579
No author found.
Publication date: 30 September 1998
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Collections of articles of miscellaneous specific interest (00B15) Proof theory in general (including proof-theoretic semantics) (03F03) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations (03-00)
Related Items (67)
Logic of negation-complete interactive proofs (formal theory of epistemic deciders) ⋮ Phase transition results for three Ramsey-like theorems ⋮ The content of deduction ⋮ The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem ⋮ Gentzen's consistency proof without heightlines ⋮ Optimal length resolution refutations of difference constraint systems ⋮ Unnamed Item ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Strong Logics of First and Second Order ⋮ Mathematical method and proof ⋮ Truth, partial logic and infinitary proof systems ⋮ On induction principles for partial orders ⋮ Uniform interpolation and propositional quantifiers in modal logics ⋮ Socratic trees ⋮ Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation ⋮ SELF-REFERENCE UPFRONT: A STUDY OF SELF-REFERENTIAL GÖDEL NUMBERINGS ⋮ Internal categoricity, truth and determinacy ⋮ On the algebraization of Henkin‐type second‐order logic ⋮ Experiments with automated reasoning in the class ⋮ Monomial ideals and independence of ⋮ Models of Bounded Arithmetic Theories and Some Related Complexity Questions ⋮ Keeping logic in the trivium of computer science: a teaching perspective ⋮ Proof theory and mathematical meaning of paraconsistent C-systems ⋮ ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS ⋮ Herbrand complexity and the epsilon calculus with equality ⋮ Unnamed Item ⋮ The eskolemization of universal quantifiers ⋮ Reasoning processes in propositional logic ⋮ Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications ⋮ Things that can and things that cannot be done in PRA ⋮ More on Systems of Truth and Predicative Comprehension ⋮ Skolemization and Herbrand theorems for lattice-valued logics ⋮ On the strength of Ramsey's theorem for pairs ⋮ Hybrids of the \({}^ \times \)-translation for \(\mathsf{CZF}^{\omega}\) ⋮ Craig Interpolation in Displayable Logics ⋮ Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss ⋮ Parameter-free polymorphic types ⋮ Computer says no: verdict explainability for runtime monitors using a local proof system ⋮ A constructive interpretation of Ramsey's theorem via the product of selection functions ⋮ INTUITIONISTIC EPISTEMIC LOGIC ⋮ Inferentializing semantics ⋮ A complexity analysis of functional interpretations ⋮ Simulation of Natural Deduction and Gentzen Sequent Calculus ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ Interpretability over peano arithmetic ⋮ On uniform weak König's lemma ⋮ TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY ⋮ Formalizing non-standard arguments in second-order arithmetic ⋮ Unnamed Item ⋮ The Hydra battle and Cichon's principle ⋮ Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory ⋮ On Skolemization in constructive theories ⋮ FROM STENIUS’ CONSISTENCY PROOF TO SCHÜTTE’S CUT ELIMINATION FOR ω-ARITHMETIC ⋮ The metamathematics of ergodic theory ⋮ Prawitz, Proofs, and Meaning ⋮ Problems in epistemic space ⋮ Euler characteristics for strongly minimal groups and the eq-expansions of vector spaces ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ A note on the unprovability of consistency in formal theories of truth ⋮ A Classical Propositional Logic for Reasoning About Reversible Logic Circuits ⋮ From Hilbert's program to a logic tool box ⋮ Local stability of ergodic averages ⋮ Functional interpretation of Aczel's constructive set theory ⋮ Integrating induction and coinduction via closure operators and proof cycles ⋮ Saturated models of universal theories ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics ⋮ A note on typed truth and consistency assertions
This page was built for publication: Handbook of proof theory
