Graduate studies at Western
Journal of Symbolic Logic 63 (4):1442-1472 (1998)
|Abstract||We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results|
|Keywords||Elimination Quantifier Neocompact|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Jörg Flum, Matthias Schiehlen & Jouko Väänänen (1999). Quantifiers and Congruence Closure. Studia Logica 62 (3):315-340.
Bruce I. Rose (1978). Rings Which Admit Elimination of Quantifiers. Journal of Symbolic Logic 43 (1):92-112.
Michiel Van Lambalgen (1990). The Axiomatization of Randomness. Journal of Symbolic Logic 55 (3):1143 - 1167.
Arnon Avron & Anna Zamansky, A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-Deterministic Semantics.
Franco Montagna (2012). Δ-Core Fuzzy Logics with Propositional Quantifiers, Quantifier Elimination and Uniform Craig Interpolation. Studia Logica 100 (1-2):289-317.
Tommaso Cortonesi, Enrico Marchioni & Franco Montagna (2010). Quantifier Elimination and Other Model-Theoretic Properties of BL-Algebras. Notre Dame Journal of Formal Logic 52 (4):339-379.
Jeremy Avigad & Yimu Yin, Quantifier Elimination for the Reals with a Predicate for the Powers of Two.
Oleg Belegradek (2004). Semi-Bounded Relations in Ordered Modules. Journal of Symbolic Logic 69 (2):499 - 517.
Nicolas Guzy (2006). 0-D-Valued Fields. Journal of Symbolic Logic 71 (2):639 - 660.
Ítala M. L. D'Ottaviano (1987). Definability and Quantifier Elimination for J3-Theories. Studia Logica 46 (1):37 - 54.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,948 of 733,136 )
Recent downloads (6 months)0
How can I increase my downloads?