scientific article; zbMATH DE number 2154081

zbMATH Open1061.03043MaRDI QIDQ4664628FDOQ4664628

Authors: Elías F. Combarro 

Publication date: 8 April 2005

Full work available at URL: https://eudml.org/doc/51247

Title of this publication is not available (Why is that?)

zbMATH Keywords

automorphismcomputable setcomputably enumerable setcomputable permutationrecursive set

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Infinite automorphism groups (20B27)

Cited In (2)

• Simple permutations: Decidability and unavoidable substructures
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes

This page was built for publication:

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