Login / Signup
The Complexity of Index Sets of Classes of computably Enumerable Equivalence Relations.
Uri Andrews
Andrea Sorbi
Published in:
J. Symb. Log. (2016)
Keyphrases
</>
equivalence relation
binary relations
rough sets
upper approximation
neural network
information systems
rough set theory
granular computing
numerical data
set theoretic
decision making
approximation spaces
rough set approximations