default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSilvio Valentini
Person information
- affiliation: University of Padua, Department of Mathematics, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j34]Silvio Valentini:
Generalising the fan theorem. Math. Log. Q. 63(1-2): 85-93 (2017)- 2015
- [c6]Dino Accoto
, Silvio Valentini, Iacopo Portaccio, Eugenio Guglielmelli:
A theoretical framework for studying the electromagnetic stimulation of nervous tissue. EMBC 2015: 2079-2082 - 2013
- [j33]Silvio Valentini:
Cantor theorem and friends, in logical form. Ann. Pure Appl. Log. 164(4): 502-508 (2013) - 2012
- [j32]Silvio Valentini:
Independence results in formal topology. Ann. Pure Appl. Log. 163(2): 151-156 (2012) - [j31]Silvio Valentini:
Relative formal topology: the binary positivity predicate comes first. Math. Struct. Comput. Sci. 22(1): 69-102 (2012) - [j30]Giovanni Boniolo, Silvio Valentini:
Objects: A Study in Kantian Formal Epistemology. Notre Dame J. Formal Log. 53(4): 457-478 (2012) - 2011
- [j29]Milena Stefanova, Silvio Valentini:
Spatiality and classical logic. Math. Log. Q. 57(4): 432-440 (2011) - [c5]Andrea Asperti, Maria Emilia Maietti, Claudio Sacerdoti Coen, Giovanni Sambin, Silvio Valentini:
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. Calculemus/MKM 2011: 278-280 - 2010
- [c4]Claudio Sacerdoti Coen, Silvio Valentini:
General Recursion and Formal Topology. PAR@ITP 2010: 72-83 - [c3]Claudio Sacerdoti Coen, Silvio Valentini:
General Recursion and Formal Topology. PAR 2010: 65-75
2000 – 2009
- 2008
- [j28]Giovanni Boniolo, Silvio Valentini:
Vagueness, Kant and Topology: a Study of Formal Epistemology. J. Philos. Log. 37(2): 141-168 (2008) - 2007
- [j27]Silvio Valentini:
Constructive characterizations of bar subsets. Ann. Pure Appl. Log. 145(3): 368-378 (2007) - 2006
- [j26]Silvio Valentini:
Every countably presented formal topology is spatial, classically. J. Symb. Log. 71(2): 491-500 (2006) - 2005
- [j25]Silvio Valentini:
The problem of the formalization of constructive topology. Arch. Math. Log. 44(1): 115-129 (2005) - 2004
- [j24]Stefano Berardi, Silvio Valentini:
Krivine's intuitionistic proof of classical completeness (for countable languages). Ann. Pure Appl. Log. 129(1-3): 93-106 (2004) - [j23]Maria Emilia Maietti, Silvio Valentini:
A structural investigation on formal topology: coreflection of formal covers and exponentiability. J. Symb. Log. 69(4): 967-1005 (2004) - 2003
- [j22]Thierry Coquand, Giovanni Sambin, Jan M. Smith, Silvio Valentini:
Inductively generated formal topologies. Ann. Pure Appl. Log. 124(1-3): 71-106 (2003) - [j21]Silvio Valentini, Matteo Viale:
A binary modal logic for the intersection types of lambda-calculus. Inf. Comput. 185(2): 211-232 (2003) - [j20]Silvio Valentini:
A cartesian closed category in Martin-Löf's intuitionistic type theory. Theor. Comput. Sci. 290(1): 189-219 (2003) - 2002
- [j19]Silvio Valentini:
On the formal points of the formal topology of the binary tree. Arch. Math. Log. 41(7): 603-618 (2002) - [j18]Silvio Valentini:
Extensionality Versus Constructivity. Math. Log. Q. 48(2): 179-187 (2002) - [c2]Maria Emilia Maietti, Silvio Valentini:
Exponentiation of Scott Formal Topologies. Workshop on Domains 2002: 111-131 - 2001
- [j17]Silvio Valentini:
An elementary proof of strong normalization for intersection types. Arch. Math. Log. 40(7): 475-488 (2001)
1990 – 1999
- 1999
- [j16]Maria Emilia Maietti, Silvio Valentini:
Can You Add Power-Sets to Martin-Löf's Intuitionistic Set Theory? Math. Log. Q. 45: 521-532 (1999) - [j15]Venanzio Capretta, Silvio Valentini:
A general method for proving the normalization theorem for first and second order typed lambda-calculi. Math. Struct. Comput. Sci. 9(6): 719-739 (1999) - 1997
- [j14]Sara Negri, Silvio Valentini:
Tychonoff's Theorem in the Framework of Formal Topologies. J. Symb. Log. 62(4): 1315-1332 (1997) - 1996
- [j13]Silvio Valentini:
Decidability in Intuitionistic Type Theory is Functionally Decidable. Math. Log. Q. 42: 300-304 (1996) - [j12]Dario Maguolo, Silvio Valentini:
An Intuitionistic Version of Cantor's Theorem. Math. Log. Q. 42: 446-448 (1996) - [j11]Giovanni Sambin, Silvio Valentini, Paolo Virgili:
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology. Theor. Comput. Sci. 159(2): 319-341 (1996) - 1994
- [j10]Silvio Valentini:
Representation Theorems for Quantales. Math. Log. Q. 40: 182-190 (1994) - 1993
- [j9]Ugo Solitro, Silvio Valentini:
Local Computation in Linear Logic. Math. Log. Q. 39: 201-212 (1993) - [j8]Silvio Valentini:
A Proof of the Normal Form Theorem for the Closed Terms of Girard's System F by Means of Computability. Math. Log. Q. 39: 539-544 (1993) - [c1]Giovanni Sambin, Silvio Valentini:
Building up a Tool-Box for Matrin-Löf's Type Theory (Abstract). Kurt Gödel Colloquium 1993: 69-70 - 1992
- [j7]Annalisa Bossi, Silvio Valentini:
An Intuitionistic Theory of Types with Assumptions of High-Arity Variables. Ann. Pure Appl. Log. 57(2): 93-149 (1992) - [j6]Silvio Valentini:
The Judgement Calculus for Intuitionistic Linear Logic: Proof Theory and Semantics. Math. Log. Q. 38(1): 39-58 (1992)
1980 – 1989
- 1986
- [j5]Silvio Valentini:
A Syntactic Proof of Cut-Elimination For GLlin. Math. Log. Q. 32(7-9): 137-144 (1986) - 1983
- [j4]Silvio Valentini:
The modal logic of provability: Cut-elimination. J. Philos. Log. 12(4): 471-476 (1983) - [j3]Silvio Valentini:
The Modal Logic of Consistency Assertions of Peano Arithmetic. Math. Log. Q. 29(1): 25-32 (1983) - 1982
- [j2]Giovanni Sambin, Silvio Valentini:
The modal logic of provability. The sequential approach. J. Philos. Log. 11(3): 311-342 (1982) - 1980
- [j1]Giovanni Sambin, Silvio Valentini:
Post Completeness and Free Algebras. Math. Log. Q. 26(22-24): 343-347 (1980)
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-04-25 05:37 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:
