Decidability and definability results related to the elementary theory of ordinal multiplication

DOI10.4064/fm171-3-1zbMath0998.03005OpenAlexW1996405609MaRDI QIDQ2773366

Alexis Bès

Publication date: 21 February 2002

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm171-3-1

zbMATH Keywords

decidability of ordinal multiplication

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Ordinal and cardinal numbers (03E10)

Related Items

Arithmetical algorithms for elementary patterns, Decision Procedures for Multisets with Cardinality Constraints, REASONING ABOUT TRANSFINITE SEQUENCES