Location of Repository

The Logic of Large Enough

By Eerke Albert Boiten and Dan Grundy

Abstract

In this paper we explore the "for large enough" quantifier, also known\ud as "all but finitely many", which plays a central role in asymptotic\ud reasoning, as used for example in complexity theory and cryptography. We\ud investigate calculational properties of this quantifier, and show their\ud application in reasoning about limits of functions

Topics: QA76
Publisher: Springer
Year: 2010
OAI identifier: oai:kar.kent.ac.uk:30665

Suggested articles

Preview

Citations

  1. (2008). Concepts and Calculation in Cryptography.
  2. (1994). Concrete Mathematics. Second Edition.
  3. (1995). Correspondence and completeness for generalized quantifiers.
  4. (2006). Decidability of the natural numbers with the almost-all quantifier
  5. (2001). Foundations of Cryptography: Volume I Basic Tools.
  6. (1997). Modal quantification over structured domains.
  7. (1957). On a generalization of quantifiers.
  8. (1974). The logic of ‘almost all’.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.