Weak theories of concatenation and arithmetic

DOI10.1215/00294527-1715698zbMATH Open1251.03075OpenAlexW2065688612MaRDI QIDQ435240FDOQ435240

Authors: 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

Recommendations

• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Weak essentially undecidable theories of concatenation
• On undecidability of concatenation theory for one-symbol languages
• On interpretability in the theory of concatenation
• Arithmetic on semigroups

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)

Cites Work

• Undecidable theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Undecidability without arithmetization
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Decorated linear order types and the theory of concatenation
• Title not available (Why is that?)
• Arithmetic on semigroups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Variants of Robinson's essentially undecidable theoryR
• Relatives of Robinson arithmetic
• An interpretation of Robinson arithmetic in its Grzegorczyk's weaker variant
• Title not available (Why is that?)
• Concatenation as a basis for arithmetic

Cited In (10)

• Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
• Weak essentially undecidable theories of concatenation
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Decorated linear order types and the theory of concatenation
• Relatives of Robinson arithmetic
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• The strength of replacement in weak arithmetic
• CARDINAL ARITHMETIC IN THE STYLE OF BARON VON MÜNCHHAUSEN
• First-order concatenation theory with bounded quantifiers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435240)