default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeszek Aleksander Kolodziejczyk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Leszek Aleksander Kolodziejczyk, Tin Lok Wong, Keita Yokoyama:
Ramsey's theorem for pairs, collection, and proof size. J. Math. Log. 24(2): 2350007:1-2350007:40 (2024)- [c8]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Strength of the Dominance Rule. SAT 2024: 20:1-20:22 - [i5]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The strength of the dominance rule. CoRR abs/2406.13657 (2024) - 2023
- [j24]Leszek Aleksander Kolodziejczyk
, Katarzyna W. Kowalik, Keita Yokoyama:
How Strong is Ramsey's Theorem if infinity can be Weak? J. Symb. Log. 88(2): 620-639 (2023) - 2022
- [j23]Leszek Aleksander Kolodziejczyk, Neil Thapen:
Approximate counting and NP search problems. J. Math. Log. 22(3): 2250012:1-2250012:31 (2022) - 2021
- [j22]Marta Fiori-Carones, Leszek Aleksander Kolodziejczyk, Katarzyna W. Kowalik:
Weaker cousins of Ramsey's theorem over a weak base theory. Ann. Pure Appl. Log. 172(10): 103028 (2021) - [c7]Leszek Aleksander Kolodziejczyk, Keita Yokoyama:
In Search of the First-Order Part of Ramsey's Theorem for Pairs. CiE 2021: 297-307 - 2020
- [j21]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)
2010 – 2019
- 2019
- [j20]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. Log. Methods Comput. Sci. 15(2) (2019) - [c6]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial Calculus Space and Resolution Width. FOCS 2019: 1325-1337 - [i4]Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial calculus space and resolution width. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j19]Michal Garlík, Leszek Aleksander Kolodziejczyk:
Some Subsystems of Constant-Depth Frege with Parity. ACM Trans. Comput. Log. 19(4): 29:1-29:34 (2018) - [i3]Leszek Aleksander Kolodziejczyk, Neil Thapen:
Approximate counting and NP search problems. CoRR abs/1812.10771 (2018) - 2017
- [c5]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 - 2016
- [j18]Leszek Aleksander Kolodziejczyk:
End-Extensions of Models of Weak Arithmetic from Complexity-Theoretic Containments. J. Symb. Log. 81(3): 901-916 (2016) - [c4]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The Logical Strength of Büchi's Decidability Theorem. CSL 2016: 36:1-36:16 - [c3]Leszek Aleksander Kolodziejczyk, Henryk Michalewski:
How unprovable is Rabin's decidability theorem? LICS 2016: 788-797 - [i2]Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The logical strength of Büchi's decidability theorem. CoRR abs/1608.07514 (2016) - 2015
- [j17]Leszek Aleksander Kolodziejczyk, Keita Yokoyama:
Categorical characterizations of the natural numbers require primitive recursion. Ann. Pure Appl. Log. 166(2): 219-231 (2015) - [i1]Leszek Aleksander Kolodziejczyk, Henryk Michalewski:
How unprovable is Rabin's decidability theorem? CoRR abs/1508.06780 (2015) - 2014
- [j16]Samuel R. Buss, Leszek Aleksander Kolodziejczyk:
Small Stone in Pool. Log. Methods Comput. Sci. 10(2) (2014) - [j15]Samuel R. Buss, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Fragments of Approximate Counting. J. Symb. Log. 79(2): 496-525 (2014) - 2013
- [j14]Emil Jerábek, Leszek Aleksander Kolodziejczyk:
Real closures of models of weak arithmetic. Arch. Math. Log. 52(1-2): 143-157 (2013) - [j13]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak:
Solutions in XML data exchange. J. Comput. Syst. Sci. 79(6): 785-815 (2013) - 2012
- [j12]Zofia Adamowicz, Leszek Aleksander Kolodziejczyk, Jeff B. Paris:
Truth definitions without exponentiation and the Σ₁ collection scheme. J. Symb. Log. 77(2): 649-655 (2012) - 2011
- [j11]Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen:
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162(6): 419-446 (2011) - [j10]Leszek Aleksander Kolodziejczyk:
Independence results for variants of sharply bounded induction. Ann. Pure Appl. Log. 162(12): 981-990 (2011) - [c2]Mikolaj Bojanczyk, Leszek Aleksander Kolodziejczyk, Filip Murlak:
Solutions in XML data exchange. ICDT 2011: 102-113 - 2010
- [j9]Sedki Boughattas, Leszek Aleksander Kolodziejczyk:
The strength of sharply bounded induction requires MSP. Ann. Pure Appl. Log. 161(4): 504-510 (2010) - [j8]Zofia Adamowicz, Leszek Aleksander Kolodziejczyk:
A note on the Sigma1 collection scheme and fragments of bounded arithmetic. Math. Log. Q. 56(2): 126-130 (2010)
2000 – 2009
- 2009
- [j7]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The polynomial and linear time hierarchies in V0. Math. Log. Q. 55(5): 509-514 (2009) - 2008
- [j6]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The polynomial and linear hierarchies in models where the weak pigeonhole principle fails. J. Symb. Log. 73(2): 578-592 (2008) - 2007
- [j5]Zofia Adamowicz, Leszek Aleksander Kolodziejczyk:
Partial collapses of the Sigma1 complexity hierarchy in models for fragments of bounded arithmetic. Ann. Pure Appl. Log. 145(1): 91-95 (2007) - [c1]Leszek Aleksander Kolodziejczyk, Neil Thapen:
The Polynomial and Linear Hierarchies in V0. CiE 2007: 408-415 - 2006
- [j4]Leszek Aleksander Kolodziejczyk:
On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories. J. Symb. Log. 71(2): 624-638 (2006) - 2004
- [j3]Leszek Aleksander Kolodziejczyk:
Truth definitions in finite models. J. Symb. Log. 69(1): 183-200 (2004) - [j2]Leszek Aleksander Kolodziejczyk:
A finite model-theoretical proof of a property of bounded query classes within PH. J. Symb. Log. 69(4): 1105-1116 (2004) - [j1]Zofia Adamowicz, Leszek Aleksander Kolodziejczyk:
Well-behaved principles alternative to bounded induction. Theor. Comput. Sci. 322(1): 5-16 (2004)
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 2025-01-20 23:04 CET 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:
