The Logic of Large Enough

Boiten, Eerke 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 link.springer.com) - Accepted Version
Download (143kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2010/3005

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: 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 > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Faculties > Science Technology and Medical Studies > School of Computing > Security Group
Depositing User: Eerke Boiten
Date Deposited: 21 Sep 2012 09:49
Last Modified: 12 Dec 2013 11:30
Resource URI: http://kar.kent.ac.uk/id/eprint/30665 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year