Algorithmic properties of branching models

DOI10.1007/BF01979010zbMath0626.03027MaRDI QIDQ580329

Yu. G. Ventsov

Publication date: 1986

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

branching properties of models

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

Recursive unary algebras and trees ⋮ Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007 ⋮ Linear orders with distinguished function symbol ⋮ Autostability of Boolean algebras with distinguished ideal

Cites Work

• Unnamed Item
• Autostability of models
• Some aspects of generalized computability
• Recursive properties of isomorphism types
• Recursive Boolean algebras with recursive atoms

This page was built for publication: Algorithmic properties of branching models