It it shown that geometric morphisms between elementary toposes can be represented as certain adjunctions between the corresponding categories of locales. These adjunctions are ch...
It is known to be NP-hard to decide whether a graph can be made chordal by the deletion of k vertices or by the deletion of k edges. Here we present a uniformly polynomial-time alg...
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
Ekaterina B. Fokina, Iskander Sh. Kalimullin, Russ...