default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonrad Zdanowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j13]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): 55-74 (2024)- 2022
- [j12]Konrad Zdanowski:
On efficiency of notations for natural numbers. Theor. Comput. Sci. 915: 1-10 (2022) - 2020
- [j11]Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski:
New bounds on the strength of some restrictions of Hindman's Theorem. Comput. 9(2): 139-153 (2020) - 2019
- [j10]Marek Czarnecki, Konrad Zdanowski:
A Modal Logic of a Truth Definition for Finite Models. Fundam. Informaticae 164(4): 299-325 (2019) - [j9]Konrad Zdanowski:
One Henkin Quantifier in the Empty Vocabulary Suffices for Undecidability. Fundam. Informaticae 164(4): 375-386 (2019) - 2016
- [j8]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. 12(4) (2016) - 2014
- [j7]Lorenzo Carlucci, Konrad Zdanowski:
The strength of Ramsey's Theorem for Coloring Relatively Large Sets. J. Symb. Log. 79(1): 89-102 (2014) - 2011
- [j6]Michal Krynicki, Jerzy Tomasik, Konrad Zdanowski:
Theories of initial segments of standard models of arithmetics and their complete extensions. Theor. Comput. Sci. 412(31): 3975-3991 (2011) - 2009
- [j5]Konrad Zdanowski:
On second order intuitionistic propositional logic without a universal quantifier. J. Symb. Log. 74(1): 157-167 (2009) - [j4]Henryk Kotlarski, Konrad Zdanowski:
On a question of Andreas Weiermann. Math. Log. Q. 55(2): 201-211 (2009) - 2007
- [j3]Michal Krynicki, Marcin Mostowski, Konrad Zdanowski:
Finite Arithmetics. Fundam. Informaticae 81(1-3): 183-202 (2007) - 2005
- [j2]Michal Krynicki, Konrad Zdanowski:
Theories of arithmetics in finite models. J. Symb. Log. 70(1): 1-28 (2005) - 2004
- [j1]Marcin Mostowski, Konrad Zdanowski:
Degrees of logics with Henkin quantifiers in poor vocabularies. Arch. Math. Log. 43(5): 691-702 (2004)
Conference and Workshop Papers
- 2017
- [c6]Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski:
New Bounds on the Strength of Some Restrictions of Hindman's Theorem. CiE 2017: 210-220 - 2015
- [c5]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS 2015: 451-465 - 2012
- [c4]Lorenzo Carlucci, Konrad Zdanowski:
A Note on Ramsey Theorems and Turing Jumps. CiE 2012: 89-95 - 2009
- [c3]Thomas Colcombet, Konrad Zdanowski:
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata. ICALP (2) 2009: 151-162 - 2005
- [c2]Marcin Mostowski, Konrad Zdanowski:
FM-Representability and Beyond. CiE 2005: 358-367 - [c1]Marcin Mostowski, Konrad Zdanowski:
Coprimality in Finite Models. CSL 2005: 263-275
Informal and Other Publications
- 2024
- [i2]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
Between proof construction and SAT-solving. CoRR abs/2405.05670 (2024) - 2012
- [i1]Lorenzo Carlucci, Konrad Zdanowski:
The strength of Ramsey Theorem for coloring relatively large sets. CoRR abs/1204.1134 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-14 19:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
