On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications (Q793007): Difference between revisions

The present paper is Part 2 of a work whose three parts deal with synonymy in connection with any theory \({\mathcal T}\), formal, axiomatic, and extensional [for part I see ibid. 69, 63-76 (1983; Zbl 0525.03019)]. The definition of a synonymy relation connected with any given definition system - see Part 1, {\S}6 - is not of the usual inductive type. This may give rise to difficulties, e.g. in proving that some given expressions are not synonymous. Hence it is natural to search for criteria useful for these proofs. To find some of them is one of the aims of the present paper. In particular a relatively simple condition sufficient for non- synonymy is given; and it is applied to two examples, one belonging to logic and the other to arithmetic. To this end generalized interpretations are introduced.