scientific article; zbMATH DE number 1390277
collapsing functioncombinatorial principlesgraph minor theoremHercules-hydra gamehistory of proof theoryKripke-Platek set theoryoperator-controlled derivationsordinal analysisprovably recursive functionsramified set theorysurvey lecture
History of mathematics in the 20th century (01A60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Proof theory in general (including proof-theoretic semantics) (03F03) Recursive ordinals and ordinal notations (03F15) Second- and higher-order arithmetic and fragments (03F35)
- The strength of extensionality. I: Weak weak set theories with infinity
- Ordinal analysis by transformations
- A uniform approach for characterizing the provably total number-theoretic functions of KPM and (some of) its subsystems
- Provability algebras and proof-theoretic ordinals. I
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Primitive recursive analogues of regular cardinals based on ordinal representation systems for KPi and KPM
- Theories and ordinals in proof theory
- Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results
- Characterizations of ordinal analysis
- Wellfoundedness proof with the maximal distinguished set
- The good, the bad and the ugly: ordinal and symbolic whisky analysis
- On elementary theories of ordinal notation systems based on reflection principles
- Ordinal arithmetic with simultaneously defined theta-functions
- Sub-computabilities
- scientific article; zbMATH DE number 432700 (Why is no real title available?)
- Program size complexity of correction grammars in the Ershov hierarchy
- Ordinal analysis of intuitionistic power and exponentiation Kripke Platek set theory
- On Relating Theories: Proof-Theoretical Reduction
- Proofs, Programs and Abstract Complexity
- A decidable theory of type assignment
- Relativized ordinal analysis: the case of power Kripke-Platek set theory
- How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals
- Ordinal diagrams for Π3-reflection
- AN ORDINAL ANALYSIS OF ADMISSIBLE SET THEORY USING RECURSION ON ORDINAL NOTATIONS
- From Kruskal’s theorem to Friedman’s gap condition
- … and so on: Schütte on Naming Ordinals
- A Glimpse of $$ \sum_{3} $$-elementarity
- Zur Beweistheorie von KP+ $$ \varPi_{3} $$-Ref
- Reflection ranks and ordinal analysis
- A note on fragments of uniform reflection in second order arithmetic
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- A marriage of Brouwer's intuitionism and Hilbert's finitism. I: Arithmetic
- Predicativity and Feferman
- Normal forms for elementary patterns
- Theories and Ordinals: Ordinal Analysis
- A note on Bar Induction in Constructive Set Theory
- scientific article; zbMATH DE number 5057388 (Why is no real title available?)
- The Art of Measuring the Strength of Theories
- Locally hyperarithmetical induction
- Functorial Fast-Growing Hierarchies
- Mining the surface: witnessing the low complexity theorems of arithmetic
- The Π21\Pi ^1_2 consequences of a theory
- Witnessing flows in arithmetic
- Weak well orders and Fraïssé's conjecture
- Provable better-quasi-orders
- Very large set axioms over constructive set theories
- Automatic structures and the problem of natural well-orderings
- Reduction of higher type levels by means of an ordinal analysis of finite terms
- Proof-theoretic analysis of KPM
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934564)
