Autostability of automatic representations of well-orders and lower-rank linear orders

MaRDI QIDQ2885281zbMATH OpenFDO

Authors A. A. Revenko

Publication date 21 May 2012

Published in Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)

zbMATH Keywords

finite automatawell-ordered setautomatic representation of structures

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• The index set of linear orderings that are autostable relative to strong constructivizations
• Autostability and extensions of constructivizations
• Degrees of autostability for linear orders and linearly ordered abelian groups
• On the representability degrees of linear orders
• Degrees of autostability relative to strong constructivizations
• Automorphisms of \(\eta\)-like computable linear orderings and Kierstead's conjecture
• scientific article; zbMATH DE number 635804
• Degrees of autostability relative to strong constructivizations for Boolean algebras
• Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
• Automata on ordinals and automaticity of linear orders

Cited in

(6)

• Scott rank of automatic partial orders
• On automatic and decidable linear orderings
• Is Cantor's theorem automatic?
• Degrees of autostability for linear orders and linearly ordered abelian groups
• Automatic linear orders and trees
• The rank of tree-automatic linear orderings

This page was built for publication: Autostability of automatic representations of well-orders and lower-rank linear orders

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