Ordinal recursive bounds for Higman's theorem
type: Item
instance of: scholarly article
title: Ordinal recursive bounds for Higman's theorem
zbMATH Open document ID: 0902.68100
DOI: 10.1016/S0304-3975(97)00009-1
author: E. A. Cichon
author: E. Tahhan-Bittar
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1190156
zbMATH Keywords: Higman's theorem
zbMATH Keywords: Hardy hierarchies
MaRDI profile type: Publication
cites work: A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
cites work: An ordinal calculus for proving termination in term rewriting
cites work: Q3874266
cites work: Q3695270
cites work: Ordinal complexity of recursive definitions
cites work: What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
cites work: Π12-logic, Part 1: Dilators
cites work: Q5629622
cites work: Q5538951
cites work: Accessible Independence Results for Peano Arithmetic
cites work: Q5533181
cites work: Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen
cites work: Rekursionszahlen und die Grzegorczyk-Hierarchie
cites work: Eine Klassifikation der ε0‐Rekursiven Funktionen
cites work: A classification of the ordinal recursive functions
cites work: Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy
full work available at URL: s0304-3975(97)00009-1
OpenAlex ID: W2014322000
description: scientific article; zbMATH DE number 1190156