منابع مشابه
Quantifier-Free Boolean Algebra with Presburger Arithmetic is NP-Complete
Boolean Algebra with Presburger Arithmetic (BAPA) combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmetic operations (PA). BAPA can express the relationship between integer variables and cardinalities of unbounded finite sets and can be used to express verification conditions in verification of data structure consistency properties. In this report I cons...
متن کاملCategories and Quantum Informatics: Complete posivity
Up to now, we have only considered categorical models of pure states. But if we really want to take grouping systems together seriously as a primitive notion, we should also care about mixed states. This means we have to add another layer of structure to our categories. This chapter studies a beautiful construction with which we don’t have to step outside the realm of compact dagger categories ...
متن کاملEquational Properties of Iteration in Algebraically Complete Categories
We prove the following completeness theorem: If the fixed point operation over a category is defined by initial@, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.
متن کاملPolymorphic Quantifier
The generalized quantifier theory does not apply to Japanese quantifiers since: i) the number of NP argument is unspecified; and, ii) quantities are often expressed by predicative adjectives. The word order changes the interpretation, e.g., non-split quantifiers correspond to definite NPs with uniqueness and maximality conditions while split NPs are wide scope indefinites. This paper shows that...
متن کاملQuantifier Elimination
Quantifier elimination (QE) is a very powerful procedure for problems involving firstorder formulas over real fields. The cylindrical algebraic decomposition (CAD) is a technique for the “efficient” im plementation of QE, that effectively reduces an seemingly infinite problem into a finite (but potentially large) instance. For much more information about QE and CAD (including a reprint of Tar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 1976
ISSN: 0022-4049
DOI: 10.1016/0022-4049(76)90068-2