Computable permutations and word problems

DOI10.4171/LEM/64-1/2-6MaRDI QIDQ2314871zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 30 July 2019

Published in L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/lem/64-1/2-6

zbMATH Keywords

HNN extensiontruth-table degreeturing degreecomputable permutation

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• An introduction to computable model theory on groups and fields
• scientific article; zbMATH DE number 1376752
• Finite generability of some groups of recursive permutations
• scientific article; zbMATH DE number 1537527
• Publication:3033748

Cites work

• scientific article; zbMATH DE number 1534357 (Why is no real title available?)
• Constructive Analogues of the Group of Permutations of the Natural Numbers
• Generic-case complexity, decision problems in group theory, and random walks.
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursive Predicates and Quantifiers
• Recursively enumerable sets of positive integers and their decision problems
• Relationships Between Reducibilities
• Turing computability. Theory and applications
• Über die Permutationsgruppe der natürlichen Zahlenfolge

Cited in

(5)

• scientific article; zbMATH DE number 1923097 (Why is no real title available?)
• On positive and constructive groups
• Finding and counting permutations via CSPs
• An introduction to computable model theory on groups and fields
• Computable paradoxical decompositions

This page was built for publication: Computable permutations and word problems

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