The Logic of Large Enough

Boiten, Eerke Albert and Grundy, Dan (2010) The Logic of Large Enough. In: MPC 2010: Mathematics of Program Construction. (Full text available)

PDF (The final publication is available at - Author's Accepted Manuscript
Download (174kB) Preview
Official URL


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.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Faculties > Sciences > School of Computing > Security Group
Depositing User: E.A. Boiten
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 07 Aug 2018 09:32 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke Albert:
  • Depositors only (login required):


Downloads per month over past year