• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 550
Next 10 →

Quantifier Elimination over Finite Fields Using Gröbner Bases

by Sicun Gao, Andre Platzer, Edmund M. Clarke , 2011
"... We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gröbner basis meth-ods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complex-ity of the algo ..."
Abstract - Add to MetaCart
We give an algebraic quantifier elimination algorithm for the first-order theory over any given finite field using Gröbner basis meth-ods. The algorithm relies on the strong Nullstellensatz and properties of elimination ideals over finite fields. We analyze the theoretical complex-ity

PRIME QUANTIFIER ELIMINABLE RINGS

by Bruce I. Rose
"... The main result of this paper is that a prime ring with a finite center which admits elimination of quantifiers must be finite. This answers a question raised by the author [10; p. 99] and completes the classification of prime rings which admit elimination of quantifiers. That is, a prime ring admit ..."
Abstract - Add to MetaCart
admits elimination of quantifiers if and only if it is either an algebraically closed field, a finite field, or a 2 x 2 matrix ring over a finite prime field. Two features of this proof merit mentioning in this introduction. In [11] Rose and Woodrow developed the concept of ultrahomogeneity as distinct

Real Quantifier Elimination in the RegularChains Library

by Changbo Chen, Marc Moreno Maza
"... www.csd.uwo.ca/∼moreno Abstract. Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is one of the main tools for handling quantifier elimination of nonlinear input formulas. Despite of its worst case doubly exponential compl ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
www.csd.uwo.ca/∼moreno Abstract. Quantifier elimination (QE) over real closed fields has found numerous applications. Cylindrical algebraic decomposition (CAD) is one of the main tools for handling quantifier elimination of nonlinear input formulas. Despite of its worst case doubly exponential

Billiard Arrays and finite-dimensional

by Paul Terwilliger
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Understanding Algebro-Geometric Quantifier Elimination: Part I, Algebraically Closed Fields of Characteristic Zero via Muchnik

by Grant Olney Passmore
"... In this short expository note, we present a self-contained proof that algebraically closed fields of characteristic zero admit elimination of quantifiers over the elementary language of rings. We do this by fleshing out a method due to Muchnik 1 (and possibly Cohen 2). This note is the first part of ..."
Abstract - Add to MetaCart
In this short expository note, we present a self-contained proof that algebraically closed fields of characteristic zero admit elimination of quantifiers over the elementary language of rings. We do this by fleshing out a method due to Muchnik 1 (and possibly Cohen 2). This note is the first part

Expressing cardinality quantifiers in monadic second-order logic over chains

by Vince Bárány , Łukasz Kaiser , Alex Rabinovich - J. Symb. Log
"... Abstract. We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Addi ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over finitely branching trees, which is notable for not all of these classes are analytic. Our approach is based on Shelah's composition method and uses basic results from descriptive set

Relative Motives and the Theory of Pseudo-finite Fields

by Johannes Nicaise
"... We generalize the motivic incarnation morphism from the theory of arithmetic integration to the relative case, where we work over a base variety S over a field k of characteristic zero. We develop a theory of constructible effective Chow motives over S, and we show how to associate a motive to any ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
to any S-variety. We give a geometric proof of relative quantifier elimination for pseudo-finite fields, and we construct a morphism from the Grothendieck ring of the theory of pseudo-finite fields over S, to the tensor product of Q with the Grothendieck ring of constructible effective Chow motives

3 ON THE MAXIMUM ORDERS OF ELEMENTS OF FINITE ALMOST SIMPLE GROUPS AND PRIMITIVE PERMUTATION GROUPS

by Simon Guest, Joy Morris, Cheryl E. Praeger, Pablo Spiga
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

J. London Math. Soc. (2) 75 (2007) 545–562 C2007 London Mathematical Society doi:10.1112/jlms/jdm033 ON BASE SIZES FOR ACTIONS OF FINITE CLASSICAL GROUPS

by Timothy C. Burness
"... Let G be a finite almost simple classical group and let Ω be a faithful primitive non-standard G-set. A subset of Ω is a base for G if its pointwise stabilizer in G is trivial. Let b(G) be the minimal size of a base for G. A well-known conjecture of Cameron and Kantor asserts that there exists an ab ..."
Abstract - Add to MetaCart
an absolute constant c such that b(G) c for all such groups G, and the existence of such an undetermined constant has been established by Liebeck and Shalev. In this paper we prove that either b(G) 4, or G = U6(2) · 2, Gω = U4(3) · 22 and b(G) = 5. The proof is probabilistic, using bounds on fixed

Solving mixed quantified constraints over a domain based on real numbers and Herbrand terms

by Miguel García-díaz, Susana Nieva, Dpto Sistemas, Informáticos Programación , 2001
"... Abstract. Combining the logic of hereditary Harrop formulas HH with a constraint system, a logic programming language is obtained that extends Horn clauses in two different directions, thus enhancing substantially the expressivity of Prolog. The implementation of this new language requires the abili ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
, based on elimination of quantifiers, one used for solving unification and disunification problems, the other used to solve polynomials. This combination provides a procedure to solve RH-constraints in the context of HH with constraints.
Next 10 →
Results 1 - 10 of 550
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University