On automatic and decidable linear orderings

zbMATH Open1329.03071MaRDI QIDQ890799FDOQ890799

Authors: Aleksandra Anatol'evna Gavryushkina 

Publication date: 16 November 2015

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v7/p100-110.pdf

Recommendations

• Automatic linear orders and trees
• Autostability of automatic representations of well-orders and lower-rank linear orders
• Word automaticity of tree automatic scattered linear orderings is decidable
• An undecidable linear order that is \(n\)-decidable for all \(n\)
• scientific article; zbMATH DE number 1163934

zbMATH Keywords

computable categoricitylinear orderingautomatic structuredecidable structure

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Total orders (06A05)

Cited In (2)

• Automata on ordinals and automaticity of linear orders
• An undecidable linear order that is \(n\)-decidable for all \(n\)

This page was built for publication: On automatic and decidable linear orderings

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