Trees, ordinals and termination

DOI10.1007/3-540-56610-4_68zbMATH Open1497.68140OpenAlexW1867700116MaRDI QIDQ5044740FDOQ5044740

Authors: Nachum Dershowitz 

Publication date: 2 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56610-4_68

Recommendations

• New Computational Paradigms
• Algorithms for ordinal arithmetic.
• Ordinal arithmetic: Algorithms and mechanization
• Hydra Games and Tree Ordinals
• scientific article; zbMATH DE number 4158596

Mathematics Subject Classification ID

Data structures (68P05) Ordinal and cardinal numbers (03E10)

Cites Work

• Title not available (Why is that?)
• Proving termination with multiset orderings
• Orderings for term-rewriting systems
• Termination of rewriting
• Accessible Independence Results for Peano Arithmetic
• Title not available (Why is that?)
• Built-up systems of fundamental sequences and hierarchies of number-theoretic functions
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Title not available (Why is that?)
• Note on a proof of the extended Kirby-Paris theorem on labelled finite trees

Cited In (8)

• Title not available (Why is that?)
• Type-theoretic approaches to ordinals
• Title not available (Why is that?)
• New Computational Paradigms
• Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees
• More problems in rewriting
• Title not available (Why is that?)
• Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations

This page was built for publication: Trees, ordinals and termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044740)