Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Silvio Valentini

dblp:89/993 · DBLP profile ↗
← Back
14ranked-venue papers
7as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 7 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › type theory
intersection types
0.012003
A binary modal logic for the intersection types of lambda-calculus · Inf. Comput. 2003
Logic in computer science
lambda calculus
0.012003
A binary modal logic for the intersection types of lambda-calculus · Inf. Comput. 2003
Logic in computer science
modal logic
0.012003
A binary modal logic for the intersection types of lambda-calculus · Inf. Comput. 2003
YearPublicationVenuePosition
2013 Cantor theorem and friends, in logical form
Silvio Valentini
Ann. Pure Appl. Log.1
2012 Independence results in formal topology
Silvio Valentini
Ann. Pure Appl. Log.1
2012 Relative formal topology: the binary positivity predicate comes first
abstract
In this paper we introduce relative formal topology so that we can deal constructively with the closed subsets of a topological space as well as with the open ones. In fact, within standard formal topology, the cover relation allows the definition of the formal opens, which are supposed to act as the formal counterparts of the open subsets, and within balanced formal topology, the binary positivity predicate allows the definition of the formal closed subsets, which are supposed to act as the formal counterparts of the closed subsets. However, these approaches are only fully satisfactory (according to the criterion introduced by the author in Valentini (2005)) if we can provide an adequate formalisation of the cover relation and the positivity predicate. But current formalisations fail in this respect since some intuitionistically valid relations between the open and closed subsets of a concrete topological space cannot be expressed. Our central result is that we can solve this problem through a generalisation of the standard cover relation together with a binary positivity predicate satisfying the positivity axiom.
Silvio Valentini
Math. Struct. Comput. Sci.1
2007 Constructive characterizations of bar subsets
Silvio Valentini
Ann. Pure Appl. Log.1
2006 Every countably presented formal topology is spatial, classically
abstract
Abstract By using some classical reasoning we show that any countably presented formal topology, namely, a formal topology with a countable axiom set, is spatial.
Silvio Valentini
J. Symb. Log.1
2004 Krivine's intuitionistic proof of classical completeness (for countable languages)
Stefano Berardi, Silvio Valentini
Ann. Pure Appl. Log.2
2004 A structural investigation on formal topology: coreflection of formal covers and exponentiability
abstract
Abstract. We present and study the category of formal topologies and some of its variants. Two main results are proven. The first is that, for any inductively generated formal cover, there exists a formal topology whose cover extends in the minimal way the given one. This result is obtained by enhancing the method for the inductive generation of the cover relation by adding a coinductive generation of the positivity predicate. Categorically, this result can be rephrased by saying that inductively generated formal topologies are coreflective into inductively generated formal covers. The second result is that unary formal covers are exponentiable in the category of inductively generated formal covers and hence, thanks to the coreflection, unary formal topologies are exponentiable in the category of inductively generated formal topologies. From a localic point of view the exponentiability of unary formal topologies means that algebraic dcpos are exponentiable in the category of open locales. But, the coreflection theorem states that open locales are coreflective in locales and hence, as a consequence of well-known impredicative results on exponentiable locales, it allows to prove that locally compact open locales are exponentiable in the category of open locales.
Maria Emilia Maietti, Silvio Valentini
J. Symb. Log.2
2003 Inductively generated formal topologies
Thierry Coquand, Giovanni Sambin, Jan M. Smith, Silvio Valentini
Ann. Pure Appl. Log.4
2003 A binary modal logic for the intersection types of lambda-calculus
Silvio Valentini, Matteo Viale
Inf. Comput.1
2003 A cartesian closed category in Martin-Löf's intuitionistic type theory
Silvio Valentini
Theor. Comput. Sci.1
1999 A general method for proving the normalization theorem for first and second order typed lambda-calculi
Venanzio Capretta, Silvio Valentini
Math. Struct. Comput. Sci.2
1997 Tychonoff's Theorem in the Framework of Formal Topologies
abstract
In this paper we give a constructive proof of the pointfree version of Tychonoff's theorem within formal topology, using ideas from Coquand's proof in [7]. To deal with pointfree topology Coquand uses Johnstone's coverages. Because of the representation theorem in [3], from a mathematical viewpoint these structures are equivalent to formal topologies but there is an essential difference also. Namely, formal topologies have been developed within Martin Löf's constructive type theory (cf. [16]), which thus gives a direct way of formalizing them (cf. [4]). The most important aspect of our proof is that it is based on an inductive definition of the topological product of formal topologies. This fact allows us to transform Coquand's proof into a proof by structural induction on the last rule applied in a derivation of a cover. The inductive generation of a cover, together with a modification of the inductive property proposed by Coquand, makes it possible to formulate our proof of Tychonoff s theorem in constructive type theory. There is thus a clear difference to earlier localic proofs of Tychonoff's theorem known in the literature (cf. [9, 10, 12, 14, 27]). Indeed we not only avoid to use the axiom of choice, but reach constructiveness in a very strong sense. Namely, our proof of Tychonoff's theorem supplies an algorithm which, given a cover of the product space, computes a finite subcover, provided that there exists a similar algorithm for each component space.
Sara Negri, Silvio Valentini
J. Symb. Log.2
1996 Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology
Giovanni Sambin, Silvio Valentini, Paolo Virgili
Theor. Comput. Sci.2
1992 An Intuitionistic Theory of Types with Assumptions of High-Arity Variables
Annalisa Bossi, Silvio Valentini
Ann. Pure Appl. Log.2