1,047 research outputs found
Naive cubical type theory
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
Naive cubical type theory
This paper 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
Towards a Cubical Type Theory without an Interval
Following the cubical set model of type theory which validates the
univalence axiom, cubical type theories have been developed that
interpret the identity type using an interval pretype. These theories start from a geometric view of equality. A proof of equality is encoded as a term in a context extended by the interval pretype. Our goal is to develop a cubical theory where the identity type is defined recursively over the type structure, and the geometry arises from these definitions. In this theory, cubes are present explicitly, e.g., a line is a telescope with 3 elements: two endpoints and the connecting equality. This is in line with Bernardy and Moulin\u27s earlier work on internal parametricity. In this paper we present a naive syntax for internal parametricity and by replacing the parametric interpretation of the universe, we extend it to univalence. However, we do not know how to compute in this theory. As a second step, we present a version of the theory for parametricity with named dimensions which has an operational semantics. Extending this syntax to univalence is left as further work
Towards a cubical type theory without an interval
Following the cubical set model of type theory which validates the univalence axiom, cubical type theories have been developed that interpret the identity type using an interval pretype. These theories start from a geometric view of equality. A proof of equality is encoded as a term in a context extended by the interval pretype. Our goal is to develop a cubical theory where the identity type is defined recursively over the type structure, and the geometry arises from these definitions. In this theory, cubes are present explicitly, e.g. a line is a telescope with 3 elements: two endpoints and the connecting equality. This is in line with Bernardy and Moulin's earlier work on internal parametricity. In this paper we present a naive syntax for internal parametricity and by replacing the parametric interpretation of the universe, we extend it to univalence. However, we don't know how to compute in this theory. As a second step, we present a version of the theory for parametricity with named dimensions which has an operational semantics. Extending this syntax to univalence is left as further work
Higher homotopy operations and cohomology
We explain how higher homotopy operations, defined topologically, may be
identified under mild assumptions with (the last of) the Dwyer-Kan-Smith
cohomological obstructions to rectifying homotopy-commutative diagrams.Comment: 28 page
On the difficulty of presenting finitely presentable groups
We exhibit classes of groups in which the word problem is uniformly solvable
but in which there is no algorithm that can compute finite presentations for
finitely presentable subgroups. Direct products of hyperbolic groups, groups of
integer matrices, and right-angled Coxeter groups form such classes. We discuss
related classes of groups in which there does exist an algorithm to compute
finite presentations for finitely presentable subgroups. We also construct a
finitely presented group that has a polynomial Dehn function but in which there
is no algorithm to compute the first Betti number of the finitely presentable
subgroups.Comment: Final version. To appear in GGD volume dedicated to Fritz Grunewal
Efficiently Storing Well-Composed Polyhedral Complexes Computed Over 3D Binary Images
A 3D binary image I can be naturally represented
by a combinatorial-algebraic structure called cubical complex
and denoted by Q(I ), whose basic building blocks are
vertices, edges, square faces and cubes. In Gonzalez-Diaz
et al. (Discret Appl Math 183:59–77, 2015), we presented a
method to “locally repair” Q(I ) to obtain a polyhedral complex
P(I ) (whose basic building blocks are vertices, edges,
specific polygons and polyhedra), homotopy equivalent to
Q(I ), satisfying that its boundary surface is a 2D manifold.
P(I ) is called a well-composed polyhedral complex over the
picture I . Besides, we developed a new codification system
for P(I ), encoding geometric information of the cells
of P(I ) under the form of a 3D grayscale image, and the
boundary face relations of the cells of P(I ) under the form
of a set of structuring elements. In this paper, we build upon
(Gonzalez-Diaz et al. 2015) and prove that, to retrieve topological
and geometric information of P(I ), it is enough to
store just one 3D point per polyhedron and hence neither
grayscale image nor set of structuring elements are needed.
From this “minimal” codification of P(I ), we finally present
a method to compute the 2-cells in the boundary surface of
P(I ).Ministerio de EconomĂa y Competitividad MTM2015-67072-
Stable cohomology of spaces of non-singular hypersurfaces
We prove that the rational cohomology of the space of non-singular complex
homogeneous polynomials of degree d in a fixed number of variables stabilizes
to the cohomology of the general linear group for d sufficiently large.Comment: 11 pages; v3: stabilization range made explicit, proof of Lemma 3
corrected and expande
Decomposing the Univalence Axiom
This paper investigates Voevodsky's univalence axiom in intensional Martin-Löf type theory. In particular, it looks at how univalence can be derived from simpler axioms. We first present some existing work, collected together from various published and unpublished sources; we then present a new decomposition of the univalence axiom into simpler axioms. We argue that these axioms are easier to verify in certain potential models of univalent type theory, particularly those models based on cubical sets. Finally we show how this decomposition is relevant to an open problem in type theory
- …