Is Cantor's theorem automatic?

MaRDI QIDQ3408148zbMATH OpenFDO

Authors Dietrich Kuske

Publication date 24 February 2010

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Computable structure theory, computable model theory (03C57) Total orders (06A05)

Recommendations

• Invariants of Automatic Presentations and Semi-synchronous Transductions
• Automatic Structures: Richness and Limitations
• Groups of automatic automorphisms of some automatic structures
• Autostability of automatic representations of well-orders and lower-rank linear orders
• The additive group of the rationals does not have an automatic presentation

Cited in

(6)

• Where automatic structures benefit from weighted automata
• Invariants of Automatic Presentations and Semi-synchronous Transductions
• The isomorphism problem for tree-automatic ordinals with addition
• Is Ramsey's theorem omega-automatic?
• The additive group of the rationals does not have an automatic presentation
• Learners based on transducers

This page was built for publication: Is Cantor's theorem automatic?

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