• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

The first-order theory of the computably enumerable equivalence relations in the uncountable setting.

Uri AndrewsSteffen LemppManat MustafaNoah David Schweber
Published in: J. Log. Comput. (2022)
Keyphrases
  • equivalence relation
  • numerical data
  • expert systems
  • rough set theory
  • genetic algorithm
  • first order logic
  • concept lattice
  • granular computing