The following pages link to Proof theory. An introduction (Q1801306):
Displaying 50 items.
- Phase transition results for three Ramsey-like theorems (Q286698) (← links)
- Correia semantics revisited (Q300562) (← links)
- Proof complexity and textual cohesion (Q302177) (← links)
- An order-theoretic characterization of the Howard-Bachmann-hierarchy (Q512137) (← links)
- Simplified collapsing functions and their applications (Q687397) (← links)
- Type-theoretic interpretation of iterated, strictly positive inductive definitions (Q688845) (← links)
- Syntactic cut-elimination for a fragment of the modal mu-calculus (Q714717) (← links)
- Proof-theoretic analysis of KPM (Q803124) (← links)
- The Bachmann-Howard structure in terms of \(\Sigma_1\)-elementarity (Q850804) (← links)
- Ordinal arithmetic based on Skolem hulling (Q866560) (← links)
- Ordinal notations based on a weakly Mahlo cardinal (Q920986) (← links)
- Proof theory. The first step into impredicativity (Q930618) (← links)
- Harmonious logic: Craig's interpolation theorem and its descendants (Q1024116) (← links)
- Syntactic cut-elimination for common knowledge (Q1024553) (← links)
- Reverse mathematics and well-ordering principles: a pilot study (Q1032626) (← links)
- Proof theory. 2nd ed (Q1086559) (← links)
- Proof theory of reflection (Q1332853) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- Lengths of developments in \(K((G))\) (Q1726002) (← links)
- Notations for exponentiation. (Q1853509) (← links)
- Ordinal notations and well-orderings in bounded arithmetic (Q1861331) (← links)
- Mathematical proof theory in the light of ordinal analysis (Q1868167) (← links)
- Second order theories with ordinals and elementary comprehension (Q1908814) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- From single agent to multi-agent via hypersequents (Q2392010) (← links)
- On the relationship between fixed points and iteration in admissible set theory without foundation (Q2486984) (← links)
- Ideas in the epsilon substitution method for \(\Pi_{1}^{0}\)-FIX (Q2566062) (← links)
- Remarks on applicative theories (Q2566067) (← links)
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results (Q2566073) (← links)
- Independence of Ramsey theorem variants using \(\varepsilon _0\) (Q2789881) (← links)
- A Logical Introduction to Proof (Q2881334) (← links)
- Strong WQO Tree Theorems (Q3295147) (← links)
- Well Quasi-orderings and Roots of Polynomials in a Hahn Field (Q3295148) (← links)
- An Introduction to Proofs with Set Theory (Q3295304) (← links)
- The Proof Theory of Common Knowledge (Q3299587) (← links)
- Introduction: Mathesis Universalis, Proof and Computation (Q3305623) (← links)
- (Q3467531) (← links)
- (Q4370352) (← links)
- Intuitionistic Fixed Point Theories for Strictly Positive Operators (Q4531084) (← links)
- An unexpected separation result in Linearly Bounded Arithmetic (Q4666949) (← links)
- Factorization in generalized power series (Q4699622) (← links)
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa (Q4897040) (← links)
- Syntactic Cut-elimination for Common Knowledge (Q4982123) (← links)
- Theoremus (Q4990024) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
- Well-Ordering Principles in Proof Theory and Reverse Mathematics (Q5055281) (← links)
- Monomial ideals and independence of (Q5108088) (← links)
- Proofs 101 (Q5113825) (← links)
- (Q5389161) (← links)
