A weak theory of building blocks

Abstract

We apply the mereological concept of parthood to the coding of finite sequences. We propose a first-order theory in which coding finite sequences is intuitive and transparent. We compare this theory with Robinson arithmetic, adjunctive set theory and weak theories of finite strings and finite trees using interpretability.