Konrad Zdanowski

Orcid: 0000-0002-8846-3733

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The existential fragment of second-order propositional intuitionistic logic is undecidable.
J. Appl. Non Class. Logics, January, 2024

Between proof construction and SAT-solving.
CoRR, 2024

2022
On efficiency of notations for natural numbers.
Theor. Comput. Sci., 2022

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

2019
One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability.
Fundam. Informaticae, 2019

A Modal Logic of a Truth Definition for Finite Models.
Fundam. Informaticae, 2019

2016
On the Mints Hierarchy in First-Order Intuitionistic Logic.
Log. Methods Comput. Sci., 2016

2014
The strength of Ramsey's Theorem for Coloring Relatively Large Sets.
J. Symb. Log., 2014

2012
The strength of Ramsey Theorem for coloring relatively large sets
CoRR, 2012

A Note on Ramsey Theorems and Turing Jumps.
Proceedings of the How the World Computes, 2012

2011
Theories of initial segments of standard models of arithmetics and their complete extensions.
Theor. Comput. Sci., 2011

2009
On a question of Andreas Weiermann.
Math. Log. Q., 2009

On second order intuitionistic propositional logic without a universal quantifier.
J. Symb. Log., 2009

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2007
Finite Arithmetics.
Fundam. Informaticae, 2007

2005
Theories of arithmetics in finite models.
J. Symb. Log., 2005

Coprimality in Finite Models.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

FM-Representability and Beyond.
Proceedings of the New Computational Paradigms, 2005

2004
Degrees of logics with Henkin quantifiers in poor vocabularies.
Arch. Math. Log., 2004


  Loading...