On Elementary Equivalence for Equality-free Logic

Notre Dame Journal of Formal Logic 37 (3):506-522 (1996)
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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 13,012
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
Similar books and articles
Bruno Poizat (2006). Univers Positifs. Journal of Symbolic Logic 71 (3):969 - 976.
Tim Fernando (1994). Bisimulations and Predicate Logic. Journal of Symbolic Logic 59 (3):924-944.
Daniel Dzierzgowski (1988). Many-Sorted Elementary Equivalence. Notre Dame Journal of Formal Logic 29 (4):530-542.

Monthly downloads

Sorry, there are not enough data points to plot this chart.

Added to index


Total downloads

1 ( #499,222 of 1,410,135 )

Recent downloads (6 months)

1 ( #177,743 of 1,410,135 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.