The Logic of Large Enough

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. Keywords. Calculational methods; asymptotics; generalised quantifiers.

• Type: Conference
• Year: 2010
• Where: MPC
• Authors: Eerke A. Boiten, Dan Grundy
• Keywords: Asymptotic Reasoning, Calculational Properties, Large Enough, Mathematics, MPC 2010