Permutations and implicit definability

DOI10.1007/BF01978299zbMath0667.03026OpenAlexW2017835805MaRDI QIDQ1117217

Andrey S. Morozov

Publication date: 1988

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

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

zbMATH Keywords

permutation groupsimplicit definabilityTuring degree

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Permutation groups (20B99)

Related Items (6)

Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra ⋮ Families of permutations and ideals of Turing degrees ⋮ The Lattice of Computably Enumerable Vector Spaces ⋮ Turing degrees and automorphism groups of substructure lattices ⋮ Turing reducibility as algebraic embeddability ⋮ On computable automorphisms of the rational numbers

Cites Work

• First order theory of permutation groups
• On elementary types of symmetric groups
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Permutations and implicit definability