default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranco Parlamento
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Franco Parlamento, Flavio Previale:
A note on the Sequent Calculi. Rev. Symb. Log. 15(2): 537-551 (2022)- 2021
- [j12]Franco Parlamento, Flavio Previale:
The Elimination of Atomic Cuts and the Semishortening Property for Gentzen's Sequent Calculus with Equality. Rev. Symb. Log. 14(4): 813-837 (2021) - 2020
- [j11]Franco Parlamento
, Flavio Previale:
Absorbing the structural rules in the sequent calculus with additional atomic rules. Arch. Math. Log. 59(3-4): 389-408 (2020)
2010 – 2019
- 2017
- [i1]Franco Parlamento, Flavio Previale:
The Cut Elimination and the Nonlengthening Property for the Sequent Calculus with Equality. CoRR abs/1705.00693 (2017) - 2014
- [j10]Franco Parlamento:
Truth-Value Semantics and Functional Extensions for Classical Logic of Partial Terms Based on Equality. Notre Dame J. Formal Log. 55(3): 383-395 (2014) - 2013
- [c2]Franco Parlamento, Flavio Previale:
Cut Elimination for Gentzen's Sequent Calculus with Equality and Logic of Partial Terms. ICLA 2013: 161-172
2000 – 2009
- 2008
- [j9]Dorella Bellè, Franco Parlamento:
Decidability of ∃*∀∀-sentences in HF. Notre Dame J. Formal Log. 49(1): 55-64 (2008) - 2006
- [j8]Dorella Bellè, Franco Parlamento:
Truth in V for ∃*∀∀-sentences is decidable. J. Symb. Log. 71(4): 1200-1222 (2006) - 2001
- [j7]Dorella Bellè, Franco Parlamento:
The Decidability of the ∀*∃ Class and the Axiom of Foundation. Notre Dame J. Formal Log. 42(1): 41-53 (2001)
1990 – 1999
- 1996
- [j6]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Decidability of ∃*∀-Sentences in Membership Theories. Math. Log. Q. 42: 41-58 (1996) - 1995
- [j5]Dorella Bellè, Franco Parlamento:
Decidability and Completeness for Open Formulas of Membership Theories. Notre Dame J. Formal Log. 36(2): 304-318 (1995) - 1993
- [j4]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
A Derived Algorithm for Evaluating \varepsilon-Expressions over Abstract Sets. J. Symb. Comput. 15(5/6): 673-704 (1993) - 1992
- [j3]Franco Parlamento, Alberto Policriti:
The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation. Math. Log. Q. 38(1): 143-156 (1992) - 1991
- [j2]Franco Parlamento, Alberto Policriti:
Decision Procedures for Elementary Sublanguages of Set Theory: XIII. Model Graphs, Reflection and Decidability. J. Autom. Reason. 7(2): 271-284 (1991) - [j1]Franco Parlamento, Alberto Policriti:
Expressing Infinity Without Foundation. J. Symb. Log. 56(4): 1230-1235 (1991) - 1990
- [c1]Eugenio G. Omodeo, Franco Parlamento, Alberto Policriti:
Truth Tables for a Combinatorial Kernel of Set Theories. ECAI 1990: 485-490
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-08-05 21:13 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:
