Modal Homotopy Type Theory: The Prospect of a New Logic for Philosophy provides a reasonably gentle introduction to this new logic, thoroughly motivated by intuitive explanations of the need for all of its component parts, and illustrated through innovative applications of the calculus.

Homotopy Type Theory (HoTT) is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various (...) questions that a foundation for mathematics might be expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory (but is compatible with the homotopy interpretation), and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics? 2.1 A characterization of a foundation for mathematics 2.2 Autonomy3 The Basic Features of Homotopy Type Theory 3.1 The rules 3.2 The basic ways to construct types 3.3 Types as propositions and propositions as types 3.4 Identity 3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types 5.1 Tokens as mathematical objects? 5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy 7.1 Framework 7.2 Semantics 7.3 Metaphysics 7.4 Epistemology 7.5 Methodology8 Possible Objections to this Account 8.1 A constructive foundation for mathematics? 8.2 What are concepts? 8.3 Isn’t this just Brouwerian intuitionism? 8.4 Duplicated objects 8.5 Intensionality and substitution salva veritate9 Conclusion 9.1 Advantages of this foundation. (shrink)

I explore the possibility of a structuralist interpretation of homotopy type theory (HoTT) as a foundation for mathematics. There are two main aspects to HoTT's structuralist credentials. First, it builds on categorical set theory (CST), of which the best-known variant is Lawvere's ETCS. I argue that CST has merit as a structuralist foundation, in that it ascribes only structural properties to typical mathematical objects. However, I also argue that this success depends on the adoption of a (...) strict typing system which undermines the metaphysical seriousness of this structuralism. Homotopy type theory adds to CST a distinctive theory of identity between sets, which arguably allows its objects to be seen as ante rem structures. I examine the prospects for such a view, and address many other interpretive problems as they arise. (shrink)

Homotopy Type Theory is a proposed new language and foundation for mathematics, combining algebraic topology with logic. An important rule for the treatment of identity in HoTT is path induction, which is commonly explained by appeal to the homotopy interpretation of the theory's types, tokens, and identities as spaces, points, and paths. However, if HoTT is to be an autonomous foundation then such an interpretation cannot play a fundamental role. In this paper we give a (...) derivation of path induction, motivated from pre-mathematical considerations, without recourse to homotopy theory. (shrink)

Homotopy Type Theory is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various questions (...) that a foundation for mathematics might be expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory, and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics?2.1 A characterization of a foundation for mathematics2.2 Autonomy3 The Basic Features of Homotopy Type Theory3.1 The rules3.2 The basic ways to construct types3.3 Types as propositions and propositions as types3.4 Identity3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types5.1 Tokens as mathematical objects?5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy7.1 Framework7.2 Semantics7.3 Metaphysics7.4 Epistemology7.5 Methodology8 Possible Objections to this Account8.1 A constructive foundation for mathematics?8.2 What are concepts?8.3 Isn’t this just Brouwerian intuitionism?8.4 Duplicated objects8.5 Intensionality and substitution salva veritate9 Conclusion9.1 Advantages of this foundation. (shrink)

The Hole Argument is primarily about the meaning of general covariance in general relativity. As such it raises many deep issues about identity in mathematics and physics, the ontology of space–time, and how scientific representation works. This paper is about the application of a new foundational programme in mathematics, namely homotopy type theory, to the Hole Argument. It is argued that the framework of HoTT provides a natural resolution of the Hole Argument. The role of the Univalence (...) Axiom in the treatment of the Hole Argument in HoTT is clarified. (shrink)

The Univalence axiom, due to Vladimir Voevodsky, is often taken to be one of the most important discoveries arising from the Homotopy Type Theory research programme. It is said by Steve Awodey that Univalence embodies mathematical structuralism, and that Univalence may be regarded as ‘expanding the notion of identity to that of equivalence’. This article explores the conceptual, foundational and philosophical status of Univalence in Homotopy Type Theory. It extends our Types-as-Concepts interpretation of HoTT (...) to Universes, and offers an account of the Univalence axiom in such terms. We consider Awodey’s informal argument that Univalence is motivated by the principle that reasoning should be invariant under isomorphism, and we examine whether an autonomous and rigorous justification along these lines can be given. We consider two problems facing such a justification. First, there is a difference between equivalence and isomorphism and Univalence must be formulated in terms of the former. Second, the argument as presented cannot establish Univalence itself but only a weaker version of it, and must be supplemented by an additional principle. The article argues that the prospects for an autonomous justification of Univalence are promising. (shrink)

1. The theory referred to by the—perhaps intimidating—main title of this book is an extension of Per Martin-Löf's dependent type theory. Much philosophical work pertaining to dependent type theory...

The notion of a natural model of type theory is defined in terms of that of a representable natural transfomation of presheaves. It is shown that such models agree exactly with the concept of a category with families in the sense of Dybjer, which can be regarded as an algebraic formulation of type theory. We determine conditions for such models to satisfy the inference rules for dependent sums Σ, dependent products Π, and intensional identity types (...) Id, as used in homotopy type theory. It is then shown that a category admits such a model if it has a class of maps that behave like the abstract fibrations in axiomatic homotopy theory: they should be stable under pullback, closed under composition and relative products, and there should be weakly orthogonal factorizations into the class. It follows that many familiar settings for homotopy theory also admit natural models of the basic system of homotopy type theory. (shrink)

As a new foundational language for mathematics with its very different idea as to the status of logic, we should expect homotopy type theory to shed new light on some of the problems of philosophy which have been treated by logic. In this article, definite description, and in particular its employment within mathematics, is formulated within the type theory. Homotopy type theory has been proposed as an inherently structuralist foundational language for mathematics. (...) Using the new formulation of definite descriptions, opportunities to express ‘the structure of’ within homotopy type theory are explored, and it is shown there is little or no need for this expression. (shrink)

In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky’s univalent interpretation of it. This interpretation has given rise to the univalent foundations program, which is the topic of the current special year at the Institute for Advanced Study.

The purpose of this informal survey article is to introduce the reader to a new and surprising connection between Logic, Geometry, and Algebra which has recently come to light in the form of an interpretation of the constructive type theory of Per Martin-Löf into homotopy theory and higher-dimensional category theory.

The original article has been corrected. The article is published with Open Access but was missing Open Access information. This has been added.

Working in homotopy type theory, we provide a systematic study of homotopy limits of diagrams over graphs, formalized in the Coq proof assistant. We discuss some of the challenges posed by this approach to the formalizing homotopy-theoretic material. We also compare our constructions with the more classical approach to homotopy limits via fibration categories.

This article proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the homotopy type theory book for dependent type theory augmented with axioms for univalence and higher inductive types. We adopt a cartesian cubical type theory proposed by Angiuli, Brunerie, Coquand, (...) Favonia, Harper, and Licata as the implicit foundation, confining our presentation to elementary results such as function extensionality, the derivation of weak connections and path induction, the groupoid structure of types, and the Eckmman–Hilton duality. (shrink)

Drawing on the analogy between any unary first-order quantifier and a "face operator," this paper establishes several connections between model theory and homotopy theory. The concept of simplicial set is brought into play to describe the formulae of any first-order language L, the definable subsets of any L-structure, as well as the type spaces of any theory expressed in L. An adjunction result is then proved between the category of o-minimal structures and a subcategory of (...) the category of linearly ordered simplicial sets with distinguished vertices. (shrink)

Mathematicians often consider Zermelo-Fraenkel Set Theory with Choice (ZFC) as the only foundation of Mathematics, and frequently don’t actually want to think much about foundations. We argue here that modern Type Theory, i.e. Homotopy Type Theory (HoTT), is a preferable and should be considered as an alternative.

Quillen [17] introduced model categories as an abstract framework for homotopy theory which would apply to a wide range of mathematical settings. By all accounts this program has been a success and—as, e.g., the work of Voevodsky on the homotopy theory of schemes [15] or the work of Joyal [11, 12] and Lurie [13] on quasicategories seem to indicate—it will likely continue to facilitate mathematical advances. In this paper we present a novel connection between model categories (...) and mathematical logic, inspired by the groupoid model of (intensional) Martin–Löf type theory [14] due to Hofmann and Streicher [9]. In particular, we show that a form of Martin–Löf type theory can be soundly modelled in any model category. This result indicates moreover that any model category has an associated “internal language” which is itself a form of Martin-Löf type theory. This suggests applications both to type theory and to homotopy theory. Because Martin–Löf type theory is, in one form or another, the theoretical basis for many of the computer proof assistants currently in use, such as Coq and Agda (cf. [3] and [5]), this promise of applications is of a practical, as well as theoretical, nature. This paper provides a precise indication of this connection between homotopy theory and logic; a more detailed discussion of these and further results will be given in [20]. (shrink)

We introduce a new model construction for Martin-Löf intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines, by gluing along the functor from the category of contexts to the category of groupoids, the syntactic model with a notion of realizability. As our main application, we use the model to analyse the syntactic groupoid associated to the type theory generated by a graph G, showing that it (...) has the same homotopy type as the free groupoid generated by G. (shrink)

In a series of papers Ladyman and Presnell raise an interesting challenge of providing a pre-mathematical justification for homotopy type theory. In response, they propose what they claim to be an informal semantics for homotopy type theory where types and terms are regarded as mathematical concepts. The aim of this paper is to raise some issues which need to be resolved for the successful development of their types-as-concepts interpretation.

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-Löf type theory. This is done by showing that the comprehension category associated with a type-theoretic algebraic weak factorisation system satisfies the assumptions necessary to apply a right adjoint method for splitting comprehension categories. We then provide methods for constructing several examples of type-theoretic algebraic weak factorisation systems, encompassing the existing groupoid and cubical sets models, as well (...) as new models based on normal fibrations. (shrink)

Homotopy type theory (HoTT) enables reasoning about groups directly as the types of symmetries (automorphisms) of mathematical structures. The HoTT approach to groups—first put forward by Buchholtz, van Doorn, and Rijke—identifies a group with the type of objects of which it is the symmetries. This type is called the “delooping” of the group, taking a term from algebraic topology. This approach naturally extends the group theory to higher groups which have symmetries between symmetries, and (...) so on. In this paper, we formulate and prove a higher version of Schreier’s classification of all group extensions of a given group. Specifically, we prove that extensions of a group G by a group K are classified by actions of G on a delooping of K. Our proof is formalized in Cubical Agda, a dependently typed programming language and proof assistant which implements HoTT. (shrink)

The aim of the present thesis is twofold. First we propose a constructive solution to Frege's puzzle using an approach based on homotopy type theory, a newly proposed foundation of mathematics that possesses a higher-dimensional treatment of equality. We claim that, from the viewpoint of constructivism, Frege's solution is unable to explain the so-called ‘cognitive significance' of equality statements, since, as we shall argue, not only statements of the form 'a = b', but also 'a = a' (...) may contribute to an extension of knowledge. Second, we study this higher-dimensional account of equality from a constructive (computational) standpoint and, based on these considerations, we offer a new perspective to the project proposed by Peter Aczel of developing conventions and notations for an informal style of doing mathematics in type theory. To that end, we adopt the cubical type theory of Angiuli, Favonia and Harper, a framework that can be seen as constructive refinement of the ideas of homotopy type theory. (shrink)

We characterize the epimorphisms in homotopy type theory (HoTT) as the fiberwise acyclic maps and develop a type-theoretic treatment of acyclic maps and types in the context of synthetic homotopy theory as developed in univalent foundations. We present examples and applications in group theory, such as the acyclicity of the Higman group, through the identification of groups with 0-connected, pointed 1-types. Many of our results are formalized as part of the agda-unimath library.

Let T be the theory of dense cyclically ordered sets with at least two elements. We determine the classifying space of $\mathsf {Mod}(T)$ to be homotopically equivalent to $\mathbb {CP}^\infty $. In particular, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )=\mathbb {Z}$, which answers a question in our previous work. The computation is based on Connes’ cycle category $\Lambda $.

We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We then use this formulation to prove the central property of this interpretation, namely homotopy invariance. To do this, we use the result from [8] that any Grothendieck fibration of the kind being considered can automatically be upgraded to a two-dimensional fibration, after which the invariance (...) property is reduced to an abstract theorem concerning pseudonatural transformations of morphisms into two-dimensional fibrations. (shrink)

This edited work presents contemporary mathematical practice in the foundational mathematical theories, in particular set theory and the univalent foundations. It shares the work of significant scholars across the disciplines of mathematics, philosophy and computer science. Readers will discover systematic thought on criteria for a suitable foundation in mathematics and philosophical reflections around the mathematical perspectives. The first two sections focus on the two most prominent candidate theories for a foundation of mathematics. Readers may trace current research in set (...) theory, which has widely been assumed to serve as a framework for foundational issues, as well as new material elaborating on the univalent foundations, considering an approach based on homotopy type theory (HoTT). The further sections then build on this and are centred on philosophical questions connected to the foundations of mathematics. Here, the authors contribute to discussions on foundational criteria with more general thoughts on the foundations of mathematics which are not connected to particular theories. This book shares the work of some of the most important scholars in the fields of set theory (S. Friedman), non-classical logic (G. Priest) and the philosophy of mathematics (P. Maddy). The reader will become aware of the advantages of each theory and objections to it as a foundation, following the latest and best work across the disciplines and it is therefore a valuable read for anyone working on the foundations of mathematics or in the philosophy of mathematics. (shrink)

One takes advantage of some basic properties of every homotopic $\lambda$-model (e.g. extensional Kan complex) to explore the higher $\beta\eta$-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher $\lambda$-terms, whose equality rules would be contained in the theory of any $\lambda$-homotopic model.

I apply homotopy type theory to the hole argument as formulated by Earman and Norton. I argue that HoTT gives a precise sense in which diffeomorphism-related Lorentzian manifolds represent the same spacetime, undermining Earman and Norton’s verificationist dilemma and common formulations of the hole argument. However, adopting this account does not alleviate worries about determinism: general relativity formulated on Lorentzian manifolds is indeterministic using this standard of sameness and the natural formalization of determinism in HoTT. Fixing this (...) indeterminism results in a more faithful mathematical representation of general relativity as used by physicists. It also gives a substantive notion of general covariance. (shrink)

This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony (...) through category theory. This categorical harmony is stated in terms of adjoints and says that any concept definable by iterated adjoints from general categorical operations is harmonious. Moreover, it has been shown that identity in a categorical setting is determined by an adjoint in the relevant way. Furthermore, path induction as a rule comes from this definition. Thus we arrive at an account of how path induction, as a rule of inference governing identity, can be justified on mathematically motivated grounds. (shrink)

In 1900 David Hilbert announced his famous list of then-opened mathematical problems; the problem number 6 in this list is axiomatization of physical theories. Since then a lot of systematic efforts have been invested into solving this problem. However the results of these efforts turned to be less successful than the early enthusiasts of axiomatic method expected. The existing axiomatizations of physical and biological theories provide a valuable logical analysis of these theories but they do not constitute anything like their (...) standard presentation,which can be used for transmission, evaluation, and justification of physical and biological knowledge. This state of theart in the axiomatization of physics is strong evidence that the standard notion of axiomatic theory stemming from Hilbert and Tarski is not appropriate for thet ask. However in the recent years in mathematics there emerged a new axiomatic approach best represented by the Homotopy Type theory (HoTT). We argue that the constructive axiomatic architecture used in HoTT has better chances to be successfully applied in physics as well as in computer science and engineering. (shrink)

We show that Martin Hyland's effective topos can be exhibited as the homotopy category of a path category EFF. Path categories are categories of fibrant objects in the sense of Brown satisfying two additional properties and as such provide a context in which one can interpret many notions from homotopy theory and Homotopy Type Theory. Within the path category EFF one can identify a class of discrete fibrations which is closed under push forward along (...) arbitrary fibrations (in other words, this class is polymorphic or closed under impredicative quantification) and satisfies propositional resizing. This class does not have a univalent representation, but if one restricts to those discrete fibrations whose fibres are propositions in the sense of Homotopy Type Theory, then it does. This means that, modulo the usual coherence problems, it can be seen as a model of the Calculus of Constructions with a univalent type of propositions. We will also build a more complicated path category in which the class of discrete fibrations whose fibres are sets in the sense of Homotopy Type Theory has a univalent representation, which means that this will be a model of the Calculus of Constructions with a univalent type of sets. (shrink)

The recent discovery of an interpretation of constructive type theory into abstract homotopy theory suggests a new approach to the foundations of mathematics with intrinsic geometric content and a computational implementation. Voevodsky has proposed such a program, including a new axiom with both geometric and logical significance: the Univalence Axiom. It captures the familiar aspect of informal mathematical practice according to which one can identify isomorphic objects. While it is incompatible with conventional foundations, it is a (...) powerful addition to homotopy type theory. It also gives the new system of foundations a distinctly structural character. (shrink)

In the Univalent Foundations of mathematics spatial notions like “point” and “path” are primitive, rather than derived, and all of mathematics is encoded in terms of them. A Homotopy Type Theory is any formal system which realizes this idea. In this paper I will focus on the question of whether a Homotopy Type Theory can be justified intuitively as a theory of shapes in the same way that ZFC can be justified intuitively as (...) a theory of collections. I first clarify what such an “intuitive justification” should be by distinguishing between formal and pre-formal “meaning explanations” in the vein of Martin-Löf. I then go on to develop a pre-formal meaning explanation for HoTT in terms of primitive spatial notions like “shape”, “path” etc. (shrink)

I argue that the two-dimensional hyperintensions of epistemic topic-sensitive two-dimensional truthmaker semantics provide a compelling solution to the access problem. -/- I countenance an abstraction principle for two-dimensional hyperintensions based on Voevodsky's Univalence Axiom and function type equivalence in Homotopy Type Theory. The truth of my first-order abstraction principle for two-dimensional hyperintensions is grounded in its being possibly recursively enumerable i.e. Turing computable and the Turing machine being physically implementable. I apply, further, modal rationalism in modal (...) epistemology to solve the access problem. Epistemic possibility and hyperintensionality, i.e. conceivability, can be a guide to metaphysical possibility and hyperintensionality, when (i) epistemic worlds or epistemic hyperintensional states are interpreted as being centered metaphysical worlds or hyperintensional states, i.e. indexed to an agent, when (ii) the epistemic (hyper-)intensions and metaphysical (hyper-)intensions for a sentence coincide, i.e. the hyperintension has the same value irrespective of whether the worlds in the argument of the functions are considered as epistemic or metaphysical, and when (iii) sentences are said to consist in super-rigid expressions, i.e. rigid expressions in all epistemic worlds or states and in all metaphysical worlds or states. I argue that (i) and (ii) obtain in the case of the access problem. (shrink)

How does one formalize the structure of structures necessary for the foundations of physics? This work is an attempt at conceptualizing the metaphysics of pregeometric structures, upon which new and existing notions of quantum geometry may find a foundation. We discuss the philosophy of pregeometric structures due to Wheeler, Leibniz as well as modern manifestations in topos theory. We draw attention to evidence suggesting that the framework of formal language, in particular, homotopy type theory, provides the (...) conceptual building blocks for a theory of pregeometry. This work is largely a synthesis of ideas that serve as a precursor for conceptualizing the notion of space in physical theories. In particular, the approach we espouse is based on a constructivist philosophy, wherein ``structureless structures'' are syntactic types realizing formal proofs and programs. Spaces and algebras relevant to physical theories are modeled as type-theoretic routines constructed from compositional rules of a formal language. This offers the remarkable possibility of taxonomizing distinct notions of geometry using a common theoretical framework. In particular, this perspective addresses the crucial issue of how spatiality may be realized in models that link formal computation to physics, such as the Wolfram model. (shrink)

This essay aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of Voevodsky's Univalence Axiom and function type equivalence in Homotopy Type Theory, in order to specify an abstraction principle for epistemic (hyper-)intensions. The homotopic abstraction principle for epistemic (hyper-)intensions provides an epistemic conduit for our knowledge of (hyper-)intensions as abstract objects. Higher observational type theory might be one way to make first-order abstraction principles defined (...) via inference rules, although not higher-order abstraction principles, computable. The truth of my first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable i.e. Turing computable and the Turing machine being physically implementable. Epistemic modality and hyperintensionality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the language of thought. (shrink)

This paper aims to vindicate the thesis that cognitive computational properties are abstract objects implemented in physical systems. I avail of the equivalence relations countenanced in Homotopy Type Theory, in order to specify an abstraction principle for epistemic intensions. The homotopic abstraction principle for epistemic intensions provides an epistemic conduit into our knowledge of intensions as abstract objects. I examine, then, how intensional functions in Epistemic Modal Algebra are deployed as core models in the philosophy of mind, (...) Bayesian perceptual psychology, and the program of natural language semantics in linguistics, and I argue that this provides abductive support for the truth of homotopic abstraction. Epistemic modality can thus be shown to be both a compelling and a materially adequate candidate for the fundamental structure of mental representational states, comprising a fragment of the Language of Thought. (shrink)

Marc Lange argues that proofs by mathematical induction are generally not explanatory because inductive explanation is irreparably circular. He supports this circularity claim by presenting two putative inductive explanantia that are one another’s explananda. On pain of circularity, at most one of this pair may be a true explanation. But because there are no relevant differences between the two explanantia on offer, neither has the explanatory high ground. Thus, neither is an explanation. I argue that there is no important asymmetry (...) between the two cases because they are two presentations of the same explanation. The circularity argument requires a problematic notion of identity of proofs. I argue for a criterion of proof individuation that identifies the two proofs Lange offers. This criterion can be expressed in two equivalent ways: one uses the language of homotopy type theory, and the second assigns algebraic representatives to proofs. Though I will concentrate on one example, a criterion of proof identity has much broader consequences: any investigation into mathematical practice must make use of some proof-individuation principle. (shrink)

Structuralism, the view that mathematics is the science of structures, can be characterized as a philosophical response to a general structural turn in modern mathematics. Structuralists aim to understand the ontological, epistemological, and semantical implications of this structural approach in mathematics. Theories of structuralism began to develop following the publication of Paul Benacerraf’s paper ‘What numbers could not be’ in 1965. These theories include non-eliminative approaches, formulated in a background ontology of sui generis structures, such as Stewart Shapiro’s ante rem (...) structuralism and Michael Resnik’s pattern structuralism. In contrast, there are also eliminativist accounts of structuralism, such as Geoffrey Hellman’s modal structuralism, which avoids sui generis structures. These research projects have guided a more systematic focus on philosophical topics related to mathematical structuralism, including the identity criteria for objects in structures, dependence relations between objects and structures, and also, more recently, structural abstraction principles. Parallel to these developments are approaches that describe mathematical structure in category-theoretic terms. Category-theoretic approaches have been further developed using tools from homotopy type theory. Here we find a strong relationship between mathematical structuralism and the univalent foundations project, an approach to the foundations of mathematics based on higher category theory. (shrink)

Ladyman and Presnell have recently argued that the Hole argument is naturally resolved when spacetime is represented within homotopy type theory rather than set theory. The core idea behind their proposal is that the argument does not confront us with any indeterminism, since the set-theoretically different representations of spacetime involved in the argument are homotopy type-theoretically identical. In this article, we will offer a new resolution based on ZFC set theory to the argument. (...) It neither relies on a constructive-intuitionistic form of mathematics, as used by Ladyman and Presnell, nor is foundationally problematic, such as the existing set-theoretic suggestions. (shrink)

Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims to bridge the gap between interactive and automated theorem proving, by situating automated tools and methods in a framework that supports user interaction and the construction of fully specified axiomatic proofs. Lean is an ongoing and long-term effort, but it already provides many useful components, integrated development environments, and a (...) rich API which can be used to embed it into other systems. It is currently being used to formalize category theory, homotopy type theory, and abstract algebra. We describe the project goals, system architecture, and main features, and we discuss applications and continuing work. (shrink)