Algorithmic properties of branching models

DOI10.1007/BF01979010MaRDI QIDQ580329zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 98168
• scientific article; zbMATH DE number 1246231
• The model and existence of branching process in random environment
• Uniqueness and extinction properties of generalised Markov branching processes
• Some properties of branching processes in random environments

Cites work

• scientific article; zbMATH DE number 3732033 (Why is no real title available?)
• Autostability of models
• Recursive Boolean algebras with recursive atoms
• Recursive properties of isomorphism types
• Some aspects of generalized computability

Cited in

(6)

• Linear orders with distinguished function symbol
• Special issue: Selected papers of the workshop on model theory and computable model theory, Gainesville, FL, USA, February 5--10, 2007
• Recursive unary algebras and trees
• The characterization of branching dependencies
• Recursive properties of branching and BGG resolution
• Autostability of Boolean algebras with distinguished ideal

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

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