scientific article; zbMATH DE number 3217001
From MaRDI portal
Publication:5344167
Cited in
(14)- A Note on (Meta)predicative Wellordering Proofs
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
- Syntactical truth predicates for second order arithmetic
- Minimal bad sequences are necessary for a uniform Kruskal theorem
- Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
- Reminiscences of Kurt Schütte
- Lorenzen and constructive mathematics
- The Limits of Predicativity Revisited
- The prehistory of the subsystems of second-order arithmetic
- Error and predicativity
- Termination of rewriting
- Proof theoretic analysis by iterated reflection
- Predicativity and Feferman
- Well-partial orderings and their maximal order types
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 Q5344167)