scientific article; zbMATH DE number 4039890
The two principal `unifying' elements meant in the title go back to the sixties. First, the bulk of the kind of mathematics (more precisely, of its set-theoretic transcriptions) considered in hackneyed proof theory holds in theories for admissible sets. In fact, this is implicit in - for example, von Neumann's - work in the twenties, where functions instead of classes are used as primitives (so that definition by recursion corresponds to \(\Sigma_ 1\)-replacement). Secondly, the methods used for hackneyed proof-theoretic results, familiar from predicate logic and extended to formal arithmetic by use of proof trees of ordinal \(<\epsilon_ 0\), extend further by means of suitable ordinal structures; in fancy language, functors in the category of orderings with order- preserving maps; especially, when the systems considered are interpreted in ramified hierarchies. `Hackneyed' means that the results refer only to provability, not to structural properties of proofs, and so are usually marginal refinements of corresponding model-theoretic work. But granted this limitation of the subject, the exposition is most efficient; both professional and not too dense, hence easy to leaf through; in short, perfect for readers with a mature understanding of the subject and wanting a precis of an earlier stage. But for others almost the reverse is true. Without exaggeration the book gives a less adequate idea of the potential either of (i) the notion of admissible set or (ii) of - methods developed under the heading - proof theory than the writings of the pioneers some 20 years ago. Samples: (i) analysis of priority arguments in degree theory in terms of admissible segments of well-founded orderings (instead of less familiar non-standard models); (ii) use of the ordinal machinery for lower bounds on realizations of \(\forall \exists\) theorems (without dragging in formal systems to which all \(\Pi^ 0_ 1\) theorems are added as axioms). For the observer of the broader mathematical scene it may be of interest to trace the author's narrow conception of the subject back to a logical tradition, and not merely to contingencies: a superficial meaning of `unification' in contrast to such discoveries as, say, of the zeta- function long before logical foundations, let alone, to developments in this century, which have contributed to unification in a realistic sense in the theory of prime numbers, resp. in wider branches of mathematics. Glib slogans about the principle of economy, which is called `parsimony' on p. 3(2), obscure such achievements, besides being literally wrong. Simply ignoring the question which axioms of set theory are used in a piece of mathematics is a better bargain than verifying that they hold for admissibles as long as the pay-off for the latter consists in the kind of unification provided here.
- Patterns of resemblance of order 2
- Full operational set theory with unbounded existential quantification and power set
- Fixed points in Peano arithmetic with ordinals
- Proof theory of reflection
- On the proof-theoretic strength of monotone induction in explicit mathematics
- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice
- The non-constructive operator, fixed point theories with ordinals, and the bar rule
- Inaccessible set axioms may have little consistency strength
- Epsilon substitution for \(ID_1\) via cut-elimination
- Understanding uniformity in Feferman's explicit mathematics
- Patterns of resemblance and Bachmann-Howard fixed points
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- Proof theory and ordinal analysis
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- On Feferman's operational set theory \textsf{OST}
- On the relationship between fixed points and iteration in admissible set theory without foundation
- Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory
- Reflections on reflections in explicit mathematics
- A few more dissimilarities between second-order arithmetic and set theory
- Wellfoundedness proof with the maximal distinguished set
- Interpreting classical theories in constructive ones
- First order theories for nonmonotone inductive definitions: Recursively inaccessible and Mahlo
- Analysis of a double Kruskal theorem
- Ordinal analysis of intuitionistic power and exponentiation Kripke Platek set theory
- The Operational Perspective: Three Routes
- From subsystems of analysis to subsystems of set theory
- scientific article; zbMATH DE number 5165178 (Why is no real title available?)
- Functional interpretation and inductive definitions
- scientific article; zbMATH DE number 4070892 (Why is no real title available?)
- Operational closure and stability
- The role of parameters in bar rule and bar induction
- Explicit mathematics with the monotone fixed point principle. II: Models
- scientific article; zbMATH DE number 733387 (Why is no real title available?)
- A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP
- The Recursively Mahlo Property in Second Order Arithmetic
- On power set in explicit mathematics
- Pure Proof Theory Aims, Methods and Results: Extended Version of Talks Given at Oberwolfach and Haifa
- Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$
- An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe
- Computable aspects of the Bachmann-Howard principle
- Iterated inductive definitions revisited
- Proof theory of constructive systems: inductive types and univalence
- Admissible Sets and Structures
- Relativizing operational set theory
- On the relationship between ATR0 and
- Presentations of structures in admissible sets
- Elementary patterns of resemblance
- Universes in explicit mathematics
- Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms
- Well ordering principles for iterated \(\Pi^1_1\)-comprehension
- Admissible closures of polynomial time computable arithmetic
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\).
- Some set-theoretic reduction principles
- Induction on dilators and Bachmann-Howard fixed points
- The total set-recursive functions of \textsf{KPI} and related systems
- Proof-theoretic analysis of KPM
- A logic of abstraction related to finite constructive number classes
- Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions
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 Q3778746)