On elementary theories of weighted and labelled trees
Year: 2025
Type: article
Abstract: We introduce two weak first-order theories of weighted and labelled finite trees, T*† and T*‡, respectively. It is proved that T*† and T*‡ are mutually interpretable with other previously studied elementary theories of ‘undecorated’ finite trees, as well as with Robinson Arithmetic, Q, and a host of other weak first-order theories of numbers, strings, sets and sequences.
Source: Journal of Logic and Computation
Author: Zlatan Damnjanovic
Institution: University of Southern California
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $4,533
OpenAlex ID: W7128489958