Submission date: 31 October 2021

Abstract:

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction of Post`s Correspondence Problem. By a different method, we show that deciding truth of sentences with one existential quantifier and one bounded universal quantifier is undecidable.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 2111.00573: pdf, ps.