![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Paolo Gentilini
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j13]Paolo Gentilini, Maurizio Martelli, Giuseppe Rosolini:
Explicit Constructive Logic ECL: a New Representation of Construction and Selection of Logical Information by an Epistemic Agent. Fundam. Informaticae 140(3-4): 357-372 (2015) - 2013
- [c3]Paolo Gentilini, Maurizio Martelli:
Explicit Constructive Logic ECL: a New Representation of Construction and Selection of Logical Information by an Epistemic Agent. CILC 2013: 147-162 - 2011
- [j12]Paolo Gentilini:
Proof theory and mathematical meaning of paraconsistent C-systems. J. Appl. Log. 9(3): 171-202 (2011) - 2010
- [j11]Paolo Gentilini, Maurizio Martelli:
Abstract deduction and inferential models for type theory. Inf. Comput. 208(7): 737-771 (2010)
2000 – 2009
- 2006
- [c2]Paolo Gentilini:
Paraconsistent Arithmetic with a Local Consistency Operator and Global Selfreference. LMCS 2006: 73-86 - 2005
- [j10]Paola Forcheri, Paolo Gentilini:
Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework. J. Appl. Non Class. Logics 15(3): 285-319 (2005) - [j9]Paola Forcheri, Paolo Gentilini:
Paraconsistent Informational Logic. J. Appl. Log. 3(1): 97-118 (2005)
1990 – 1999
- 1999
- [j8]Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino:
Informational Logic in Knowledge Representation and Automated Deduction. AI Commun. 12(4): 185-208 (1999) - [j7]Paolo Gentilini:
Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric. Stud Logica 63(1): 27-48 (1999) - [j6]Paolo Gentilini:
Proof-Theoretic Modal PA-Completeness II: The Syntactic Countermodel. Stud Logica 63(2): 245-268 (1999) - [j5]Paolo Gentilini:
Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. Stud Logica 63(3): 301-310 (1999) - 1998
- [j4]Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino:
Informational Logic as a Tool for Automated Reasoning. J. Autom. Reason. 20(1): 167-190 (1998) - 1996
- [c1]Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino:
Informational Logic for Automated Reasoning. JELIA 1996: 354-372 - 1993
- [j3]Paolo Gentilini:
Syntactical results on the arithmetical completeness of modal logic. Stud Logica 52(4): 549-564 (1993) - 1992
- [j2]Paolo Gentilini:
Provability Logic in the Gentzen Formulation of Arithmetic. Math. Log. Q. 38(1): 535-550 (1992)
1980 – 1989
- 1986
- [j1]Marco Borga, Paolo Gentilini:
On the Proof Theory of the Modal Logic Grz. Math. Log. Q. 32(10-12): 145-148 (1986)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint