TREE THEORY: INTERPRETABILITY BETWEEN WEAK FIRST-ORDER THEORIES OF TREES

Elementary first-order theories of trees allowing at most, exactly $\mathrm{m}$ , and any finite number of immediate descendants are introduced and proved mutually interpretable among themselves and with Robinson arithmetic, Adjunctive Set Theory with Extensionality and other well-known weak theorie...

Full description

Saved in:
Bibliographic Details
Published in:The bulletin of symbolic logic 2023-12, Vol.29 (4), p.465-502
Main Author: DAMNJANOVIC, ZLATAN
Format: Article
Language:English
Subjects:
Set theory
Trees
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Elementary first-order theories of trees allowing at most, exactly $\mathrm{m}$ , and any finite number of immediate descendants are introduced and proved mutually interpretable among themselves and with Robinson arithmetic, Adjunctive Set Theory with Extensionality and other well-known weak theories of numbers, sets, and strings.
ISSN:1079-8986
1943-5894
DOI:10.1017/bsl.2023.5