scientific article; zbMATH DE number 2087209

zbMATH Open1073.03005MaRDI QIDQ4737892FDOQ4737892

Christian Choffrut

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2295/22950015.htm

Title of this publication is not available (Why is that?)

Recommendations

• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• Decidability and definability results related to the elementary theory of ordinal multiplication
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• Exact complexity bounds for ordinal addition
• scientific article; zbMATH DE number 1086492

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (3)

• Decidability and definability results related to the elementary theory of ordinal multiplication
• Title not available (Why is that?)
• Tree Automata Make Ordinal Theory Easy

This page was built for publication:

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