Algorithmic complexity of algebraic systems
From MaRDI portal
Publication:1121875
DOI10.1007/BF01158034zbMath0675.03026OpenAlexW2072721574MaRDI QIDQ1121875
Publication date: 1988
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01158034
strong constructibilityclassification of algebraic systems by Turing degrees of unsolvabilityconstrucible structuredegree of constructibilitym-degrees of recursively enumerable sets
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
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