First-Order Concatenation Theory with Bounded Quantifiers
classification
🧮 math.LO
keywords
boundedconcatenationfirst-orderprovequantifiersresultstheoryaxiomatizations
read the original abstract
We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability 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.