Π12-logic, Part 1: Dilators
From MaRDI portal
Publication:3960844
DOI10.1016/0003-4843(81)90016-4zbMath0496.03037OpenAlexW1980969069WikidataQ59409084 ScholiaQ59409084MaRDI QIDQ3960844
Publication date: 1981
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(81)90016-4
proof theoryfunctorinductionglobal complexitydirect limitsordinalsdenotation systemspi-one-two-logicdecomposition of a dilator into a well orderdirected systems of finite objects
Descriptive set theory (03E15) Categorical logic, topoi (03G30) Computability and recursion theory (03D99) Recursive ordinals and ordinal notations (03F15) Ordinal and cardinal numbers (03E10)
Related Items (73)
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study ⋮ Large cardinals and large dilators ⋮ Minimal bad sequences are necessary for a uniform Kruskal theorem ⋮ Interpreting higher computations as types with totality ⋮ Equational derivation vs. computation ⋮ Functorial bounds for cut elimination inL βω . II ⋮ Open Questions in Reverse Mathematics ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Induktive Definitionen und Dilatoren. (Inductive definitions and dilators) ⋮ Another extension of Van de Wiele's theorem ⋮ Normal functors, power series and \(\lambda\)-calculus ⋮ Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones ⋮ Some uses of dilators in combinatorial problems. II ⋮ Slow growing versus fast growing ⋮ Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy) ⋮ A topos-theorist looks at dilators ⋮ Boundedness theorems for flowers and sharps ⋮ On Wainer's notation for a minimal subrecursive inaccessible ordinal ⋮ Ordinal recursive bounds for Higman's theorem ⋮ Functors and ordinal notations. IV: The Howard ordinal and the functor ∧. ⋮ Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs ⋮ Functorial bounds for cut elimination inL βω . I ⋮ Reducing ω-model reflection to iterated syntactic reflection ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ Embeddability of ptykes ⋮ A note on ordinal exponentiation and derivatives of normal functions ⋮ Locally hyperarithmetical induction ⋮ PREDICATIVE COLLAPSING PRINCIPLES ⋮ Bachmann-Howard derivatives ⋮ Natural well-orderings ⋮ Functorial Fast-Growing Hierarchies ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ Set-theoretic reflection is equivalent to induction over well-founded classes ⋮ Computable aspects of the Bachmann–Howard principle ⋮ Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator) ⋮ An algebraic approach to stable domains ⋮ Derivatives of normal functions in reverse mathematics ⋮ Intuitionistic sets and ordinals ⋮ Boundedness theorems for dilators and ptykes ⋮ A strong boundedness theorem for dilators ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Finite presentability of strongly finite dilators ⋮ HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS? ⋮ Ackermann and Goodstein go functorial ⋮ Term rewriting theory for the primitive recursive functions ⋮ Proof systems for infinite behaviours ⋮ Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium) ⋮ Bounded linear logic: A modular approach to polynomial-time computability ⋮ WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY ⋮ Some interesting connections between the slow growing hierarchy and the Ackermann function ⋮ A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets ⋮ A stable programming language ⋮ \(\Pi_1^1\)-comprehension as a well-ordering principle ⋮ Accessible Recursive Functions ⋮ Proof theory and ordinal analysis ⋮ Two applications of analytic functors ⋮ A categorical construction of Bachmann–Howard fixed points ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ A logic of recursion ⋮ \(\Pi_ 2^ 1\)-logic and uniformization in the analytical hierarchy ⋮ Ordinals. II: Some applications and a functorial approach ⋮ Patterns of resemblance and Bachmann-Howard fixed points ⋮ Introduction to \(\Pi^1_2\)-logic ⋮ Inductive definitions over a predicative arithmetic ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ … and so on: Schütte on Naming Ordinals ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Set recursion and \(\Pi ^ 1_ 2\)-logic ⋮ Rungs and trees ⋮ Functors and ordinal notations. I: A functorial construction of the veblen hierarchy ⋮ Functors and ordinal notations. II: A functorial construction of the Bachmann hierarchy ⋮ A proof-theoretical analysis of ptykes ⋮ An ordinal calculus for proving termination in term rewriting
This page was built for publication: Π12-logic, Part 1: Dilators
