Konrad Zdanowski

According to our database, Konrad Zdanowski authored at least 19 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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, January, 2024

Between proof construction and SAT-solving.

Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski

CoRR, 2024

2022

On efficiency of notations for natural numbers.

Konrad Zdanowski

Theor. Comput. Sci., 2022

2020

New bounds on the strength of some restrictions of Hindman's Theorem.

Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski

Comput., 2020

2019

One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability.

Konrad Zdanowski

Fundam. Informaticae, 2019

A Modal Logic of a Truth Definition for Finite Models.

Marek Czarnecki, Konrad Zdanowski

Fundam. Informaticae, 2019

2016

On the Mints Hierarchy in First-Order Intuitionistic Logic.

Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski

Log. Methods Comput. Sci., 2016

2014

The strength of Ramsey's Theorem for Coloring Relatively Large Sets.

Lorenzo Carlucci, Konrad Zdanowski

J. Symb. Log., 2014

2012

The strength of Ramsey Theorem for coloring relatively large sets

Lorenzo Carlucci, Konrad Zdanowski

CoRR, 2012

A Note on Ramsey Theorems and Turing Jumps.

Lorenzo Carlucci, Konrad Zdanowski

Proceedings of the How the World Computes, 2012

2011

Theories of initial segments of standard models of arithmetics and their complete extensions.

Michal Krynicki, Jerzy Tomasik, Konrad Zdanowski

Theor. Comput. Sci., 2011

2009

On a question of Andreas Weiermann.

Henryk Kotlarski, Konrad Zdanowski

Math. Log. Q., 2009

On second order intuitionistic propositional logic without a universal quantifier.

Konrad Zdanowski

J. Symb. Log., 2009

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.

Thomas Colcombet, Konrad Zdanowski

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2007

Finite Arithmetics.

Michal Krynicki, Marcin Mostowski, Konrad Zdanowski

Fundam. Informaticae, 2007

2005

Theories of arithmetics in finite models.

Michal Krynicki, Konrad Zdanowski

J. Symb. Log., 2005

Coprimality in Finite Models.

Marcin Mostowski, Konrad Zdanowski

Proceedings of the Computer Science Logic, 19th International Workshop, 2005

FM-Representability and Beyond.

Marcin Mostowski, Konrad Zdanowski

Proceedings of the New Computational Paradigms, 2005

2004

Degrees of logics with Henkin quantifiers in poor vocabularies.

Marcin Mostowski, Konrad Zdanowski

Arch. Math. Log., 2004