default search action
Giovanni Sambin
Person information
- affiliation: University of Padua, Department of Pure and Applied Mathematics, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j26]Samuele Maschio, Giovanni Sambin:
Topology as Faithful Communication Through Relations. Fundam. Informaticae 176(1): 61-78 (2020)
2010 – 2019
- 2019
- [j25]Francesco Ciraulo, Giovanni Sambin:
Reducibility, a constructive dual of spatiality. J. Log. Anal. 11 (2019) - [j24]Tatsuji Kawai, Giovanni Sambin:
The principle of pointfree continuity. Log. Methods Comput. Sci. 15(1) (2019) - 2018
- [j23]Francesco Ciraulo
, Giovanni Sambin
Embedding locales and formal topologies into positive topologies. Arch. Math. Log. 57(7-8): 755-768 (2018) - [i1]Tatsuji Kawai, Giovanni Sambin:
The principle of point-free continuity. CoRR abs/1802.04512 (2018) - 2016
- [j22]Thierry Coquand, Maria Emilia Maietti, Giovanni Sambin, Peter Schuster:
Preface. Ann. Pure Appl. Log. 167(9): 725 (2016) - 2013
- [j21]Libor Behounek
Editorial: Special issue on non-classical mathematics. Log. J. IGPL 21(1): 1-3 (2013) - [j20]Francesco Ciraulo, Maria Emilia Maietti, Giovanni Sambin:
Convergence in formal topology: a unifying notion. J. Log. Anal. 5 (2013) - 2012
- [j19]Andrej Bauer, Thierry Coquand, Giovanni Sambin, Peter M. Schuster
Preface. Ann. Pure Appl. Log. 163(2): 85-86 (2012) - [j18]Francesco Ciraulo
A constructive Galois connection between closure and interior. J. Symb. Log. 77(4): 1308-1324 (2012) - [p2]Giovanni Sambin:
Real and Ideal in Constructive Mathematics. Epistemology versus Ontology 2012: 69-85 - 2011
- [c6]Andrea Asperti
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. Calculemus/MKM 2011: 278-280
2000 – 2009
- 2008
- [j17]Francesco Ciraulo
Finitary formal topologies and Stone's representation theorem. Theor. Comput. Sci. 405(1-2): 11-23 (2008) - 2007
- [c5]Giovanni Sambin:
Doing Without Turing Machines: Constructivism and Formal Topology. CiE 2007: 674-675 - [c4]Francesco Ciraulo
Finiteness in a Minimalist Foundation. TYPES 2007: 51-68 - 2006
- [j16]Bernhard Banaschewski, Thierry Coquand, Giovanni Sambin:
Preface. Ann. Pure Appl. Log. 137(1-3): 1-2 (2006) - [j15]Giulia Battilotti, Giovanni Sambin:
Pretopologies and a uniform presentation of sup-lattices, quantales and frames. Ann. Pure Appl. Log. 137(1-3): 30-61 (2006) - 2005
- [j14]Giovanni Sambin, Giorgio Trentinaglia:
On the Meaning of Positivity Relations for Regular Formal Spaces. J. Univers. Comput. Sci. 11(12): 2056-2062 (2005) - [p1]Maria Emilia Maietti, Giovanni Sambin:
Toward a minimalistic foundation for constructive mathematics. From sets and types to topology and analysis 2005 - 2003
- [j13]Thierry Coquand, Giovanni Sambin, Jan M. Smith, Silvio Valentini:
Inductively generated formal topologies. Ann. Pure Appl. Log. 124(1-3): 71-106 (2003) - [j12]Giovanni Sambin:
Some points in formal topology. Theor. Comput. Sci. 305(1-3): 347-408 (2003) - 2000
- [j11]Giovanni Sambin, Giulia Battilotti, Claudia Faggian:
Basic Logic: Reflection, Symmetry, Visibility. J. Symb. Log. 65(3): 979-1013 (2000) - [j10]Thierry Coquand, Sara Sadocco, Giovanni Sambin, Jan M. Smith:
Formal Topologies on The Set of First-Order Formulae. J. Symb. Log. 65(3): 1183-1192 (2000)
1990 – 1999
- 1999
- [j9]Giovanni Sambin:
Subdirectly Irreducible Modal Algebras and Initial Frames. Stud Logica 62(2): 269-282 (1999) - 1998
- [c3]Giovanni Sambin, Silvia Gebellato:
A Preview of the Basic Picture: A New Perspective on Formal Topology. TYPES 1998: 194-207 - [c2]Giovanni Sambin:
Formal topology and domains. Workshop on Domains 1998: 177-190 - 1996
- [j8]Giovanni Sambin, Silvio Valentini, Paolo Virgili:
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology. Theor. Comput. Sci. 159(2): 319-341 (1996) - 1995
- [j7]Giovanni Sambin:
Pretopologies and Completeness Proofs. J. Symb. Log. 60(3): 861-878 (1995) - 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 - 1991
- [j6]George Boolos, Giovanni Sambin:
Provability: the emergence of a mathematical modality. Stud Logica 50(1): 1-23 (1991)
1980 – 1989
- 1989
- [j5]Giovanni Sambin, Virginia Vaccaro:
A New Proof of Sahlqvist's Theorem on Modal Definability and Completeness. J. Symb. Log. 54(3): 992-999 (1989) - 1988
- [j4]Giovanni Sambin, Virginia Vaccaro:
Topology and duality in modal logic. Ann. Pure Appl. Log. 37(3): 249-296 (1988) - 1985
- [j3]George Boolos, Giovanni Sambin:
An incomplete system of modal logic. J. Philos. Log. 14(4): 351-358 (1985) - 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:57 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: