default search action
Maria Emilia Maietti
Person information
- affiliation: University of Padova, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j20]Maria Emilia Maietti, Pietro Sabelli:
Equiconsistency of the Minimalist Foundation with its classical version. Ann. Pure Appl. Log. 176(1): 103524 (2025) - 2024
- [j19]Michele Contente, Maria Emilia Maietti
:
The compatibility of the minimalist foundation with homotopy type theory. Theor. Comput. Sci. 991: 114421 (2024) - 2023
- [j18]Maria Emilia Maietti, Davide Trotta
A characterization of generalized existential completions. Ann. Pure Appl. Log. 174(4): 103234 (2023) - [c11]Maria Emilia Maietti, Pietro Sabelli:
A topological counterpart of well-founded trees in dependent type theory. MFPS 2023 - 2022
- [j17]Maria Emilia Maietti, Samuele Maschio, Michael Rathjen:
Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice. Log. Methods Comput. Sci. 18(4) (2022) - 2021
- [j16]Maria Emilia Maietti, Samuele Maschio:
A Predicative variant of Hyland's Effective Topos. J. Symb. Log. 86(2): 433-447 (2021) - [j15]Maria Emilia Maietti, Samuele Maschio, Michael Rathjen:
A realizability semantics for inductive formal topologies, Church's Thesis and Axiom of Choice. Log. Methods Comput. Sci. 17(2) (2021)
2010 – 2019
- 2019
- [j14]Thierry Coquand, Maria Emilia Maietti, Erik Palmgren:
Preface to the special issue for The Fifth Workshop on Formal Topology. J. Log. Anal. 11 (2019) - [j13]Maria Emilia Maietti, Fabio Pasquali, Giuseppe Rosolini:
Elementary Quotient Completions, Church's Thesis, and Partioned Assemblies. Log. Methods Comput. Sci. 15(2) (2019) - 2018
- [j12]Hajime Ishihara, Maria Emilia Maietti, Samuele Maschio, Thomas Streicher:
Consistency of the intensional level of the Minimalist Foundation with Church's thesis and axiom of choice. Arch. Math. Log. 57(7-8): 873-888 (2018) - 2017
- [c10]Maria Emilia Maietti:
On Choice Rules in Dependent Type Theory. TAMC 2017: 12-23 - 2016
- [j11]Thierry Coquand, Maria Emilia Maietti, Giovanni Sambin, Peter Schuster:
Preface. Ann. Pure Appl. Log. 167(9): 725 (2016) - [j10]Maria Emilia Maietti, Samuele Maschio:
A Predicative Variant of a Realizability Tripos for the Minimalist Foundation. FLAP 3(4): 595-668 (2016) - 2015
- [j9]Maria Emilia Maietti, Giuseppe Rosolini:
Unifying Exact Completions. Appl. Categorical Struct. 23(1): 43-52 (2015) - 2014
- [c9]Maria Emilia Maietti, Samuele Maschio:
An Extensional Kleene Realizability Semantics for the Minimalist Foundation. TYPES 2014: 162-186 - 2013
- [j8]Francesco Ciraulo
Constructive version of Boolean algebra. Log. J. IGPL 21(1): 44-62 (2013) - [j7]Francesco Ciraulo, Maria Emilia Maietti, Giovanni Sambin:
Convergence in formal topology: a unifying notion. J. Log. Anal. 5 (2013) - [j6]Maria Emilia Maietti, Giuseppe Rosolini:
Quotient Completion for the Foundation of Constructive Mathematics. Logica Universalis 7(3): 371-402 (2013) - 2012
- [i1]Maria Emilia Maietti, Giuseppe Rosolini:
Unifying exact completions. CoRR abs/1212.0966 (2012) - 2011
- [c8]Andrea Asperti
Formalization of Formal Topology by Means of the Interactive Theorem Prover Matita. Calculemus/MKM 2011: 278-280
2000 – 2009
- 2009
- [j5]Maria Emilia Maietti:
A minimalist two-level foundation for constructive mathematics. Ann. Pure Appl. Log. 160(3): 319-354 (2009) - 2007
- [c7]Maria Emilia Maietti:
Quotients over Minimal Type Theory. CiE 2007: 517-531 - 2005
- [j4]Maria Emilia Maietti, Paola Maneggia, Valeria de Paiva
Relating Categorical Semantics for Intuitionistic Linear Logic. Appl. Categorical Struct. 13(1): 1-36 (2005) - [j3]Maria Emilia Maietti:
Modular correspondence between dependent type theories and categories including pretopoi and topoi. Math. Struct. Comput. Sci. 15(6): 1089-1149 (2005) - [p2]Maria Emilia Maietti:
Predicative exponentiation of locally compact formal topologies over inductively generated ones. From sets and types to topology and analysis 2005 - [p1]Maria Emilia Maietti, Giovanni Sambin:
Toward a minimalistic foundation for constructive mathematics. From sets and types to topology and analysis 2005 - 2004
- [j2]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) - [c6]Maria Emilia Maietti:
Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe. CTCS 2004: 105-126 - 2002
- [c5]Maria Emilia Maietti, Silvio Valentini:
Exponentiation of Scott Formal Topologies. Workshop on Domains 2002: 111-131 - [c4]Maria Emilia Maietti:
Joyal's arithmetic universes via type theory. CTCS 2002: 272-286 - 2000
- [c3]Maria Emilia Maietti, Valeria de Paiva
Categorical Models for Intuitionistic and Linear Type Theory. FoSSaCS 2000: 223-237
1990 – 1999
- 1999
- [j1]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) - 1998
- [c2]Maria Emilia Maietti:
About Effective Quotients in Constructive Type Theory. TYPES 1998: 164-178 - 1996
- [c1]Maria Emilia Maietti:
The Internal Type Theory of a Heyting Pretopos. TYPES 1996: 216-235
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-12-10 20:51 CET 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: