Decidability without mathematics (Q598296)

In the paper a new definition for computability (or decidability) is proposed. Namely, the definition is put on the ground of a theory of texts initiated by Alfred Tarski. The author proposes name {discernibility} for this version of computability. Discernibility means the possibility of checking whether or not a considered property or relation between texts holds. This way the proof of undecidability can be formulated in such a way that arithmetization of the syntax may be replaced by the use of concatenation in metalogic. Discernibility is defined in two classes for properties and relations, (1) elementary discernibility (ED), which includes identity relation (also with symbols of the text), concatenation relation, and is closed under propositional calculus and quantifiers restricted to subtexts, and (2) {general discernibility} (GD), defined so that a relation \(R\) is in GD if and only if there exist \(S_1,S_2\in\) ED such that \(x\in R\iff \exists y: (x\dots y)\in S_1\) and \(x\in \text{non}R\iff \exists y: (x\dots y)\in S_1\). Finally, the author conjectures that a relation is in GD if and only if it is representable in the elementary theory of texts (due to Tarski). It is claimed that this conjecture is already solved by the author, and will be published later.