Konrad Zdanowski

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