Freeness in classes without equality
Journal of Symbolic Logic 64 (3):1159-1194 (1999)
| Abstract | This paper is a continuation of [27], where we provide the background and the basic tools for studying the structural properties of classes of models over languages without equality. In the context of such languages, it is natural to make distinction between two kinds of classes, the so-called abstract classes, which correspond to those closed under isomorphic copies in the presence of equality, and the reduced classes, i.e., those obtained by factoring structures by their largest congruences. The generic problem described in [27] is to investigate under what conditions this reduction process does not alter the metatheory of a class. Here we focus our attention on a concrete aspect of this generic problem that we import from universal algebra, namely the existence and description of free models. As in [27], we can find here again the basic notion of protoalgebraicity, which was originally introduced in [7] as the weakest condition to guarantee that the reduction process behaves reasonably well from an algebraic point of view. Our concern, however, takes us to handle a further notion, that of semialgebraicity, which corresponds to the notion of equivalential logic of [18]; semialgebraicity turns out to be the property which ensures that freeness is fully preserved by the reduction process | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,865 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesMichael H. Albert (1987). A Preservation Theorem for EC-Structures with Applications. Journal of Symbolic Logic 52 (3):779-785.
Shaughan Lavine (1991). Dual Easy Uniformization and Model-Theoretic Descriptive Set Theory. Journal of Symbolic Logic 56 (4):1290-1316.
Philip Hugly & Charles Sayward (1980). Tarski and Proper Classes. Analysis 40 (4):6-11.
Nino B. Cocchiarella (2002). On the Logic of Classes as Many. Studia Logica 70 (3):303-338.
Wesley Calvert (2005). The Isomorphism Problem for Computable Abelian P-Groups of Bounded Length. Journal of Symbolic Logic 70 (1):331 - 345.
Massoud Pourmahdian (2002). Smooth Classes Without AC and Robinson Theories. Journal of Symbolic Logic 67 (4):1274-1294.
Harvey Friedman & Lee Stanley (1989). A Borel Reducibility Theory for Classes of Countable Structures. Journal of Symbolic Logic 54 (3):894-914.
Holger Sturm (2000). Elementary Classes in Basic Modal Logic. Studia Logica 64 (2):193-213.
R. Elgueta & R. Jansana (1999). Definability of Leibniz Equality. Studia Logica 63 (2):223-243.
R. Elgueta (1997). Characterization Classes Defined Without Equality. Studia Logica 58 (3):357-394.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #277,212 of 556,815 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
