The Logic of Large Enough.

Bibliographic Details
Title: The Logic of Large Enough.
Authors: Boiten, Eerke, Grundy, Dan
Source: Mathematics of Program Construction (9783642133206); 2010, p42-57, 16p
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. [ABSTRACT FROM AUTHOR]
Copyright of Mathematics of Program Construction (9783642133206) is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/978-3-642-13321-3_5
Database: Complementary Index