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: 91,709

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.
Essential Kurepa trees versus essential Jech–Kunen trees.Renling Jin & Saharon Shelah - 1994 - Annals of Pure and Applied Logic 69 (1):107-131.
On the existence of indiscernible trees.Kota Takeuchi & Akito Tsuboi - 2012 - Annals of Pure and Applied Logic 163 (12):1891-1902.
Two General Results on Intuitionistic Bounded Theories.Fernando Ferreira - 1999 - Mathematical Logic Quarterly 45 (3):399-407.
Automatic structures of bounded degree revisited.Dietrich Kuske & Markus Lohrey - 2011 - Journal of Symbolic Logic 76 (4):1352-1380.
A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
Sheaf recursion and a separation theorem.Nathanael Leedom Ackerman - 2014 - Journal of Symbolic Logic 79 (3):882-907.
A Bounded Jump for the Bounded Turing Degrees.Bernard Anderson & Barbara Csima - 2014 - Notre Dame Journal of Formal Logic 55 (2):245-264.
Herbrand consistency of some arithmetical theories.Saeed Salehi - 2012 - Journal of Symbolic Logic 77 (3):807-827.
Bounded Scott Set Saturation.Alex M. McAllister - 2002 - Mathematical Logic Quarterly 48 (2):245-259.
Bounded-low sets and the high/low hierarchy.Huishan Wu - 2020 - Archive for Mathematical Logic 59 (7-8):925-938.

Analytics

Added to PP
2021-07-25

Downloads
12 (#1,081,406)

6 months
6 (#510,793)

Historical graph of downloads
How can I increase my downloads?