scientific article; zbMATH DE number 5485222

MaRDI QIDQ3549468zbMATH OpenFDO

Authors J. F. Knight

Publication date 28 December 2008

zbMATH Keywords

abelian \(p\)-groupsarithmetical hierarchycomputable groupscomputable infinitary formulascomputable modelsindex setssurvey paper

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Hierarchies of computability and definability (03D55)

Recommendations

• The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
• Determining the levels of some special complexity classes of sets in the Kleene arithmetical hierarchy
• Decidability, Recursive Enumerability and Kleene Hierarchy ForL-Subsets
• scientific article; zbMATH DE number 4039338
• scientific article; zbMATH DE number 1216601
• Hierarchy theorems for kOBDDs and kIBDDs
• Recursive Structures and Ershov's Hierarchy
• Kleene index sets and functional m-degrees
• scientific article; zbMATH DE number 4123711
• Representation of De Morgan and (semi-)Kleene lattices

Cited in

(3)

• Hierarchy theorems for kOBDDs and kIBDDs
• An example related to Gregory's theorem
• Kleene, Rabin, and Scott Are Available

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 Q3549468)