120views more  LOGCOM 2010»
13 years 4 months ago
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
Franco Montagna, Carles Noguera
100views Communications» more  ITA 2006»
13 years 5 months ago
Sequences of low arithmetical complexity
Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of l...
Sergey V. Avgustinovich, Julien Cassaigne, Anna E....