Set recursion and \(\Pi ^ 1_ 2\)-logic

DOI10.1016/0168-0072(85)90017-XzbMath0575.03034OpenAlexW2046445497MaRDI QIDQ1063591

Dag Normann, Jean-Yves Girard

Publication date: 1985

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(85)90017-x

zbMATH Keywords

decompositioninductiondefinable ordinal functionsdenotation systemsdilatorpi-one-two logic

Mathematics Subject Classification ID

Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (9)

Large cardinals and large dilators ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Induktive Definitionen und Dilatoren. (Inductive definitions and dilators) ⋮ Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy) ⋮ Functorial bounds for cut elimination inL βω . I ⋮ Embeddability of ptykes ⋮ Locally hyperarithmetical induction ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Les premiers recursivement inaccessible et Mahlo et la theorie des dilatateurs
• Recursive Functionals and Quantifiers of Finite Types I
• Π12-logic, Part 1: Dilators
• Hyperanalytic Predicates

This page was built for publication: Set recursion and \(\Pi ^ 1_ 2\)-logic