Degrees of logics with Henkin quantifiers in poor vocabularies. - Marcin Mostowski; Konrad Zdanowski (Arch. Math. Log., 2004)

FM-Representability and Beyond. - Marcin Mostowski; Konrad Zdanowski (CiE, 2005)

Coprimality in Finite Models. - Marcin Mostowski; Konrad Zdanowski (CSL, 2005)

Theories of arithmetics in finite models. - Michal Krynicki; Konrad Zdanowski (J. Symb. Log., 2005)

Finite Arithmetics. - Michal Krynicki; Marcin Mostowski; Konrad Zdanowski (Fundam. Informaticae, 2007)

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. - Thomas Colcombet; Konrad Zdanowski (ICALP (2), 2009)

On second order intuitionistic propositional logic without a universal quantifier. - Konrad Zdanowski (J. Symb. Log., 2009)

On a question of Andreas Weiermann. - Henryk Kotlarski; Konrad Zdanowski (Math. Log. Q., 2009)

Theories of initial segments of standard models of arithmetics and their complete extensions. - Michal Krynicki; Jerzy Tomasik; Konrad Zdanowski (Theor. Comput. Sci., 2011)

A Note on Ramsey Theorems and Turing Jumps. - Lorenzo Carlucci; Konrad Zdanowski (CiE, 2012)

The strength of Ramsey Theorem for coloring relatively large sets - Lorenzo Carlucci; Konrad Zdanowski (CoRR, 2012)

The strength of Ramsey's Theorem for Coloring Relatively Large Sets. - Lorenzo Carlucci; Konrad Zdanowski (J. Symb. Log., 2014)

On the Mints Hierarchy in First-Order Intuitionistic Logic. - Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (Log. Methods Comput. Sci., 2016)

A Modal Logic of a Truth Definition for Finite Models. - Marek Czarnecki; Konrad Zdanowski (Fundam. Informaticae, 2019)

One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability. - Konrad Zdanowski (Fundam. Informaticae, 2019)

New bounds on the strength of some restrictions of Hindman's Theorem. - Lorenzo Carlucci; Leszek Aleksander Kolodziejczyk; Francesco Lepore; Konrad Zdanowski (Comput., 2020)

On efficiency of notations for natural numbers. - Konrad Zdanowski (Theor. Comput. Sci., 2022)

Between proof construction and SAT-solving. - Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (CoRR, 2024)

The existential fragment of second-order propositional intuitionistic logic is undecidable. - Ken-etsu Fujita; Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (J. Appl. Non Class. Logics, 2024)