Transductions in arithmetic (Q904144)

A new relation between sentences is studied, called transducibility. Transducibility is based on an analysis of a converse of \textit{S. Feferman}'s theorem: if a sentence is interpretable over a theory \(U,\) it is an inconsistency statement for \(U\) over \(U\) [Fundam. Math. 49, 35--92 (1960; Zbl 0095.24301)]. The author shows that for essentially reflexive theories transducibility coincides with interpretability. For theories interpreting EA, transducibility coincides with \(\Pi_1\)-conservativity. Transducibility admits variations that are distinct from interpretability and \(\Pi_1\)-conservativity.