A decision procedure for linear “big o” equations

Abstract

Let F be the set of functions from an infinite set, S, to an ordered ring, R

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
56 (#369,104)

6 months
10 (#361,262)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeremy Avigad
Carnegie Mellon University

Citations of this work

No citations found.

Add more citations

References found in this work

Principles of Constraint Programming.[author unknown] - 2006 - Bulletin of Symbolic Logic 12 (1):128-131.

Add more references