An algebraic result about soft model theoretical equivalence relations with an application to H. Friedman's fourth problem
Journal of Symbolic Logic 46 (3):523-530 (1981)
|Abstract||We prove the following algebraic characterization of elementary equivalence: $\equiv$ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of the familiar model theoretical notion. We apply this result to Friedman's fourth problem by proving that if L = L ωω (Q i ) i ∈ ω 1 is an (ω 1 , ω)-compact logic satisfying both the Robinson consistency theorem on countable structures of finite type and the Löwenheim-Skolem theorem for some $\lambda for theories having ω 1 many sentences, then $\equiv_L = \equiv$ on such structures|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Slawomir Solecki (2000). Actions of Non-Compact and Non-Locally Compact Polish Groups. Journal of Symbolic Logic 65 (4):1881-1894.
Jeffry L. Hirst (1999). Ordinal Inequalities, Transfinite Induction, and Reverse Mathematics. Journal of Symbolic Logic 64 (2):769-774.
Andrea Sorbi (1982). ∑0n-Equivalence Relations. Studia Logica 41 (4):351-358.
Christian Rosendal (2005). Cofinal Families of Borel Equivalence Relations and Quasiorders. Journal of Symbolic Logic 70 (4):1325 - 1340.
Jeffrey S. Carroll (1990). Maximal R.E. Equivalence Relations. Journal of Symbolic Logic 55 (3):1048-1058.
Lauri Hella, Phokion G. Kolaitis & Kerkko Luosto (1996). Almost Everywhere Equivalence of Logics in Finite Model Theory. Bulletin of Symbolic Logic 2 (4):422-443.
Vladimir Kanovei (1997). An Ulm-Type Classification Theorem for Equivalence Relations in Solovay Model. Journal of Symbolic Logic 62 (4):1333-1351.
Tatjana L. Plotkin, Sarit Kraus & Boris I. Plotkin (1998). Problems of Equivalence, Categoricity of Axioms and States Description in Databases. Studia Logica 61 (3):347-366.
Claudio Bernardi & Andrea Sorbi (1983). Classifying Positive Equivalence Relations. Journal of Symbolic Logic 48 (3):529-538.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads2 ( #232,722 of 551,054 )
Recent downloads (6 months)0
How can I increase my downloads?