Provability, computation and combinatorics at the lower and intermediate levels of the Gödel hierarchy

2017/27/B/ST1/01951

Keywords

Descriptors

  • ST1_1: Logika i podstawy matematyki

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

Voivodeship: mazowieckie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr hab. Leszek Aleksander Kołodziejczyk

Number of co-investigators in the project: 4

Call

OPUS 14 – announced on 2017-09-15

Amount awarded
418 000 PLN
Project start date
2018-07-19
Project end date
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.

Equipment purchased [PL]

  1. Komputer przenośny. Cost: 5 000 PLN

Information in the final report

Publication in academic press/journals (7)

  1. Ramsey's theorem for pairs, collection, and proof size

    Authors:
    Leszek Aleksander Kołodziejczyk, Tin Lok Wong, Keita Yokoyama
    Academic press:
    Journal of Mathematical Logic (year: 2023, volume: b.d. [online ready], pages: 13516), Publisher: World Scientific
    Status:
    Published
    DOI:
    10.1142/S0219061323500071 – link to the publication
  2. Some upper bounds on ordinal-valued Ramsey numbers for colourings of pairs

    Authors:
    Leszek Aleksander Kołodziejczyk, Keita Yokoyama
    Academic press:
    Selecta Mathematica (year: 2020, volume: 26, pages: 56:1-56:18), Publisher: Springer Nature
    Status:
    Published
    DOI:
    10.1007/s00029-020-00577-3 – link to the publication
  3. Weaker cousins of Ramsey's theorem over a weak base theory

    Authors:
    Marta Fiori-Carones, Leszek Aleksander Kołodziejczyk, Katarzyna W. Kowalik
    Academic press:
    Annals of Pure and Applied Logic (year: 2021, volume: 172 (10), pages: 103028:1-22), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.apal.2021.103028 – link to the publication
  4. How strong is Ramsey's theorem if infinity can be weak?

    Authors:
    Leszek Aleksander Kołodziejczyk, Katarzyna W. Kowalik, Keita Yokoyama
    Academic press:
    Journal of Symbolic Logic (year: 2023, volume: 88(2), pages: 620-639), Publisher: Cambridge University Press/Association for Symbolic Logic
    Status:
    Published
    DOI:
    10.1017/jsl.2022.46 – link to the publication
  5. Approximate counting and NP search problems

    Authors:
    Leszek Aleksander Kołodziejczyk, Neil Thapen
    Academic press:
    Journal of Mathematical Logic (year: 2022, volume: 22(3), pages: 2250012:1-31), Publisher: World Scientific
    Status:
    Published
    DOI:
    10.1142/S021906132250012X – link to the publication
  6. Polynomial calculus space and resolution width [wersja czasopismowa pracy z FOCS 2019]

    Authors:
    Nicola Galesi, Leszek Aleksander Kołodziejczyk, Neil Thapen
    Status:
    Accepted for publication
  7. An isomorphism theorem for models of Weak König's Lemma without primitive recursion

    Authors:
    Marta Fiori-Carones, Leszek Aleksander Kołodziejczyk, Tin Lok Wong, Keita Yokoyama
    Status:
    Accepted for publication

Articles in post-conference publications (1)

  1. Polynomial calculus space and resolution width

    Authors:
    Nicola Galesi, Leszek Aleksander Kołodziejczyk, Neil Thapen
    Conference:
    2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (year: 2019, pages: 1325-1337), Publisher: IEEE
    Date:
    conference 9-12 listopada 2019
    Status:
    Published

« New search

Graphic design and implementation: Jakub Piotrowski