Silvio Valentini

According to our database1, Silvio Valentini authored at least 40 papers between 1980 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Generalising the fan theorem.
Math. Log. Q., 2017

2015
A theoretical framework for studying the electromagnetic stimulation of nervous tissue.
Proceedings of the 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2015

2013
Cantor theorem and friends, in logical form.
Ann. Pure Appl. Logic, 2013

2012
Objects: A Study in Kantian Formal Epistemology.
Notre Dame Journal of Formal Logic, 2012

Relative formal topology: the binary positivity predicate comes first.
Mathematical Structures in Computer Science, 2012

Independence results in formal topology.
Ann. Pure Appl. Logic, 2012

2011
Spatiality and classical logic.
Math. Log. Q., 2011

Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita.
Proceedings of the Intelligent Computer Mathematics - 18th Symposium, 2011

2010
General Recursion and Formal Topology
Proceedings of the Proceedings Workshop on Partiality and Recursion in Interactive Theorem Provers, 2010

General Recursion and Formal Topology.
Proceedings of the Partiality and Recursion in Interactive Theorem Provers, 2010

2008
Vagueness, Kant and Topology: a Study of Formal Epistemology.
J. Philosophical Logic, 2008

2007
Constructive characterizations of bar subsets.
Ann. Pure Appl. Logic, 2007

2006
Every countably presented formal topology is spatial, classically.
J. Symb. Log., 2006

2005
The problem of the formalization of constructive topology.
Arch. Math. Log., 2005

2004
A structural investigation on formal topology: coreflection of formal covers and exponentiability.
J. Symb. Log., 2004

Exponentiation of Scott Formal Topologies.
Electr. Notes Theor. Comput. Sci., 2004

Krivine's intuitionistic proof of classical completeness (for countable languages).
Ann. Pure Appl. Logic, 2004

2003
A cartesian closed category in Martin-Löf's intuitionistic type theory.
Theor. Comput. Sci., 2003

A binary modal logic for the intersection types of lambda-calculus.
Inf. Comput., 2003

Inductively generated formal topologies.
Ann. Pure Appl. Logic, 2003

2002
Extensionality Versus Constructivity.
Math. Log. Q., 2002

On the formal points of the formal topology of the binary tree.
Arch. Math. Log., 2002

2001
An elementary proof of strong normalization for intersection types.
Arch. Math. Log., 2001

1999
A general method for proving the normalization theorem for first and second order typed lambda-calculi.
Mathematical Structures in Computer Science, 1999

Can You Add Power-Sets to Martin-Löf's Intuitionistic Set Theory?
Math. Log. Q., 1999

1997
Tychonoff's Theorem in the Framework of Formal Topologies.
J. Symb. Log., 1997

1996
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology.
Theor. Comput. Sci., 1996

Decidability in Intuitionistic Type Theory is Functionally Decidable.
Math. Log. Q., 1996

An Intuitionistic Version of Cantor's Theorem.
Math. Log. Q., 1996

1994
Representation Theorems for Quantales.
Math. Log. Q., 1994

1993
A Proof of the Normal Form Theorem for the Closed Terms of Girard's System F by Means of Computability.
Math. Log. Q., 1993

Local Computation in Linear Logic.
Math. Log. Q., 1993

Building up a Tool-Box for Matrin-Löf's Type Theory (Abstract).
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

1992
The Judgement Calculus for Intuitionistic Linear Logic: Proof Theory and Semantics.
Math. Log. Q., 1992

An Intuitionistic Theory of Types with Assumptions of High-Arity Variables.
Ann. Pure Appl. Logic, 1992

1986
A Syntactic Proof of Cut-Elimination For GLlin.
Math. Log. Q., 1986

1983
The Modal Logic of Consistency Assertions of Peano Arithmetic.
Math. Log. Q., 1983

The modal logic of provability: Cut-elimination.
J. Philosophical Logic, 1983

1982
The modal logic of provability. The sequential approach.
J. Philosophical Logic, 1982

1980
Post Completeness and Free Algebras.
Math. Log. Q., 1980


  Loading...