Computable permutations and word problems

DOI10.4171/LEM/64-1/2-6OpenAlexW2946064327WikidataQ127832156 ScholiaQ127832156MaRDI QIDQ2314871FDOQ2314871

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

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

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• 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)