Institute of Computer Science

The Czech Academy of Sciences

The Czech Academy of Sciences

"The problems of the real world are primarily those you are left with when you refuse to apply their effective solutions." - E. W. Dijkstra

Members of our department are mainly active in three interlinked foundational disciplines of theoretical computer science: mathematical logic, computational complexity, discrete mathematics.

**Theoretical computer science, **or** TCS**, makes use of mathematical methods to describe, understand and analyze various aspects of computing and computer science in general.

The ever growing computational power of computers increases the size of problems computer science can and wants to address and presents new challenges. New effective methods for processing, structuring, describing, and reasoning with real-life information/data are developed and TCS aims not only at being part of this development but also at providing a deeper understanding of underlying foundational phenomena.

*Logic: *developing and applying non-classical logics for reasoning, in both natural and artificial scenarios, with real-life information, which is often uncertain, graded, or even contradictory and changing in time.

*Computational complexity:* deepening our knowledge of relations between complexity classes and investigating standard and non-standard computational models considering both the usual complexity measures like time and space and new ones related to current technological challenges.

*Discrete mathematics: *exploring extremal graph theory and applied number theory and using the achieved results in cryptography, theory of computing, and the study of randomness.

To pursue our vision we do frontier foundational research with the aim to broaden the repertoire of approaches that are considered standard in our respective areas. Our present research focus can be best described by the following keywords:

*Logic: *Mathematical Fuzzy Logic, Substructural Logics, Vagueness, Paraconsistent Logic, Logic and Reasoning, Graded notions, Dynamic and Non-Monotonic Logic, Modal Logic, Abstract Algebraic Logic, Complexity of Non-Classical Logics

*Computational complexity: *Branching Programs, Neural Networks, Boolean Functions, SAT Problem Preprocessing, Logical Descriptions of Computation, Non-Standard Positional Numeral Systems

*Discrete mathematics:* Extremal Graph Theory, Regularity Method, Probabilistic Method, Limits of Graphs, Random Graphs, Combinatorial and Algebraic Methods in Number Theory, Uniform Distribution of Numerical Sequences, Cryptology

- Our department organizes jointly with the Czech Society for Cybernetics and Informatics a seminar on applied mathematical logic (also called Hájek’s seminar according to its founder) which regularly takes place since the late 1960’s. The program can be found here.
- We are organising a graph theory seminar with emphasis on extremal graph theory. The program can be found here.

- Enhancing human resources for research in theoretical computer science
- Center of Excellence – Institute for Theoretical Computer Science
- Extremal graph theory and applications
- Predicate graded logics and their applications to computer science
- Non-classical Logical Models of Information Dynamics
- Reasoning with Graded Properties

- Kučera Petr; Savický Petr; Vorel Vojtěch. A lower bound on CNF encodings of the at-most-one constraint. Theoretical Computer Science, 2018
- Šíma Jiří; Savický Petr. Quasi-periodic β – expansions and cut languages. Theoretical Computer Science, 2018
- Bezhanishvili Guram; Moraschini Tommaso; Raftery James Gordon. Epimorphisms in Varieties of Residuated Structures. Journal of Algebra, 2017
- Cabello Sergio; Cibulka Josef; Kynčl Jan; Saumell Maria; Valtr Pavel. Peeling Potatoes Near-Optimally in Near-Linear Time, SIAM Journal on Computing, 2017
- Moraschini Tommaso. A Computational Glimpse at the Leibniz and Frege Hierarchies. Annals of Pure and Applied Logic, 2017
- Šíma Jiří; Žák Stanislav. On tight separation for Blum measures applied to Turing machine buffer complexity. Fundamenta Informaticae, 2017
- Böttcher Julia; Hladký Jan; Piguet Diana; Taraz Anusch. An approximate version of the tree packing conjecture. Israel Journal of Mathematics, 2016
- Haniková Zuzana; Savický Petr. Term satisfiability in FLew-algebras, Theoretical Computer Science 31, 2016
- Hladký Jan; Piguet Diana; Simonovits Miklos; Stein Maya; Szemeredi Endre. The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs. Electronic Research Announcements in Mathematical Sciences, 2016
- Hladký Jan; Piguet Diana. Loebl-Komlos-Sos Conjecture: dense case, Journal of Combinatorial Theory, 2016
- Chvalovský Karel; Horčík Rostislav. Full Lambek Calculus with Contraction is Undecidable. Journal of Symbolic Logic, 2016
- Moraschini Tommaso. The Semantic Isomorphism Theorem in Abstract Algebraic Logic. Annals of Pure and Applied Logic, 2016
- Strauch Oto; Porubský Štefan. Distribution of Sequences: A Sampler. Peter Lang GmbH, Electronic revised version December 8, 2016
- Cintula Petr (ed.); Fermüller C. (ed.); Hájek Petr (ed.), Noguera Carles (ed.). Handbook of Mathematical Fuzzy Logic (in three volumes). London: College Publications, 2011, 2015
- Cintula Petr; Noguera Carles. A Henkin-Style Proof of Completeness for First-Order Algebraizable Logics. Journal of Symbolic Logic, 2015
- Chvalovský Karel. Undecidability of consequence relation in Full Non-associative Lambek Calculus. Journal of Symbolic Logic, 2015
- Horčík Rostislav. Word Problem for Knotted Residuated Lattices. Journal of Pure and applied Algebra, 2015

- Prague Gathering of Logicians and Beauty of Logic 2018
- 23rd Czech and Slovak International Conference on Number Theory 2017
- Topology, Algebra, and Categories in Logic 2017
- Non-classical Modal and Predicate Logics 2017
- Prague seminar: The Future of Mathematical Fuzzy Logic 2016
- Prague Gathering of Logicians 2015
- Prague seminar on Non-Classical Mathematics 2015
- 4th International Conference on Uniform Distribution Theory 2014
- Prague Seminar on Substructural Logics 2014
- 2nd Prague Symposium on Semilinear Logics 2013
- 21st Czech and Slovak International Conference on Number Theory 2013
- Gathering of Prague-Based Logicians 2013
- Manyval 2013
- ALANT Joint Conferences on Algebra, Logic and Number Theory 2012
- 20th Czech and Slovak International Conference on Number Theory 2011
- Logic, Algebra and Truth Degrees 2010
- 19th Czech and Slovak International Conference on Number Theory 2009
- 9th Central European Conference on Cryptography 2009
- 5th Polish, Slovak and Czech Conference on Number Theory 2004

- Bílková Marta, Mgr., Ph.D.
- Cintula Petr, doc.Ing., Ph.D.
- Haniková Zuzana, RNDr., Ph.D.
- Harmancová Dagmar, prom.mat.
- Kubíková Iveta, Ing.
- Majer Ondrej, RNDr., CSc.
- Moraschini Tommaso
- Piguet Diana, Mgr., Ph.D.
- Porubský Štefan, prof. RNDr., DrSc.
- Punčochář Vít, Ph.D.
- Reggio Luca, Ph.D.
- Rocha De Souza Israel, Dr., Ph.D.
- Saumell Mendiola Maria, Ph.D.
- Savický Petr, RNDr., CSc.
- Sedlár Igor, Mgr., Ph.D.
- Šileikis Matas, Ph.D.
- Šíma Jiří, doc. RNDr., DrSc.
- Tedder Andrew, Ph.D.
- Vidal Wandelmer Amanda, Ph.D.
- Žák Stanislav, RNDr., CSc.