The logic of large enough

  • Authors:

  • Eerke Boiten;Dan Grundy

  • Affiliations:

  • Computing Laboratory, University of Kent;Computing Laboratory, University of Kent

  • Venue:
  • MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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