scientific article

zbMath1150.03014MaRDI QIDQ3509164

Andrzej Grzegorczyk, Konrad Zdanowski

Publication date: 1 July 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

undecidabilitydecidabilityelementary theoriestheory of contacenation

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25)

Related Items (11)

Bases for structures and theories. I. ⋮ Weak theories of concatenation and arithmetic ⋮ First-order concatenation theory with bounded quantifiers ⋮ 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 ⋮ On decidability of theories of regular languages ⋮ FINDING THE LIMIT OF INCOMPLETENESS I ⋮ Weak essentially undecidable theories of concatenation ⋮ On interpretability between some weak essentially undecidable theories

This page was built for publication: