On the definability of the quantifier “there exist uncountably many”

Studia Logica 44 (3):257 - 264 (1985)
In paper [5] it was shown that a great part of model theory of logic with the generalized quantifier Q x = there exist uncountably many x is reducible to the model theory of first order logic with an extra binary relation symbol. In this paper we consider when the quantifier Q x can be syntactically defined in a first order theory T. That problem was raised by Kosta Doen when he asked if the quantifier Q x can be eliminated in Peano arithmetic. We answer that question fully in this paper.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00394445
 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: 16,658
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

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

14 ( #182,031 of 1,725,949 )

Recent downloads (6 months)

5 ( #134,160 of 1,725,949 )

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.