Countability of widths of algebraic reducibility structures for models in some classes

zbMath0847.03019MaRDI QIDQ1914759

S. T. Fedoryaev

Publication date: 28 August 1996

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

correlationspectrumlinear ordersalgebraic dimensionblock relationautostabilityconstructive modelFréchet idealrecursive modelalgorithmic dimensionsrelatively complemented distributive latticesalgorithmic stabilityscattered linear ordersalgebraic reducibility structuresautodimension

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57)

Related Items (2)

Existence and uniqueness of structures computable in polynomial time ⋮ Structures computable in polynomial time. II

This page was built for publication: Countability of widths of algebraic reducibility structures for models in some classes