default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGabriele Pulcini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Gabriele Pulcini:
Cut elimination by unthreading. Arch. Math. Log. 63(1-2): 211-223 (2024)- [j15]Mario Piazza, Gabriele Pulcini, Matteo Tesi:
Linear logic in a refutational setting. J. Log. Comput. 34(7): 1249-1273 (2024) - 2023
- [j14]Mario Piazza, Gabriele Pulcini
, Andrea Sabatini:
Abduction as Deductive Saturation: a Proof-Theoretic Inquiry. J. Philos. Log. 52(6): 1575-1602 (2023) - [j13]Gabriele Pulcini, Achille C. Varzi:
Complementary Proof Nets for Classical Logic. Logica Universalis 17(4): 411-432 (2023) - [j12]Mario Piazza, Gabriele Pulcini, Matteo Tesi:
Fractional-Valued Modal Logic. Rev. Symb. Log. 16(4): 1033-1052 (2023) - 2022
- [j11]Gabriele Pulcini:
A note on cut-elimination for classical propositional logic. Arch. Math. Log. 61(3-4): 555-565 (2022) - 2020
- [j10]Mario Piazza, Gabriele Pulcini:
Fractional Semantics for Classical Logic. Rev. Symb. Log. 13(4): 810-828 (2020)
2010 – 2019
- 2018
- [j9]Gabriele Pulcini, Achille C. Varzi:
Paraconsistency in classical logic. Synth. 195(12): 5485-5496 (2018) - 2017
- [j8]Walter Alexandre Carnielli, Gabriele Pulcini:
Cut-elimination and deductive polarization in complementary classical logic. Log. J. IGPL 25(3): 273-282 (2017) - [j7]Mario Piazza, Gabriele Pulcini:
Unifying logics via context-sensitiveness. J. Log. Comput. 27(1): 21-40 (2017) - 2016
- [j6]Mario Piazza, Gabriele Pulcini:
Uniqueness of axiomatic extensions of cut-free classical propositional logic. Log. J. IGPL 24(5): 708-718 (2016) - 2014
- [j5]Marcello D'Agostino, Mario Piazza, Gabriele Pulcini:
A logical calculus for controlled monotonicity. J. Appl. Log. 12(4): 558-569 (2014) - 2013
- [j4]Giovanni Boniolo, Marcello D'Agostino, Mario Piazza, Gabriele Pulcini:
A logic of non-monotonic interactions. J. Appl. Log. 11(1): 52-62 (2013) - 2010
- [j3]Gabriele Pulcini:
Rewriting systems for the surface classification theorem. Math. Struct. Comput. Sci. 20(4): 577-588 (2010)
2000 – 2009
- 2009
- [j2]Gabriele Pulcini:
A geometrical procedure for computing relaxation. Ann. Pure Appl. Log. 158(1-2): 80-89 (2009) - [j1]Gabriele Pulcini:
Computing surfaces via pq-permutations. Int. J. Imaging Syst. Technol. 19(2): 132-139 (2009) - 2008
- [c3]Gabriele Pulcini:
Computing Surfaces via pq-Permutations. IWCIA Special Track on Applications 2008: 157-166 - 2007
- [c2]Gabriele Pulcini:
Permutative Additives and Exponentials. LPAR 2007: 469-483 - 2005
- [c1]Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet:
Permutative Logic. CSL 2005: 184-199
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-12-04 21:11 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:
