Charles Explorer logo
🇨🇿

Expansions of pseudofinite structures and circuit and proof complexity

Publikace na Matematicko-fyzikální fakulta |
2016

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of a particular relevance to computational complexity.