The following pages link to Proof theory. 2nd ed (Q1086559):
Displaying 50 items.
- Ordinal notation systems corresponding to Friedman's linearized well-partial-orders with gap-condition (Q2402963) (← links)
- Herbrand's theorem and term induction (Q2491080) (← links)
- A generalization of the second incompleteness theorem and some exceptions to it (Q2500470) (← links)
- Ackermann's substitution method (remixed) (Q2503393) (← links)
- The Skolemization of existential quantifiers in intuitionistic logic (Q2503404) (← links)
- How many times do we need an assumption to prove a tautology in minimal logic? Examples on the compression power of classical reasoning (Q2520659) (← links)
- Controlling witnesses (Q2566063) (← links)
- Herbrand analyses (Q2641297) (← links)
- Lifting proofs from countable to uncountable mathematics (Q2672667) (← links)
- The laws of thought and the laws of truth as two sides of one coin (Q2686096) (← links)
- Notes on models of (partial) Kripke-Feferman truth (Q2699016) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- A Conservation Result Concerning Bounded Theories and the Collection Axiom (Q3029007) (← links)
- Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic (Q3035687) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- More on Systems of Truth and Predicative Comprehension (Q3295826) (← links)
- On the Set-Generic Multiverse (Q3305408) (← links)
- On Relating Theories: Proof-Theoretical Reduction (Q3305638) (← links)
- Cut-Elimination and Proof Schemata (Q3455184) (← links)
- (Q3589379) (← links)
- (Q4014783) (← links)
- Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss (Q4646655) (← links)
- Structural proof theory for first-order weak Kleene logics (Q4995622) (← links)
- … and so on: Schütte on Naming Ordinals (Q5013893) (← links)
- Cut-Elimination for SBL (Q5013907) (← links)
- Normalization Proof for Derivations in PA after P. Cohen (Q5013909) (← links)
- Geometric Rules in Infinitary Logic (Q5020172) (← links)
- THE ELIMINATION OF ATOMIC CUTS AND THE SEMISHORTENING PROPERTY FOR GENTZEN’S SEQUENT CALCULUS WITH EQUALITY (Q5027662) (← links)
- A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH (Q5046601) (← links)
- A NOTE ON THE SEQUENT CALCULI (Q5078820) (← links)
- Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741) (← links)
- THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY (Q5085858) (← links)
- THE LARGE STRUCTURES OF GROTHENDIECK FOUNDED ON FINITE-ORDER ARITHMETIC (Q5107535) (← links)
- A new application for explanation-based generalisation within automated deduction (Q5210770) (← links)
- A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal (Q5214782) (← links)
- Predicativity and Feferman (Q5214793) (← links)
- PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS (Q5216971) (← links)
- Informational logic for automated reasoning (Q5236445) (← links)
- EQUIVALENCES FOR TRUTH PREDICATES (Q5274881) (← links)
- THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC (Q5274882) (← links)
- LINEAR TIME IN HYPERSEQUENT FRAMEWORK (Q5346691) (← links)
- GENERALITY AND EXISTENCE 1: QUANTIFICATION AND FREE LOGIC (Q5381029) (← links)
- Improved witnessing and local improvement principles for second-order bounded arithmetic (Q5410329) (← links)
- , , AND REINHARDT’S PROGRAM (Q5880422) (← links)
- Dialogues and Proofs; Yankov’s Contribution to Proof Theory (Q5886456) (← links)
- Cut-elimination and redundancy-elimination by resolution (Q5927981) (← links)
- Elementary patterns of resemblance (Q5935985) (← links)
- An open formalism against incompleteness (Q5937853) (← links)
- Asymptotic cyclic expansion and bridge groups of formal proofs (Q5945614) (← links)
- NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE (Q6041345) (← links)
