On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications
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.
- On a synonymy relation for extensional first order theories. III: A necessary and sufficient condition for synonymy
- scientific article; zbMATH DE number 638363
- A first order nonmonotonic extension of constructive logic
- An application of first-order compactness in canonicity of relation algebras
- Extensions of ordered theories by generic predicates
- On two concepts of ultrafilter extensions of first-order models and their generalizations
- First order logic without equality on relativized semantics
- On some applied first-order theories which can be represented by definitions
- An Omitting Types Theorem for first order logic with infinitary relation symbols
- Synonymy in sentential languages: A pragmatic view
- On generalization of definitional equivalence to non-disjoint languages
- Set theory with and without urelements and categories of interpretations
- Secondary extensions, meanings and non-null terms
- Goodman's extensional isomorphism and syntactical interpretations
- scientific article; zbMATH DE number 3916229 (Why is no real title available?)
- Synonymous theories and knowledge representations in answer set programming
- On a synonymy relation for extensional first order theories. III: A necessary and sufficient condition for synonymy
This page was built for publication: On a synonymy relation for extensional first order theories. II: A sufficient criterion for non synonymy. Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793007)
