Functional trees and automorphisms of models

DOI10.1007/BF02260926zbMath0793.03037OpenAlexW2012572086MaRDI QIDQ1317640

Andrey S. Morozov

Publication date: 12 April 1994

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02260926

zbMATH Keywords

reducibilityrecursive modelautomorphisms of modelsfunctional treeshyperarithmetical automorphismsinfinite branchrigid models

Mathematics Subject Classification ID

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

Related Items (4)

On the isomorphism problem for some classes of computable algebraic structures ⋮ On computable automorphisms in formal concept analysis ⋮ Complexity of the isomorphism problem for computable free projective planes of finite rank ⋮ Countable structures with a fixed group of automorphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Regular elements in P. I.-rings
• Some examples in PI ring theory
• Rings of quotients of some semiprime. P.I. rings
• Rings with involution and chain conditions on bi-ideals
• Prime Rings Satisfying a Polynomial Identity
• Some results on the center of a ring with polynomial identity

This page was built for publication: Functional trees and automorphisms of models