Archive for Mathematical Logic 30 (4):231-240 (1990)

Abstract
We introduce a natural class of quantifiersTh containing all monadic type quantifiers, all quantifiers for linear orders, quantifiers for isomorphism, Ramsey type quantifiers, and plenty more, showing that no sublogic ofL ωω (Th) or countably compact regular sublogic ofL ∞ω (Th), properly extendingL ωω , satisfies the uniform reduction property for quotients. As a consequence, none of these logics satisfies eitherΔ-interpolation or Beth's definability theorem when closed under relativizations. We also show the failure of both properties for any sublogic ofL ∞ω (Th) in which Chang's quantifier or some cardinality quantifierQ α, with α≧1, is definable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01792985
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,363
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

Definability Hierarchies of General Quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
Remarks in Abstract Model Theory.Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (3):255-288.
Stationary Logic and its Friends. I.Alan H. Mekler & Saharon Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (2):129-138.
Vector Spaces and Binary Quantifiers.Michał Krynicki, Alistair Lachlan & Jouko Väänänen - 1984 - Notre Dame Journal of Formal Logic 25 (1):72-78.
Stationary Logic and its Friends. II.Alan H. Mekler & Saharon Shelah - 1986 - Notre Dame Journal of Formal Logic 27 (1):39-50.

View all 8 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Beth-Closure of L(Qα) is Not Finitely Generated.Lauri Hella & Kerkko Luosto - 1992 - Journal of Symbolic Logic 57 (2):442 - 448.
A Double Arity Hierarchy Theorem for Transitive Closure Logic.Martin Grohe & Lauri Hella - 1996 - Archive for Mathematical Logic 35 (3):157-171.
Definability of Polyadic Lifts of Generalized Quantifiers.Lauri Hella, Jouko Väänänen & Dag Westerståhl - 1997 - Journal of Logic, Language and Information 6 (3):305-335.
Definability and Automorphisms in Abstract Logics.Xavier Caicedo - 2004 - Archive for Mathematical Logic 43 (8):937-945.
The Hierarchy Theorem for Second Order Generalized Quantifiers.Juha Kontinen - 2006 - Journal of Symbolic Logic 71 (1):188 - 202.
Henkin Quantifiers and the Definability of Truth.Tapani Hyttinen & Gabriel Sandu - 2000 - Journal of Philosophical Logic 29 (5):507-527.

Analytics

Added to PP index
2013-11-23

Total views
25 ( #434,562 of 2,445,467 )

Recent downloads (6 months)
1 ( #457,259 of 2,445,467 )

How can I increase my downloads?

Downloads

My notes