. . "bounded arithmetic" . "0"^^ . "2004-10-13+02:00"^^ . . "Matematick\u00E1 logika a v\u00FDpo\u010Detn\u00ED slo\u017Eitost" . . "We plan to work in the following related areas: the complexity of propositional calculus, bounded arithmetic, circuit complexity, communication complexity, efficient algorithms, on-line algorithms, higher-order arithmetic and set theory, and model theory of fields. The areas both overlap in results and use same or similar methods. The main aim is to gain better understanding of the phenomenon of complexity. The output will be scientific publications."@en . . . "IAA1019901" . " set theory" . . . " computational complexity" . "Pl\u00E1nujeme pracovat v n\u00E1sleduj\u00EDc\u00EDch souvisej\u00EDc\u00EDch oblastech: slo\u017Eitost v\u00FDrokov\u00FDch kalkul\u016F, omezen\u00E1 aritmetika, obvodov\u00E1 slo\u017Eitost, komunika\u010Dn\u00ED slo\u017Eitost, efektivn\u00ED algoritmy, on-line algoritmy, aritmetika vy\u0161\u0161\u00EDho \u0159\u00E1du a teorie mno\u017Ein a teorie model\u016F t\u011Bles. Tyto oblasti se jak p\u0159ekr\u00FDvaj\u00ED ve v\u00FDsledc\u00EDch, tak pou\u017E\u00EDvj\u00ED stejn\u00E9 \u010Di podobn\u00E9 metody. Hlavn\u00ED c\u00EDl je z\u00EDskat lep\u0161\u00ED porozum\u011Bn\u00ED pro fenom\u00E9n slo\u017Eitosti. V\u00FDstupem budou v\u011Bdeck\u00E9 publikace v kvalitn\u00EDch \u010Dasopisech a sborn\u00EDc\u00EDch konferenc\u00ED." . . "52"^^ . "bounded arithmetic; set theory; computational complexity; proof complexity"@en . "0"^^ . "52"^^ . . "http://www.isvav.cz/projectDetail.do?rowId=IAA1019901"^^ . . . . "1"^^ . "Mathematical logic and computational complexity"@en . . . "V\u00FDsledky se t\u00FDkaj\u00ED komunika\u010Dn\u00ED slo\u017Eitosti, slo\u017Eitosti obvod\u016F, slo\u017Eitosti v\u00FDrokov\u00FDch d\u016Fkaz\u016F, konservativnosti v omezen\u00E9 aritmetice, kombinatorick\u00FDch vlastnost\u00ED definovateln\u00FDch mno\u017Ein, extrem\u00E1ln\u00EDch \u00FAloh v kombinatorice a aproxima\u010Dn\u00EDch a on-line algoritm\u016F"@cs .