Algorithmic complexity of algebraic systems

DOI10.1007/BF01158034zbMath0675.03026OpenAlexW2072721574MaRDI QIDQ1121875

Victor L. 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

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

Related Items (8)

Effective categoricity for distributive lattices and Heyting algebras ⋮ On recursively enumerable structures ⋮ On the main scientific achievements of Victor Selivanov ⋮ Learning families of algebraic structures from informant ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Computability of distributive lattices ⋮ Degree spectra of structures ⋮ Computable embeddability for algebraic structures

Cites Work

• The computable enumerations of families of general recursive functions
• Definable structures in the lattice of recursively enumerable sets
• Degrees of Structures
• Hierarchies of Boolean algebras
• Unnamed Item

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