GLyC shares common interests in the following areas:
We are interested in the computational side of logics: complexity, expressive power, proof theory and model theory. Our focus is set on logics with interesting computational behaviour: modal and hybrid logics, multi-valued propositional logics and fuzzy-logics.
Algorithmic Randomness and Computability
We study the concept of random real as conceived by Martin-Löf and the Algorithmic Information Theory. In particular we investigate how this mathematical notion of randomness (and anti-randomness) relates to other concepts coming from classical Computability Theory. We also analyze several variations of randomness definitions.
Foundations of Quantum Computing
We study the relationship between the classic theory of computability, the quantum information processing and non locality.
Natural Language Processing
In general, our study lies in the broad area of computational linguistics and information extraction. In particular, problems that require some context sensitive information, parsing, lexical information, temporal reasoning and modeling, event change, and extraction of complex relations from scientific texts.