Projects funded by the NCN
Provability, computation and combinatorics at the lower and intermediate levels of the Gödel hierarchy
2017/27/B/ST1/01951
Keywords:
bounded arithmetic second-order arithmetic unprovability proof complexity reverse mathematics formula hierarchies decidability theorem Ramsey's Theorem
Descriptors:
- ST1_1: Logic and foundations
Panel:
ST1 - Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics
Host institution :
Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki
woj. mazowieckie
Principal investigator (from the host institution):
Number of co-investigators in the project: 4
Call: OPUS 14 - announced on 2017-09-15
Amount awarded: 418 000 PLN
Project start date (Y-m-d): 2018-07-19
Project end date (Y-m-d): 2023-01-18
Project duration:: 54 months (the same as in the proposal)
Project status: Project settled
Project description
Download the project description in a pdf file
Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.