scientific article; zbMATH DE number 2087209

MaRDI QIDQ4737892zbMATH OpenFDO

Authors Christian Choffrut

Publication date 11 August 2004

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

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Ehrenfeucht games and ordinal addition
• Decidability and definability results related to the elementary theory of ordinal multiplication
• scientific article; zbMATH DE number 3884139 (Why is no real title available?)
• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• Tree Automata Make Ordinal Theory Easy
• Exact complexity bounds for ordinal addition
• Test sets for equality of terms in the additive structure of ordinals augmented with right multiplication by

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)