We identify the locally finite graphs that are quantifier-eliminable and their first order theories in the signature of distance predicates.
Canonical Finite Diagrams and Quantifier Elimination
β Scribed by Tapani Hyttinen
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 290 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We provide some consequences of a Quantifier Elimination Property and related properties previously introduced (see [4]) in the setting of Banach space structures. We further consider some applications of quantifierfree definability, such as strict convexity via the definability of cert
In this note symbolic-computation methods are used to design simple, "xed-structure, robust controllers for nonlinear systems. Design speci"cations are reduced to logically quanti"ed polynomial inequalities. The quanti"er-elimination (QE) software package QEPCAD is used to eliminate quanti"ers on st
Edited By Dale Jacquette. Includes Bibliographical References And Index.
## Abstract The theory of algebraically closed nonβArchimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this pape