Undecidability and Concatenation
نویسندگان
چکیده
We consider the problem stated by Andrzej Grzegorczyk in “Undecidability without arithmetization” (Studia Logica 79(2005)) whether certain weak theory of concatenation is essentially undecidable. We give a positive answer for this problem.
منابع مشابه
Undecidability without Arithmetization
In the present paper the well-known Gbdel's Church's argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interesting. The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions ar...
متن کاملOn Interpretability in the Theory of Concatenation
We prove that a variant of Robinson arithmetic Q with non-total operations is interpretable in the theory of concatenation TC introduced by A. Grzegorczyk. Since Q is known to be interpretable in that non-total variant, our result gives a positive answer to the problem whether Q is interpretable in TC. An immediate consequence is essential undecidability
متن کاملUndecidability of finite convergence for concatenation, insertion and bounded shuffle operators
The k-insertion and shuffle operations on formal languages have been extensively studied in the computer science and control systems literature. These operations can be viewed as purely abstract, as representations of biological processes or as models of the interleavings of concurrent processes. Questions naturally arise about closure and decidability. Many have been previously answered, espec...
متن کاملEquations over Sets of Natural Numbers with Addition Only
Systems of equations of the form X = Y Z and X = C are considered, in which the unknowns are sets of natural numbers, “+” denotes pairwise sum of sets S+T = {m + n | m ∈ S, n ∈ T}, and C is an ultimately periodic constant. It is shown that such systems are computationally universal, in the sense that for every recursive (r.e., co-r.e.) set S ⊆ N there exists a system with a unique (least, great...
متن کاملArray Folds Logic
We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as “the first array cell contains the array length,” and “the array contains equally many minimal and maximal elements.” These properties cannot be expressed in quantified fragments of the theory of arrays, nor...
متن کامل