Growing commas. A study of sequentiality and concatenation

DOI10.1215/00294527-2008-028MaRDI QIDQ1038605zbMATH OpenOpenAlexFDO

Authors 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

concatenationsequentialitystrings

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(27)

• The logical strength of compositional principles
• Undecidability without arithmetization
• On decidability of theories of regular languages
• Weak essentially undecidable theories of concatenation
• Weak sequential theories of finite full binary trees
• On interpretability between some weak essentially undecidable theories
• Bases for structures and theories. I.
• On undecidability of concatenation theory for one-symbol languages
• First-order concatenation theory with bounded quantifiers
• The scope of Gödel's first incompleteness theorem
• Concatenation of finite sequences
• Sequence encoding without induction
• Decorated linear order types and the theory of concatenation
• Consistency and the theory of truth
• Weak theories of concatenation and arithmetic
• Mutual interpretability of Robinson arithmetic and adjunctive set theory with extensionality
• Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
• Current research on Gödel's incompleteness theorems
• Finding the limit of incompleteness. I
• MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
• Peano Corto and Peano Basso: a study of local induction in the context of weak theories
• Axiomatic truth, syntax and metatheoretic reasoning
• INTERLEAVING LOGIC AND COUNTING
• A weak theory of building blocks
• Quantifier-free induction for lists
• On elementary theories of weighted and labelled trees
• A weak first-order theory of sequences

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

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