Growing commas. A study of sequentiality and concatenation
From MaRDI portal
Publication:1038605
DOI10.1215/00294527-2008-028zbMATH Open1190.03052OpenAlexW2123447690MaRDI QIDQ1038605FDOQ1038605
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
Decidability of theories and sets of sentences (03B25) Relative consistency and interpretations (03F25)
Cited In (21)
- Weak essentially undecidable theories of concatenation
- On interpretability between some weak essentially undecidable theories
- AXIOMATIC TRUTH, SYNTAX AND METATHEORETIC REASONING
- Weak sequential theories of finite full binary trees
- A weak theory of building blocks
- CONSISTENCY AND THE THEORY OF TRUTH
- Weak theories of concatenation and arithmetic
- Quantifier-free induction for lists
- FINDING THE LIMIT OF INCOMPLETENESS I
- The scope of Gödel's first incompleteness theorem
- Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories
- On decidability of theories of regular languages
- MUTUAL INTERPRETABILITY OF ROBINSON ARITHMETIC AND ADJUNCTIVE SET THEORY WITH EXTENSIONALITY
- INTERLEAVING LOGIC AND COUNTING
- MUTUAL INTERPRETABILITY OF WEAK ESSENTIALLY UNDECIDABLE THEORIES
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\)
- The logical strength of compositional principles
- On undecidability of concatenation theory for one-symbol languages
- Bases for structures and theories. I.
- CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS
- First-order concatenation theory with bounded quantifiers
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)
