Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 37, Number 3 (1996), 506-522.
On Elementary Equivalence for Equality-free Logic
This paper is a contribution to the study of equality-free logic, that is, first-order logic without equality. We mainly devote ourselves to the study of algebraic characterizations of its relation of elementary equivalence by providing some Keisler-Shelah type ultrapower theorems and an Ehrenfeucht-Fraïssé type theorem. We also give characterizations of elementary classes in equality-free logic. As a by-product we characterize the sentences that are logically equivalent to an equality-free one.
Notre Dame J. Formal Logic Volume 37, Number 3 (1996), 506-522.
First available in Project Euclid: 14 December 2002
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Casanovas, E.; Dellunde, P.; Jansana, R. On Elementary Equivalence for Equality-free Logic. Notre Dame J. Formal Logic 37 (1996), no. 3, 506--522. doi:10.1305/ndjfl/1039886524. https://projecteuclid.org/euclid.ndjfl/1039886524