Extensions of arithmetic for proving termination of computations

DOI10.2307/2274742zbMath0683.03037OpenAlexW2168420831MaRDI QIDQ4732468

Bernard R. Hodgson, Clement F. Kent

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274742

zbMATH Keywords

Goodstein sequenceprovably recursive function\(\Sigma\)- reflectionGoodstein predecessorprovable ordinals

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Related Items

A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems, Termination of rewriting, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

Cites Work

• Termination of rewriting
• Proving termination with multiset orderings
• Accessible Independence Results for Peano Arithmetic
• Unnamed Item
• Unnamed Item