SearcharxivSearch

arXiv subjects

Pietro Sabelli

Publications and source records attributed to Pietro Sabelli.

4 recordsLinked to original sources

Equiconsistency of the Minimalist Foundation with its classical version

The Minimalist Foundation, for short MF, was conceived by the first author with G. Sambin in 2005, and fully formalized in 2009, as a common core among the most relevant constructive and classical foundations for mathematics. To better accomplish its minimality, MF was designed as a two-level type theory, with an intensional level mTT, an extensional one emTT, and an interpretation of the latter into the first. Here, we first show that the two levels of MF are indeed equiconsistent by interpreting mTT into emTT. Then, we show that the classical extension emTT^c is equiconsistent with emTT by suitably extending the Gödel-Gentzen double-negation translation of classical logic in the intuitionistic one. As a consequence, MF turns out to be compatible with classical predicative mathematics à la Weyl, contrary to the most relevant foundations for constructive mathematics. Finally, we show that the chain of equiconsistency results for MF can be straightforwardly extended to its impredicative version to deduce that Coquand-Huet's Calculus of Constructions equipped with basic inductive types is equiconsistent with its extensional and classical versions too.

math.LO

A topological reading of inductive and coinductive definitions in Dependent Type Theory

In the context of dependent type theory, we show that coinductive predicates have an equivalent topological counterpart in terms of coinductively generated positivity relations, introduced by G. Sambin to represent closed subsets in point-free topology. Our work is complementary to a previous one with M.E. Maietti, where we showed that, in dependent type theory, the well-known concept of wellfounded trees has a topological equivalent counterpart in terms of proof-relevant inductively generated formal covers used to provide a predicative and constructive representation of complete suplattices. All proofs in Martin-Löf's type theory are formalised in the Agda proof assistant.

math.LO

A topological counterpart of well-founded trees in dependent type theory

Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology under the name of inductively generated basic covers. In more detail, we show, firstly, that in Homotopy Type Theory, W-types and proof relevant inductively generated basic covers are propositionally mutually encodable. Secondly, we prove they are definitionally mutually encodable in the Agda implementation of intensional Martin-Loef's type theory. Finally, we reframe the equivalence in the Minimalist Foundation framework by introducing well-founded predicates as the logical counterpart for predicates of dependent W-types. All the results have been checked in the Agda proof-assistant.

cs.LO