Notes on Fragments of First-Order Concatenation Theory
classification
🧮 math.LO
keywords
fragmentsconcatenationfirst-orderidentifytheoryaxiomatizationcompletedecidable
read the original abstract
We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.