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

Studia Logica 44 (3):257 - 264 (1985)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,429

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
26 (#443,318)

6 months
1 (#416,470)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generalized Quantification as Substructural Logic.Natasha Alechina & Michiel Van Lambalgen - 1996 - Journal of Symbolic Logic 61 (3):1006 - 1044.

Add more citations

References found in this work

Add more references