English
Related papers

Related papers: Quotients, inductive types, and quotient inductive…

200 papers

In the first part of this paper, we prove the existence of torsion free covers in the category of representations of quivers, $(Q,R-Mod)$, for a wide class of quivers included in the class of the so-called source injective representation…

Category Theory · Mathematics 2010-09-02 Sergio Estrada , Salahattin Özdemir

We introduce a new way of formalizing the intensional identity type based on the fact that a entity known as computational paths can be interpreted as terms of the identity type. Our approach enjoys the fact that our elimination rule is…

Logic in Computer Science · Computer Science 2015-04-21 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

The conventional general syntax of indexed families in dependent type theories follow the style of "constructors returning a special case", as in Agda, Lean, Idris, Coq, and probably many other systems. Fording is a method to encode indexed…

Logic in Computer Science · Computer Science 2023-10-31 Tesla Zhang

We consider autonomous conservative dynamical systems which are constrained with the condition that the total energy of the system has a specified value. We prove a theorem which provides the quadratic first integrals (QFIs), time-dependent…

Mathematical Physics · Physics 2022-09-13 Antonios Mitsopoulos , Michael Tsamparlis

Motivated by algebraic quantum field theory and our previous work we study properties of inductive systems of \ $C^*$-algebras over arbitrary partially ordered sets. A partially ordered set can be represented as the union of the family of…

Operator Algebras · Mathematics 2019-03-27 Renat Gumerov , Ekaterina Lipacheva , Tamara Grigoryan

We show that it is possible to construct a universe in all Grothendieck topoi with injective codes a la Pujet and Tabareau which is nonetheless generic for small families. As a trivial consequence, we show that their observational type…

Logic in Computer Science · Computer Science 2022-02-14 Daniel Gratzer

We define and study the notions of q-deductive systems, p-deductive systems, deductive systems, maximal and strongly maximal q-deductive systems in quantum-Wajsberg algebras. We also introduce the notion of congruences induced by deductive…

Quantum Algebra · Mathematics 2024-05-01 Lavinia Corina Ciungu

Famous descriptive characterisations of P and PSPACE are restated in terms of the Cook-Nguyen style second order bounded arithmetic. We introduce an axiom of inductive definitions over second order bounded arithmetic. We show that P can be…

Logic · Mathematics 2014-01-21 Naohi Eguchi

We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…

Operator Algebras · Mathematics 2017-07-10 Corey Jones , David Penneys

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau

We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…

Logic in Computer Science · Computer Science 2021-07-20 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

The quotient process of M\"uger and Brugui\`eres is used to construct modular categories and TQFTs out of closed subsets of the Weyl alcove of a simple Lie algebra. In particular it is determined at which levels closed subsets associated to…

Quantum Algebra · Mathematics 2007-05-23 Stephen F. Sawin

Donnay, Garcia and Rouse classified nonsingular quadratic forms $Q$ with integral coefficients and prime numbers $p$ such that the set of quotients of values of $Q$ attained for integer arguments is dense in the field of $p$-adic numbers.…

Number Theory · Mathematics 2020-11-12 Piotr Miska

With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…

Group Theory · Mathematics 2007-05-23 Aleksander Strasburger

We present Tores, a core language for encoding metatheoretic proofs. The novel features we introduce are well-founded Mendler-style (co)recursion over indexed data types and a form of recursion over objects in the index language to build…

Programming Languages · Computer Science 2018-05-02 Rohan Jacob-Rao , Brigitte Pientka , David Thibodeau

Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…

Programming Languages · Computer Science 2026-04-20 Cass Alexandru , Henning Urbat , Thorsten Wißmann

Tangent categories were introduced by Rosicky as a categorical setting for differential structures in algebra and geometry; in recent work of Cockett, Crutwell and others, they have also been applied to the study of differential structure…

Category Theory · Mathematics 2020-06-03 Richard Garner

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

Programming Languages · Computer Science 2026-05-20 Maximilian Doré

We combine the theory of inductive data types with the theory of universal measurings. By doing so, we find that many categories of algebras of endofunctors are actually enriched in the corresponding category of coalgebras of the same…

Category Theory · Mathematics 2023-07-21 Paige Randall North , Maximilien Péroux

In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data types. This is due to the combination of impredicativity and…

Logic in Computer Science · Computer Science 2026-03-05 Herman Geuvers