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)

Full work available at URL https://doi.org/10.1007/BF01979010

zbMATH Keywords

branching properties of models

Mathematics Subject Classification ID

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

Review text

This paper is a continuation of the study of the branching properties of models [\textit{S. S. Goncharov} and \textit{V. D. Dzgoev}, Algebra Logika 19, No.2, 45-58 (1980; Zbl 0468.03023)]. We generalize the concept of branching, and thus we are able to apply the basic theorems to a wider class of models.

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

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

Cited in

(6)

• 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
• The characterization of branching dependencies
• Autostability of Boolean algebras with distinguished ideal
• Recursive unary algebras and trees
• Recursive properties of branching and BGG resolution

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)