Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator)

DOI10.1007/BF01620619zbMath0701.03028OpenAlexW2166839723MaRDI QIDQ913788

V. Michele Abrusci

Publication date: 1989

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01620619

zbMATH Keywords

\(\Pi ^ 1_ 2\)-logiccombinatorial theoremdecreasing F-sequencesstrictly mathematical statements about natural numbersVeblen hierarchyweakly finite dilator

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Recursive ordinals and ordinal notations (03F15)

Related Items (2)

Rekursion über Dilatoren und die Bachmann-Hierarchie. (Recursion over dilators and the Bachmann hierarchy) ⋮ Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functors and ordinal notations. I: A functorial construction of the veblen hierarchy
• Π12-logic, Part 1: Dilators
• Accessible Independence Results for Peano Arithmetic

This page was built for publication: Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator)