Growing commas. A study of sequentiality and concatenation

DOI10.1215/00294527-2008-028zbMath1190.03052OpenAlexW2123447690MaRDI QIDQ1038605

Albert Visser

Publication date: 18 November 2009

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

Full work available at URL: https://doi.org/10.1215/00294527-2008-028

zbMATH Keywords

stringssequentialityconcatenation

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Relative consistency and interpretations (03F25)

Related Items (19)

MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES ⋮ CONSISTENCY AND THE THEORY OF TRUTH ⋮ Bases for structures and theories. I. ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ The logical strength of compositional principles ⋮ Weak theories of concatenation and arithmetic ⋮ On undecidability of concatenation theory for one-symbol languages ⋮ 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 ⋮ Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories ⋮ AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING ⋮ 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 ⋮ Weak sequential theories of finite full binary trees ⋮ On interpretability between some weak essentially undecidable theories

This page was built for publication: Growing commas. A study of sequentiality and concatenation