Mappings with coenumerable graphs

DOI10.1007/S10469-025-09805-1MaRDI QIDQ7253331zbMATH OpenFDO

Authors Andrei S. Morozov

Publication date 27 May 2026

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

Full work available at URL https://doi.org/10.1007/S10469-025-09805-1

zbMATH Keywords

computabilitycomputable permutationgraph

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Group theory and generalizations (20-XX)

Cites work

• Constructive Analogues of the Group of Permutations of the Natural Numbers
• Families of permutations and ideals of Turing degrees
• scientific article; zbMATH DE number 1302877 (Why is no real title available?)
• scientific article; zbMATH DE number 3056889 (Why is no real title available?)
• On degrees of unsolvability
• On the representation of partial recursive functions as superpositions
• Permutations and implicit definability
• Turing reducibility as algebraic embeddability
• Über die Automorphismen der Permutationsgruppe der natürlichen Zahlenfolge.
• Über die Permutationsgruppe der natürlichen Zahlenfolge

This page was built for publication: Mappings with coenumerable graphs

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