论文信息 - The Logic of Large Enough

The Logic of Large Enough

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.

Eerke A. Boiten | Dan Grundy

[1] Oded Goldreich. Foundations of Cryptography: Index , 2001 .

[2] Oded Goldreich,et al. Foundations of Cryptography: Volume 1, Basic Tools , 2001 .

[3] D. Grundy. Concepts and Calculation in Cryptography , 2008 .

[4] M. de Rijke. Advances in intensional logic , 1997 .

[5] A. Mostowski. On a generalization of quantifiers , 1957 .

[6] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .

[7] Johan van Benthem,et al. Modal quantification over structured domains , 1997 .

[8] Natasha Alechina,et al. Correspondence and Completeness for Generalized Quantifiers , 1995, Log. J. IGPL.

[9] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .

[10] Decidability of the Natural Numbers with the Almost-All Quantifier , 2006, math/0602415.

[11] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .

[12] Ernest W. Adams,et al. The logic of ‘Almost all’ , 1974, J. Philos. Log..