Login / Signup

Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices.

Klaus Ambos-SpiesPeter A. FejerSteffen LemppManuel Lerman
Published in: J. Symb. Log. (1996)
Keyphrases
  • truth table
  • query answering
  • boolean functions
  • recursive functions
  • machine learning
  • feature space
  • lower bound
  • description logics
  • inductive inference