Back-and-forth systems for generic curves and a decision algorithm for the limit theory

Annals of Pure and Applied Logic 111 (3):257-275 (2001)
  Copy   BIBTEX

Abstract

It was recently shown that the theories of generic algebraic curves converge to a limit theory as their degrees go to infinity. In this paper we give quantitative versions of this result and other similar results. In particular, we show that generic curves of degree higher than 22r cannot be distinguished by a first-order formula of quantifier rank r. A decision algorithm for the limit theory then follows easily. We also show that in this theory all formulas are equivalent to boolean combinations of existential formulas, and give a quantitative version of this result

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Similar books and articles

Limitations of theorie of generic curves.O. Chapuis, E. Hrushovski, P. Koiran & B. Poizat - 2002 - Journal of Symbolic Logic 67 (1):24-34.
Belief system foundations of backward induction.Antonio Quesada - 2002 - Theory and Decision 53 (4):393-403.
Dialectics and systems theory.Richard Levins - 2008 - In Bertell Ollman & Tony Smith (eds.), Science and Society. Palgrave-Macmillan. pp. 375 - 399.
Limit theorems for Dempster's rule of combination.John Norton - 1988 - Theory and Decision 25 (3):287-313.
Changing the theory of theory change: Towards a computational approach.Neil Tennant - 1994 - British Journal for the Philosophy of Science 45 (3):865-897.
Luhmann’s Judgment.Claudius Messner - 2014 - International Journal for the Semiotics of Law - Revue Internationale de Sémiotique Juridique 27 (2):359-387.
Common knowledge and limit knowledge.Christian W. Bach & Jérémie Cabessa - 2012 - Theory and Decision 73 (3):423-440.
Identification in the limit of categorial grammars.Makoto Kanazawa - 1996 - Journal of Logic, Language and Information 5 (2):115-155.

Analytics

Added to PP
2014-01-16

Downloads
24 (#642,030)

6 months
14 (#170,561)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Analytic Zariski structures and the Hrushovski construction.Nick Peatfield & Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (2):127-180.
The theory of liouville functions.Pascal Koiran - 2003 - Journal of Symbolic Logic 68 (2):353-365.
Raising to powers revisited.Boris Zilber - 2005 - Annals of Pure and Applied Logic 132 (1):67-95.

Add more citations

References found in this work

Add more references