Login / Signup
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages.
Domenico Cantone
Pietro Maugeri
Eugenio G. Omodeo
Published in:
Theor. Comput. Sci. (2023)
Keyphrases
</>
polynomial hierarchy
set theory
first order logic
expressive power
algebraic geometry
knowledge representation
dnf formulas
transitive closure
fuzzy set theory
boolean functions
rough set theory
theoretical framework
binary images
rough sets
multiscale
propositional logic
computer vision
test cases