Weak theories of concatenation and arithmetic

DOI10.1215/00294527-1715698zbMath1251.03075OpenAlexW2065688612MaRDI QIDQ435240

Yoshihiro Horihata

Publication date: 11 July 2012

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1336588251

zbMATH Keywords

interpretationRobinson's arithmetictheory of concatenation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Relative consistency and interpretations (03F25)

Related Items (2)

First-order concatenation theory with bounded quantifiers ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)

Cites Work

• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Undecidability without arithmetization
• Undecidable theories
• Arithmetic on semigroups
• Variants of Robinson's essentially undecidable theoryR
• Concatenation as a basis for arithmetic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weak theories of concatenation and arithmetic