Arithmetic on semigroups

DOI10.2178/JSL/1231082312zbMath1160.03038OpenAlexW2032467105MaRDI QIDQ3616353

Mihai Ganea

Publication date: 25 March 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1231082312

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) First-order arithmetic and fragments (03F30)

Related Items (9)

Bases for structures and theories. I. ⋮ Weak theories of concatenation and arithmetic ⋮ Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) ⋮ MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY ⋮ The scope of Gödel's first incompleteness theorem ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ Deflationism beyond arithmetic ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Weak essentially undecidable theories of concatenation

Cites Work

• On interpretability in the theory of concatenation
• Undecidability without arithmetization
• Variants of Robinson's essentially undecidable theoryR
• Concatenation as a basis for arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Arithmetic on semigroups