The ordinal generated by an ordinal grammar is computable
From MaRDI portal
Publication:2326394
DOI10.1016/j.tcs.2019.04.016zbMath1430.68135arXiv1811.03595OpenAlexW2962686841MaRDI QIDQ2326394
Publication date: 7 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.03595
algebraic ordinalsisomorphism of algebraic well-orderingsordinal grammarsparametric fixed-point equations over ordinals
Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Ordinal and cardinal numbers (03E10)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mezei-Wright theorem for categorical algebras
- Fundamental properties of infinite trees
- The equational theory of regular words
- An undecidable property of context-free linear orders
- Isomorphism of regular trees and words
- The FC-rank of a context-free language
- Isomorphisms of scattered automatic linear orders
- Hausdorff Rank of Scattered Context-Free Linear Orders
- ALGEBRAIC LINEAR ORDERINGS
- Regular and Algebraic Words and Ordinals
- On frontiers of regular trees
- Algebraic Ordinals
- Scattered Context-Free Linear Orderings
- Automatic linear orders and trees
- Shuffling Ordinals and Transfinite Dimension
- Long words: The theory of concatenation and \(\omega\)-power
This page was built for publication: The ordinal generated by an ordinal grammar is computable