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)

PDF (The final publication is available at link.springer.com) - Author's Accepted Manuscript
Download (174kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1007/978-3-642-13321-3_5

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.

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: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Faculties > Sciences > School of Computing > Security Group
Depositing User: E. Boiten
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 15 Oct 2019 14:20 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30665 (The current URI for this page, for reference purposes)
Boiten, Eerke: https://orcid.org/0000-0002-9184-8968
  • Depositors only (login required):

Downloads

Downloads per month over past year