Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

MPC
2010
Springer

favoriteEmaildiscussreport

157views Mathematics» more MPC 2010»

The Logic of Large Enough

13 years 9 months ago

The Logic of Large Enough

Download www.cs.kent.ac.uk

Abstract. In this paper we explore the “for large enough” quantiﬁer, also known as “all but ﬁnitely many”, which plays a central role in asymptotic reasoning, as used for example in complexity theory and cryptography. We investigate calculational properties of this quantiﬁer, and show their application in reasoning about limits of functions. Keywords. Calculational methods; asymptotics; generalised quantiﬁers.

Eerke A. Boiten, Dan Grundy

Real-time Traffic

Asymptotic Reasoning | Calculational Properties | Large Enough | Mathematics | MPC 2010 |

claim paper

Related Content

» B and D Are Enough to Make the HalpernShoham Logic Undecidable

» When price is not enough combining logical and numerical issues in bilateral negotiation

» Just enough tabling

» Component Testing Is Not Enough A Study of Software Faults in Telecom Middleware

» Planning with Sensing Actions and Incomplete Information Using Logic Programming

» A Logical Approach to Abstract Algebra

» When one Sample is not Enough Improving Text Database Selection Using Shrinkage

» Nonclairvoyant Batch Sets Scheduling Fairness Is Fair Enough

» Multipath Key Establishment for Wireless Sensor Networks Using JustEnough Redundancy Trans...

Post Info
More Details (n/a)

Added	20 Jul 2010
Updated	20 Jul 2010
Type	Conference
Year	2010
Where	MPC
Authors	Eerke A. Boiten, Dan Grundy

Comments (0)