Functorial Fast-Growing Hierarchies
From MaRDI portal
Publication:6148467
DOI10.1017/fms.2023.128arXiv2201.04536OpenAlexW4391259873MaRDI QIDQ6148467
Andreas Weiermann, Juan P. Aguilera, Fedor N. Pakhomov
Publication date: 7 February 2024
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04536
Foundations of classical theories (including reverse mathematics) (03B30) Second- and higher-order arithmetic and fragments (03F35) Preorders, orders, domains and lattices (viewed as categories) (18B35) Recursive ordinals and ordinal notations (03F15) Foundations, relations to logic and deductive systems (18A15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reverse mathematics and well-ordering principles: a pilot study
- An independence result for \((\Pi^ 1_ 1-CA)+BI\)
- Reverse mathematics and ordinal exponentiation
- Ackermann and Goodstein go functorial
- \(\Pi_1^1\)-comprehension as a well-ordering principle
- The Veblen functions for computability theorists
- Mathematics and Computer Science: Coping with Finiteness
- Π12-logic, Part 1: Dilators
- A Uniform Approach to Fundamental Sequences and Hierarchies
- Accessible Recursive Functions
- Well-Ordering Principles and Bar Induction
- Ramsey's Theorem for n-Parameter Sets
- Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
- On the interpretation of non-finitist proofs–Part II
- Long finite sequences
This page was built for publication: Functorial Fast-Growing Hierarchies
