Natural Density and the Quantifier “Most”

Journal of Logic, Language and Information 29 (4):511-523 (2020)
  Copy   BIBTEX

Abstract

This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or majority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of \. There are two widely used semantics for Most A are B: \ > C \) and \ > \dfrac{C}{2} \), where C denotes the cardinality of a given finite set X. Although is more descriptive than, it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpretation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of \, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

External links

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

Through your library

Similar books and articles

Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Quantifier Elimination for Neocompact Sets.H. Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Generalized Quantifiers and Measure Theory.Charles William Kurtz - 1996 - Dissertation, Syracuse University
Ω-powers and descriptive set theory.Dominique Lecomte - 2005 - Journal of Symbolic Logic 70 (4):1210-1232.
On series of ordinals and combinatorics.James P. Jones, Hilbert Levitz & Warren D. Nichols - 1997 - Mathematical Logic Quarterly 43 (1):121-133.
Indeterminacy of fair infinite lotteries.Philip Kremer - 2014 - Synthese 191 (8):1757-1760.
Two consistency results on set mappings.Péter Komjáth & Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (1):333-338.

Analytics

Added to PP
2020-01-04

Downloads
20 (#770,420)

6 months
5 (#646,314)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Most-intersection of countable sets.Ahmet Çevik & Selçuk Topal - 2021 - Journal of Applied Non-Classical Logics 31 (3-4):343-354.

Add more citations

References found in this work

Begriffsschrift.Gottlob Frege - 1967 - In Jean Van Heijenoort (ed.), From Frege to Gödel. Cambridge,: Harvard University Press. pp. 1-83.
What is a syllogism?Timothy J. Smiley - 1973 - Journal of Philosophical Logic 2 (1):136 - 154.
Completeness of an ancient logic.John Corcoran - 1972 - Journal of Symbolic Logic 37 (4):696-702.
Begriffsschrift, a Formula Language, Modeled upon that of Arithmetic, for Pure Thought [1879].Gottlob Frege - 1879 - From Frege to Gödel: A Source Book in Mathematical Logic 1931:1--82.

View all 31 references / Add more references