scientific article; zbMATH DE number 218551

MaRDI QIDQ4694255zbMATH OpenFDO

Authors Alexandra Soskova, Ivan N. Soskov

Publication date 29 June 1993

zbMATH Keywords

abstract structurescomputability by means of recursively enumerable definitional schemeseffective enumerations

Mathematics Subject Classification ID

Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Exact effective enumerations of total functional structures
• Second Order Definability Via enumerations
• On functors enumerating structures
• Effective Structures
• Computability by means of effectively definable schemes and definability via enumerations

Cited in

(18)

• Computability by means of effectively definable schemes and definability via enumerations
• Effective choice operations on constructive and positive models
• On recursively enumerable structures
• On functors enumerating structures
• Least enumerations of partial structures
• scientific article; zbMATH DE number 4210132 (Why is no real title available?)
• Characterization of the effective computability in \({\mathfrak f}\)-enumerations
• Admissibility in _n^0-enumerations
• scientific article; zbMATH DE number 4154429 (Why is no real title available?)
• Exact enumerations
• scientific article; zbMATH DE number 729933 (Why is no real title available?)
• Effective Structures
• Computability of String Functions Over Algebraic Structures Armin Hemmerling
• A Friedberg enumeration of equivalence structures
• Exact effective enumerations of total functional structures
• Effective applicative structures
• Calculable enumerations and equivalence relations
• Ivan Soskov: a life in computability

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