scientific article; zbMATH DE number 5000345

MaRDI QIDQ3365576zbMATH OpenFDO

Authors Stela K. Nikolova

Publication date 23 January 2006

zbMATH Keywords

abstract computabilityenumerationsexternal definability

Mathematics Subject Classification ID

Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Definable Encodings in the Computably Enumerable Sets
• Definability via enumerations
• Computability by means of effectively definable schemes and definability via enumerations
• Definability in the enumeration degrees
• scientific article; zbMATH DE number 535104
• DEFINABILITY OF RECURSIVELY ENUMERABLE SETS IN ABSTRACT COMPUTATIONAL COMPLEXITY THEORY
• Definable properties of the computably enumerable sets
• Coding and definability in computable structures
• scientific article; zbMATH DE number 515737
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets

Cited in

(7)

• Admissibility in _n^0-enumerations
• Definability via enumerations
• Stepping up lemmas in definable partitions
• scientific article; zbMATH DE number 535104 (Why is no real title available?)
• Definability with a predicate for a semi-linear set
• Recognizability equals definability for partial k-paths
• Examples of semicomputable sets of real and complex numbers

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