Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Induction for bounded formulas and its relativizations

2013/09/B/ST1/04390

Keywords:

first-order arithmetic bounded induction relativization approximate counting weak pigeonhole principle truth definitions

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

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr hab. Leszek Kołodziejczyk 

Number of co-investigators in the project: 2

Call: OPUS 5 - announced on 2013-03-15

Amount awarded: 188 300 PLN

Project start date (Y-m-d): 2014-02-19

Project end date (Y-m-d): 2017-09-18

Project duration:: 43 months (the same as in the proposal)

Project status: Project settled

Equipment purchased [PL]

  1. Komputer (5 000 PLN)

Information in the final report

  • Publication in academic press/journals (6)
  • Articles in post-conference publications (3)
  • Book publications / chapters in book publications (1)
  1. Restricted polynomial induction versus ordinary induction
    Authors:
    Zofia Adamowicz
    Academic press:
    Fundamenta Mathematicae (rok: 2018, tom: 242, strony: 75-92), Wydawca: Instytut Matematyczny PAN
    Status:
    Published
    DOI:
    10.4064/fm323-10-2017 - link to the publication
  2. Some subsystems of constant-depth Frege with parity
    Authors:
    Michal Garlik, Leszek Aleksander Kołodziejczyk
    Academic press:
    ACM Transactions on Computational Logic (rok: 2018, tom: 19(4), strony: 29:1-29:34), Wydawca: ACM
    Status:
    Published
    DOI:
    10.1145/3243126 - link to the publication
  3. The Logical Strength of Büchi's Decidability Theorem [wersja rozszerzona pracy z konferencji CSL 2016]
    Authors:
    Leszek Aleksander Kołodziejczyk, Henryk Michalewski, Pierre Pradic, Michał Skrzypczak
    Academic press:
    Logical Methods in Computer Science , Wydawca: Logical Methods in Computer Science e.V.
    Status:
    Accepted for publication
    DOI:
    brak - link to the publication
  4. End-extensions of models of weak arithmetic from complexity-theoretic containments
    Authors:
    Leszek Aleksander Kołodziejczyk
    Academic press:
    Journal of Symbolic Logic (rok: 2016, tom: 81, strony: 901-916), Wydawca: Cambridge University Press / Association for Symbolic Logic
    Status:
    Published
    DOI:
    10.1017/jsl.2015.53 - link to the publication
  5. Categorical characterizations of the natural numbers require primitive recursion
    Authors:
    Leszek Aleksander Kołodziejczyk, Keita Yokoyama
    Academic press:
    Annals of Pure and Applied Logic (rok: 2015, tom: 166 nr 2, strony: 219-231), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.003 - link to the publication
  6. Existentially closed models in the framework of arithmetic
    Authors:
    Zofia Adamowicz, Andres Cordon Franco, F. Felix Lara Martin
    Academic press:
    Journal of Symbolic Logic (rok: 2016, tom: 81, strony: 774-788), Wydawca: Cambridge University Press / Association for Symbolic Logic
    Status:
    Published
    DOI:
    10.1017/jsl.2015.36 - link to the publication
  1. New Bounds on the Strength of Some Restrictions of Hindman's Theorem
    Authors:
    Lorenzo Carlucci, Leszek Aleksander Kołodziejczyk, Francesco Lepore, Konrad Zdanowski
    Conference:
    Computability in Europe (CiE) (rok: 2017, ), Wydawca: Springer
    Data:
    konferencja 12-16 czerwca 2017
    Status:
    Published
    DOI:
    link to the publication
  2. How unprovable is Rabin's decidability theorem?
    Authors:
    Leszek Aleksander Kołodziejczyk, Henryk Michalewski
    Conference:
    Logic in Computer Science (LICS) (rok: 2016, ), Wydawca: Association for Computing Machinery
    Data:
    konferencja 5-8 lipca 2016
    Status:
    Published
    DOI:
    link to the publication
  3. The Logical Strength of Büchi's Decidability Theorem
    Authors:
    Leszek Aleksander Kołodziejczyk, Henryk Michalewski, Pierre Pradic, Michał Skrzypczak
    Conference:
    Computer Science Logic (CSL) (rok: 2016, ), Wydawca: Schloss Dagstuhl-Leibniz-Zentrum für Informatik
    Data:
    konferencja 29 sierpnia - 1 września 2016
    Status:
    Published
    DOI:
    link to the publication
  1. A Reflection on Collection
    Authors:
    Leszek A. Kołodziejczyk
    Book:
    Liber Amicorum Alberti. A Tribute to Albert Visser (rok: 2016, tom: Tributes 30, strony: 187-194), Wydawca: College Publications
    Status:
    Published

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy