. "Theorems about proof complexity of the propositional calculus, about bounded arithmetic theories and about the complexity of boolean circuits were proved. New algorithms for on-line scheduling and analyzed their complexity were found."@en . " computational complexity" . . "Jedn\u00E1 se o teoretick\u00FD v\u00FDzkum v matematice a teoretick\u00E9 informatice. Hlavn\u00EDm c\u00EDlem je studovat pojem v\u00FDpo\u010Detn\u00ED slo\u017Eitosti z n\u011Bkolika hledisek: 1. teorii prvn\u00EDho \u0159\u00E1du, 2. v\u00FDrokov\u00E9ho po\u010Dtu a 3. booleovsk\u00FDch obvod\u016F. Konkr\u00E9tn\u011B se jedn\u00E1 o studium omezen\u00E9 aritmetiky, slo\u017Eitosti d\u016Fkaz\u016F ve v\u00FDrokov\u00E9m po\u010Dtu a r\u016Fzn\u00FDch v\u00FDpo\u010Detn\u00EDch model\u016F. Budeme zkoumat tak\u00E9 souvisej\u00EDc\u00ED ot\u00E1zky logick\u00FDch z\u00E1klad\u016F matematiky a teorie mno\u017Ein." . . "Teorie, d\u016Fkazy a v\u00FDpo\u010Detn\u00ED slo\u017Eitost" . . "Byly dok\u00E1z\u00E1ny v\u011Bty o d\u016Fkazov\u00E9 slo\u017Eitosti v\u00FDrokov\u00E9ho po\u010Dtu, o teori\u00EDch omezen\u00E9 aritmetiky a slo\u017Eitosti booleovsk\u00FDch obvod\u016F. Byly nalezeny nov\u00E9 algoritmy pro on-line rozvrhov\u00E1n\u00ED a analyzovali jsme jejich slo\u017Eitost."@cs . . "This is a purely tehoretical research in mathematics and theoretical computer science. The main aim is to study the concept of computational complexity from several points of view:1. first order tehories, 2. the propositional calculus and 3. voolean circuits. MOre specifically, we will study Bounded Arithmetic, the complexity of proofs in propositional calculus and various computational models. Furthermore, we shall investigate related questions in the foundations of mathematics and set theory."@en . "Theories, proofs and computational complexity"@en . . . "http://www.isvav.cz/projectDetail.do?rowId=IAA1019401"^^ . "0"^^ . . "1"^^ . " propositional calculus" . . . . "68"^^ . "logic" . . "68"^^ . . "logic; propositional calculus; computational complexity; set theory"@en . "0"^^ . . "2008-02-21+01:00"^^ . "2009-07-02+02:00"^^ . "2004-01-01+01:00"^^ . . . . "IAA1019401" . . "2008-12-31+01:00"^^ .