On computable presentations of some functional lattices

DOI10.1016/J.JLAP.2009.02.001zbMath1186.03059OpenAlexW1975163874MaRDI QIDQ1044671

Andrey S. Morozov

Publication date: 18 December 2009

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2009.02.001

zbMATH Keywords

lattice-ordered groupcomputable modelcomputable presentationrecursive modelcomputable automorphismsfunctional lattice

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Group \(Aut_ r<Q,\leq >\) is not constructivizable
• Turing reducibility as algebraic embeddability
• On computable automorphisms of the rational numbers
• The categoricity of the group of all computable automorphisms of the rational numbers

This page was built for publication: On computable presentations of some functional lattices