Algorithmic properties of branching models
From MaRDI portal
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
- Branching processes and their applications in the analysis of tree structures and tree algorithms
- 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
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)