Skip to main content

The Logic of Large Enough

Boiten, Eerke and Grundy, Dan (2010) The Logic of Large Enough. In: Bolduc, Claude and Desharnais, Jules and Ktari, Béchir, eds. Mathematics of Program Construction 10th International Conference. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 182-196. ISBN 978-3-642-13320-6. E-ISBN 978-3-642-13321-3. (doi:10.1007/978-3-642-13321-3_5) (KAR id:30665)

PDF (The final publication is available at Author's Accepted Manuscript
Language: English
Click to download this file (143kB)
[thumbnail of The final publication is available at]
This file may not be suitable for users of assistive technology.
Request an accessible format
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: Book section
DOI/Identification number: 10.1007/978-3-642-13321-3_5
Uncontrolled keywords: determinacy analysis; Craig interpolants; calculational methods; asymptotics; generalised quantifiers
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Eerke Boiten
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: (The current URI for this page, for reference purposes)
Boiten, Eerke:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.