Algorithmic complexity of algebraic systems

DOI10.1007/BF01158034MaRDI QIDQ1121875zbMATH OpenOpenAlexFDO

Authors Victor Selivanov

Publication date 1988

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01158034

zbMATH Keywords

strong constructibilityclassification of algebraic systems by Turing degrees of unsolvabilityconstrucible structuredegree of constructibilitym-degrees of recursively enumerable sets

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

Cites work

• scientific article; zbMATH DE number 3943890 (Why is no real title available?)
• Definable structures in the lattice of recursively enumerable sets
• Degrees of Structures
• Hierarchies of Boolean algebras
• The computable enumerations of families of general recursive functions

Cited in

(13)

• scientific article; zbMATH DE number 7295748 (Why is no real title available?)
• scientific article; zbMATH DE number 3933053 (Why is no real title available?)
• On the main scientific achievements of Victor Selivanov
• Decidability of classes of algebraic systems in polynomial time
• Computable embeddability for algebraic structures
• Effective categoricity for distributive lattices and Heyting algebras
• On recursively enumerable structures
• Complexity of the normalization of algebras
• Computability of distributive lattices
• Learning families of algebraic structures from informant
• Issues of algorithmics and Glushkov's systems of algorithmic algebras
• Degree spectra of structures
• Well-Quasi Orders and Hierarchy Theory

This page was built for publication: Algorithmic complexity of algebraic systems

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