Model complete theories of trees

DOI10.1007/BF00970065MaRDI QIDQ2277448zbMATH OpenOpenAlexFDO

Authors G. E. Puninskij

Publication date 1990

Published in Siberian Mathematical Journal (Search for Journal in Brave)

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

zbMATH Keywords

categoricitycountable treesmodel-complete theories of trees

Mathematics Subject Classification ID

Model theory of denumerable and separable structures (03C15) Categoricity and completeness of theories (03C35) Models with special properties (saturated, rigid, etc.) (03C50) Models of other mathematical theories (03C65)

Review text

The author investigates model-complete theories of trees. In {\S}1 he starts with some general facts of model-complete, strongly \(\forall\)- finite theories. In {\S}2 these results are used to characterize countable trees which have a model-complete theory. Further on it is shown that each model-complete theory of trees is decidable. In connection with his investigations the author asks if every model- complete, strongly \(\forall\)-finite theory is decidable.

Recommendations

• The countable models and properties of the theory of complete binary trees
• scientific article; zbMATH DE number 4035798
• scientific article; zbMATH DE number 2213969
• LE MODÈLE COMPAGNON DE LA THÉORIE DES ARBRES
• scientific article; zbMATH DE number 4083594

Cites work

• scientific article; zbMATH DE number 3829877 (Why is no real title available?)
• scientific article; zbMATH DE number 4035798 (Why is no real title available?)
• LE MODÈLE COMPAGNON DE LA THÉORIE DES ARBRES
• Model-completeness for sheaves of structures

Cited in

(27)

• \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
• Weak sequential theories of finite full binary trees
• First-order theories of bounded trees
• Trees and finite satisfiability: proof of a conjecture of Burgess
• Strict superstablity and decidability of certain generic graphs
• Models of adding relations to an organization structure of a complete K-ary tree
• A variety theorem for trees and theories
• On model-theoretic tree properties
• LE MODÈLE COMPAGNON DE LA THÉORIE DES ARBRES
• A new proof of quantifier elimination of complete forked trees
• The countable models and properties of the theory of complete binary trees
• Cardinality Quantifiers in MLO over Trees
• scientific article; zbMATH DE number 3914293 (Why is no real title available?)
• Degrees of Indiscernibles in Decidable Models
• The Model Completion of the Class of ℒ-Structures
• Bad models in nice neighborhoods
• scientific article; zbMATH DE number 4035798 (Why is no real title available?)
• Representing models by finite trees
• scientific article; zbMATH DE number 1534574 (Why is no real title available?)
• scientific article; zbMATH DE number 1389856 (Why is no real title available?)
• Countable models and infinite trees
• scientific article; zbMATH DE number 3894467 (Why is no real title available?)
• A countable model for the theory of complete dense binary order
• scientific article; zbMATH DE number 2213969 (Why is no real title available?)
• scientific article; zbMATH DE number 4187786 (Why is no real title available?)
• Metalinear recursive schemas on marked trees
• A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

This page was built for publication: Model complete theories of trees

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