Weak Essentially Undecidable Theories of Concatenation II
Juvenal Murwanashyaka
TL;DR
This paper demonstrates that concatenation theories can be interpreted within arithmetical theories that do not utilize coding sequences, expanding understanding of their logical relationships.
Contribution
It introduces a method to interpret concatenation theories in arithmetical frameworks lacking sequence coding, advancing the theoretical understanding of these systems.
Findings
Concatenation theories can be interpreted without coding sequences.
The interpretation broadens the scope of arithmetical theories.
Implications for the undecidability of certain logical systems.
Abstract
We show that we can interpret concatenation theories in arithmetical theories without coding sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · Numerical Methods and Algorithms