First-order theories of bounded trees

Archive for Mathematical Logic 61 (1):263-297 (2021)
  Copy   BIBTEX

Abstract

A maximal chain in a tree is called a path, and a tree is called bounded when all its paths contain leaves. This paper concerns itself with first-order theories of bounded trees. We establish some sufficient conditions for the existence of bounded end-extensions that are also partial elementary extensions of a given tree. As an application of tree boundedness, we obtain a conditional axiomatisation of the first-order theory of the class of trees whose paths are all isomorphic to some ordinal \, given the first-order theories of certain classes of bounded trees.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,779

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
Automatic structures of bounded degree revisited.Dietrich Kuske & Markus Lohrey - 2011 - Journal of Symbolic Logic 76 (4):1352-1380.
Essential Kurepa trees versus essential Jech–Kunen trees.Renling Jin & Saharon Shelah - 1994 - Annals of Pure and Applied Logic 69 (1):107-131.

Analytics

Added to PP
2021-07-25

Downloads
14 (#996,581)

6 months
7 (#594,125)

Historical graph of downloads
How can I increase my downloads?