default search action
Lorenzo Carlucci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Lorenzo Carlucci, Leonardo Mainardi:
Regressive versions of Hindman's theorem. Arch. Math. Log. 63(3-4): 447-472 (2024) - 2022
- [j16]Lorenzo Carlucci
, Daniele Tavernelli:
Hindman's theorem for sums along the full binary tree, Σ 02-induction and the Pigeonhole principle for trees. Arch. Math. Log. 61(5-6): 827-839 (2022) - 2021
- [j15]Lorenzo Carlucci
Upper bounds on positional Paris-Harrington games. Discret. Math. 344(3): 112257 (2021) - [c10]Lorenzo Carlucci:
Restrictions of Hindman's Theorem: An Overview. CiE 2021: 94-105 - 2020
- [j14]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
- [j13]Lorenzo Carlucci
A Note on Hindman-Type Theorems for Uncountable Cardinals. Order 36(1): 19-22 (2019) - [c9]Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen:
A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ). CiE 2019: 144-155 - 2018
- [j12]Lorenzo Carlucci
A weak variant of Hindman's Theorem stronger than Hilbert's Theorem. Arch. Math. Log. 57(3-4): 381-389 (2018) - 2017
- [c8]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
- [j11]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ACM Trans. Comput. Log. 17(4): 26 (2016) - 2014
- [j10]Lorenzo Carlucci, Konrad Zdanowski
The strength of Ramsey's Theorem for Coloring Relatively Large Sets. J. Symb. Log. 79(1): 89-102 (2014) - 2013
- [j9]Lorenzo Carlucci, John Case:
On the Necessity of U-Shaped Learning. Top. Cogn. Sci. 5(1): 56-88 (2013) - 2012
- [j8]Lorenzo Carlucci, Sanjay Jain, Frank Stephan
Learning with ordinal-bounded memory from positive data. J. Comput. Syst. Sci. 78(5): 1623-1636 (2012) - [c7]Lorenzo Carlucci, Konrad Zdanowski
A Note on Ramsey Theorems and Turing Jumps. CiE 2012: 89-95 - [i2]Lorenzo Carlucci, Konrad Zdanowski:
The strength of Ramsey Theorem for coloring relatively large sets. CoRR abs/1204.1134 (2012) - 2011
- [j7]Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
Sharp thresholds for hypergraph regressive Ramsey numbers. J. Comb. Theory A 118(2): 558-585 (2011) - [c6]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
Paris-Harrington Tautologies. CCC 2011: 93-103 - 2010
- [i1]Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
Paris-Harrington tautologies. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j6]Lorenzo Carlucci, John Case, Sanjay Jain:
Learning correction grammars. J. Symb. Log. 74(2): 489-516 (2009) - [c5]Lorenzo Carlucci:
Incremental Learning with Ordinal Bounded Example Memory. ALT 2009: 323-337 - 2008
- [j5]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non-U-shaped vacillatory and team learning. J. Comput. Syst. Sci. 74(4): 409-430 (2008) - 2007
- [j4]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Results on memory-limited U-shaped learning. Inf. Comput. 205(10): 1551-1573 (2007) - [c4]Lorenzo Carlucci, John Case, Sanjay Jain:
Learning Correction Grammars. COLT 2007: 203-217 - 2006
- [j3]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
Variations on U-shaped learning. Inf. Comput. 204(8): 1264-1294 (2006) - [c3]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
Memory-Limited U-Shaped Learning. COLT 2006: 244-258 - 2005
- [j2]Lorenzo Carlucci:
Worms, gaps, and hydras. Math. Log. Q. 51(4): 342-350 (2005) - [c2]Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non U-Shaped Vacillatory and Team Learning. ALT 2005: 241-255 - [c1]Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan:
Variations on U-Shaped Learning. COLT 2005: 382-397 - 2003
- [j1]Lorenzo Carlucci:
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem. Theor. Comput. Sci. 300(1-3): 365-378 (2003)
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-10 20:32 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: