Konrad Zdanowski

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 9

Top Topics

Intuitionistic Logic

Natural Deduction

Top Venues

Fundam. Informaticae

Publications

Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
Between proof construction and SAT-solving. CoRR (2024)
Ken-etsu Fujita, Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
The existential fragment of second-order propositional intuitionistic logic is undecidable. J. Appl. Non Class. Logics 34 (1) (2024)
Konrad Zdanowski
On efficiency of notations for natural numbers. Theor. Comput. Sci. 915 (2022)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New bounds on the strength of some restrictions of Hindman's Theorem. Comput. 9 (2) (2020)
Konrad Zdanowski
One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability. Fundam. Informaticae 164 (4) (2019)
Marek Czarnecki, Konrad Zdanowski
A Modal Logic of a Truth Definition for Finite Models. Fundam. Informaticae 164 (4) (2019)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New Bounds on the Strength of Some Restrictions of Hindman's Theorem. CiE (2017)
Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. 12 (4) (2016)
Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski
On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS (2015)
Lorenzo Carlucci, Konrad Zdanowski
The strength of Ramsey's Theorem for Coloring Relatively Large Sets. J. Symb. Log. 79 (1) (2014)
Lorenzo Carlucci, Konrad Zdanowski
The strength of Ramsey Theorem for coloring relatively large sets CoRR (2012)
Lorenzo Carlucci, Konrad Zdanowski
A Note on Ramsey Theorems and Turing Jumps. CiE (2012)
Michal Krynicki, Jerzy Tomasik, Konrad Zdanowski
Theories of initial segments of standard models of arithmetics and their complete extensions. Theor. Comput. Sci. 412 (31) (2011)
Konrad Zdanowski
On second order intuitionistic propositional logic without a universal quantifier. J. Symb. Log. 74 (1) (2009)
Thomas Colcombet, Konrad Zdanowski
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ICALP (2) (2009)
Henryk Kotlarski, Konrad Zdanowski
On a question of Andreas Weiermann. Math. Log. Q. 55 (2) (2009)
Michal Krynicki, Marcin Mostowski, Konrad Zdanowski
Finite Arithmetics. Fundam. Informaticae 81 (1-3) (2007)
Marcin Mostowski, Konrad Zdanowski
FM-Representability and Beyond. CiE (2005)
Michal Krynicki, Konrad Zdanowski
Theories of arithmetics in finite models. J. Symb. Log. 70 (1) (2005)
Marcin Mostowski, Konrad Zdanowski
Coprimality in Finite Models. CSL (2005)
Marcin Mostowski, Konrad Zdanowski
Degrees of logics with Henkin quantifiers in poor vocabularies. Arch. Math. Log. 43 (5) (2004)