Article
Licensed
Unlicensed
Requires Authentication
Complexity of the Decidability of One Class of Formulas in Quantifier-Free Set Theory with a Set-Union Operator
-
M. Tetruashvili
Published/Copyright:
February 23, 2010
Abstract
We consider the quantifier-free set theory MLSUn containing the symbols U, \, =, ∈, Un. Un(p) is interpreted as the union of all members of the set p. It is proved that there exists an algorithm which for any formula Q of the MLSUn theory containing at most one occurrence of the symbol Un decides whether Q is true or not using the space cn3 log2n (n is the length of Q).
Received: 1993-12-23
Published Online: 2010-02-23
Published in Print: 1996-February
© 1996 Plenum Publishing Corporation
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Commutativity for a Certain Class of Rings
- Partial Averaging for Impulsive Differential Equations with Supremum
- An Algebraic Model of Fibration with the Fiber K(π, n)-Space
- On the Uniqueness of Maximal Functions
- On the Solvability of a Darboux Type Non-Characteristic Spatial Problem for the Wave Equation
- Littlewood–Paley Operators on the Generalized Lipschitz Spaces
- On Strong Maximal Operators Corresponding to Different Frames
- Complexity of the Decidability of One Class of Formulas in Quantifier-Free Set Theory with a Set-Union Operator
Articles in the same Issue
- Commutativity for a Certain Class of Rings
- Partial Averaging for Impulsive Differential Equations with Supremum
- An Algebraic Model of Fibration with the Fiber K(π, n)-Space
- On the Uniqueness of Maximal Functions
- On the Solvability of a Darboux Type Non-Characteristic Spatial Problem for the Wave Equation
- Littlewood–Paley Operators on the Generalized Lipschitz Spaces
- On Strong Maximal Operators Corresponding to Different Frames
- Complexity of the Decidability of One Class of Formulas in Quantifier-Free Set Theory with a Set-Union Operator
