The Beth-closure of l(qα) is not finitely generated

Journal of Symbolic Logic 57 (2):442 - 448 (1992)
We prove that if ℵα is uncountable and regular, then the Beth-closure of Lωω(Qα) is not a sublogic of L∞ω(Qn), where Qn is the class of all n-ary generalized quantifiers. In particular, B(Lωω(Qα)) is not a sublogic of any finitely generated logic; i.e., there does not exist a finite set Q of Lindstrom quantifiers such that B(Lωω(Qα)) ≤ Lωω(Q)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275278
 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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,215
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 Generalized Quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235-271.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

11 ( #400,818 of 2,164,577 )

Recent downloads (6 months)

1 ( #347,948 of 2,164,577 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums