On Sets $forall$-Definable From Pfaffian Functions

Journal of Symbolic Logic 57 (2):688-697 (1992)
  Copy   BIBTEX

Abstract

We prove the existence of a bound to the number of components of an $\forall$-definable set in the reals, using Pfaffian functions, and give some applications

Categories

Keywords

Reprint years

DOI

10.2307/2275301

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

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

Through your library

My notes

Similar books and articles

On sets ∀-definable from Pfaffian functions.Ricardo Bianconi - 1992 - Journal of Symbolic Logic 57 (2):688-697.
Mildness and the Density of Rational Points on Certain Transcendental Curves.G. O. Jones, D. J. Miller & M. E. M. Thomas - 2011 - Notre Dame Journal of Formal Logic 52 (1):67-74.
A proof-theoretic characterization of the primitive recursive set functions.Michael Rathjen - 1992 - Journal of Symbolic Logic 57 (3):954-969.
Degrees of difficulty of generalized r.e. separating classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.
Topological properties of sets definable in weakly o-minimal structures.Roman Wencel - 2010 - Journal of Symbolic Logic 75 (3):841-867.
Admissible closures of polynomial time computable arithmetic.Dieter Probst & Thomas Strahm - 2011 - Archive for Mathematical Logic 50 (5):643-660.
A version of p-adic minimality.Raf Cluckers & Eva Leenknegt - 2012 - Journal of Symbolic Logic 77 (2):621-630.
Noetherian varieties in definably complete structures.Tamara Servi - 2008 - Logic and Analysis 1 (3-4):187-204.
Lifting independence results in bounded arithmetic.Mario Chiari & Jan Krajíček - 1999 - Archive for Mathematical Logic 38 (2):123-138.
A small reflection principle for bounded arithmetic.Rineke Verbrugge & Albert Visser - 1994 - Journal of Symbolic Logic 59 (3):785-812.
Minimal realizability of intuitionistic arithmetic and elementary analysis.Zlatan Damnjanovic - 1995 - Journal of Symbolic Logic 60 (4):1208-1241.
Elementary equivalence of some rings of definable functions.Vincent Astier - 2008 - Archive for Mathematical Logic 47 (4):327-340.
Cell decomposition for semibounded p-adic sets.Eva Leenknegt - 2013 - Archive for Mathematical Logic 52 (5-6):667-688.
Epistemic Operators in Dependence Logic.Pietro Galliani - 2013 - Studia Logica 101 (2):367-397.

Analytics

Added to PP
2013-11-22

Downloads
5 (#1,557,834)

6 months
1 (#1,508,411)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references