Mathematical logic, complexity, and algorithms
Project goals
Project of basic research in mathematical logic and theoretical computer science. We focus on bounded arithmetic and proof complexity, set theory, computational complexity theory, and the theory of algorithms. The topics range from foundational areas ofmathematics to algorithmic problems motivated by applied research. The results of the project will be published in high quality international scientific journals and in the proceedings of selective conferences.
Keywords
theoretical computer sciencemathematical logicset theoryproof complexitycomputational complexitytheory of algorithmsscheduling
Public support
Provider
Academy of Sciences of the Czech Republic
Programme
Grants of distinctly investigative character focused on the sphere of research pursued at present particularly in the Academy of Sciences of the Czech Republic
Call for proposals
Výzkumné granty 9 (SAV02009-A)
Main participants
—
Contest type
VS - Public tender
Contract ID
IAA100190902
Alternative language
Project name in Czech
Matematická logika, složitost a algoritmy
Annotation in Czech
Projekt základního výzkumu v matematické logice a teoretické informatice. Soustředíme se na omezenou aritmetiku a důkazovou složitost, teorii množin, teorii výpočetní složitosti a teorii algoritmů. Témata výzkumu sahají od oblastí základů matematiky až po algoritmické problémy motivované aplikovaným výzkumem. Výsledky projektu budou publikovány v kvalitních zahraničních časopisech a sbornících předních výběrových konferencí v oboru.
Scientific branches
R&D category
ZV - Basic research
CEP classification - main branch
BA - General mathematics
CEP - secondary branch
IN - Informatics
CEP - another secondary branch
—
10101 - Pure mathematics
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Completed project evaluation
Provider evaluation
V - Vynikající výsledky projektu (s mezinárodním významem atd.)
Project results evaluation
The project has reached many new results in logic and theoretical computer science in the areas of bounded arithmetic, set theory, computational complexity and theorz of algorithms. 3 monographs and more than 90 articles were published.
Solution timeline
Realization period - beginning
Jan 1, 2009
Realization period - end
Dec 31, 2013
Project status
U - Finished project
Latest support payment
Feb 27, 2013
Data delivery to CEP
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data delivery code
CEP14-AV0-IA-U/01:1
Data delivery date
Apr 14, 2014
Finance
Total approved costs
5,509 thou. CZK
Public financial support
5,509 thou. CZK
Other public sources
0 thou. CZK
Non public and foreign sources
0 thou. CZK
Basic information
Recognised costs
5 509 CZK thou.
Public support
5 509 CZK thou.
100%
Provider
Academy of Sciences of the Czech Republic
CEP
BA - General mathematics
Solution period
01. 01. 2009 - 31. 12. 2013