Login / Signup
The existence of a near-unanimity term in a finite algebra is decidable.
Miklós Maróti
Published in:
J. Symb. Log. (2009)
Keyphrases
</>
function symbols
real numbers
query language
first order logic
logic programs
datalog programs
algebraic geometry
data model
relational algebra
finite number
complementarity problems
database
expressive power
regularization term
algebraic structure
algebraic expressions