The following pages link to Handbook of proof theory (Q1264579):
Displaying 50 items.
- A note on typed truth and consistency assertions (Q263089) (← links)
- Logic of negation-complete interactive proofs (formal theory of epistemic deciders) (Q276034) (← links)
- Phase transition results for three Ramsey-like theorems (Q286698) (← links)
- Socratic trees (Q383562) (← links)
- Proof theory and mathematical meaning of paraconsistent C-systems (Q420832) (← links)
- 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 (Q458460) (← links)
- A complexity analysis of functional interpretations (Q557798) (← links)
- The eskolemization of universal quantifiers (Q638487) (← links)
- The Hydra battle and Cichon's principle (Q734036) (← links)
- Problems in epistemic space (Q742481) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- Mathematical method and proof (Q857692) (← links)
- Uniform interpolation and propositional quantifiers in modal logics (Q878154) (← links)
- Hybrids of the \({}^ \times \)-translation for \(\mathsf{CZF}^{\omega}\) (Q946579) (← links)
- Parameter-free polymorphic types (Q958481) (← links)
- Inferentializing semantics (Q975776) (← links)
- The metamathematics of ergodic theory (Q1006602) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Functional interpretation of Aczel's constructive set theory (Q1577478) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- Truth, partial logic and infinitary proof systems (Q1653651) (← links)
- Keeping logic in the trivium of computer science: a teaching perspective (Q1696593) (← links)
- Skolemization and Herbrand theorems for lattice-valued logics (Q1733060) (← links)
- Saturated models of universal theories (Q1861531) (← links)
- Reasoning processes in propositional logic (Q1959223) (← links)
- Things that can and things that cannot be done in PRA (Q1971796) (← links)
- Computer says no: verdict explainability for runtime monitors using a local proof system (Q1996872) (← links)
- A note on the unprovability of consistency in formal theories of truth (Q2056216) (← links)
- Integrating induction and coinduction via closure operators and proof cycles (Q2096458) (← links)
- On induction principles for partial orders (Q2169127) (← links)
- The content of deduction (Q2377192) (← links)
- Gentzen's consistency proof without heightlines (Q2377348) (← links)
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory (Q2514846) (← links)
- On the strength of Ramsey's theorem for pairs (Q2732267) (← links)
- Independence of Ramsey theorem variants using $\varepsilon _0$ (Q2789881) (← links)
- FROM STENIUS’ CONSISTENCY PROOF TO SCHÜTTE’S CUT ELIMINATION FOR <i>ω</i>-ARITHMETIC (Q2804471) (← links)
- A Classical Propositional Logic for Reasoning About Reversible Logic Circuits (Q2820684) (← links)
- Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation (Q2946739) (← links)
- Craig Interpolation in Displayable Logics (Q3010362) (← links)
- Formalizing non-standard arguments in second-order arithmetic (Q3066789) (← links)
- Euler characteristics for strongly minimal groups and the eq-expansions of vector spaces (Q3083137) (← links)
- More on Systems of Truth and Predicative Comprehension (Q3295826) (← links)
- Local stability of ergodic averages (Q3402200) (← links)
- On Skolemization in constructive theories (Q3617374) (← links)
- (Q4575567) (← links)
- ON WEIHRAUCH REDUCIBILITY AND INTUITIONISTIC REVERSE MATHEMATICS (Q4600462) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Simulation of Natural Deduction and Gentzen Sequent Calculus (Q4683217) (← links)
- TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY (Q4692072) (← links)
