English
Related papers

Related papers: Modal Dependent Type Theory and Dependent Right Ad…

200 papers

In a recent paper, Krawczyk proved that there are continuum many axiomatic extensions of global consequence associated with the modal system $E$ that do not admit the local deduction detachment theorem. In algebraic parlance, he showed that…

Logic · Mathematics 2024-02-13 Zalán Gyenis , Zalán Molnár

We prove an extensionality theorem for the "type-in-type" dependent type theory with Sigma-types. We suggest that the extensional equality type be identified with the logical equivalence relation on the free term model of type theory.

Logic in Computer Science · Computer Science 2014-01-07 Andrew Polonsky

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

Locally cartesian closed (lcc) categories are natural categorical models of extensional dependent type theory. This paper introduces the "gros" semantics in the category of lcc categories: Instead of constructing an interpretation in a…

Category Theory · Mathematics 2021-05-26 Martin E. Bidlingmaier

We introduce the notion of a logical model category which is a Quillen model category satisfying some additional conditions. Those conditions provide enough expressive power that one can soundly interpret dependent products and sums in it.…

Logic · Mathematics 2012-08-30 Peter Arndt , Chris Kapulkin

We use type-theoretic techniques to present an algebraic theory of $\infty$-categories with strict units. Starting with a known type-theoretic presentation of fully weak $\infty$-categories, in which terms denote valid operations, we extend…

Logic in Computer Science · Computer Science 2022-05-27 Eric Finster , David Reutter , Alex Rice , Jamie Vicary

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

Logic in Computer Science · Computer Science 2023-06-22 Łukasz Czajka

We define and axiomatize three new logics based on the connexive logic $\mathsf{C}$, the modal logic $\mathsf{CnK}$ and the conditional logics $\mathsf{CnCK}$ and $\mathsf{CnCK}_R$. These logics display strong connexivity properties and are…

Logic · Mathematics 2025-12-12 Grigory K. Olkhovikov

Parametricity is a key metatheoretic property of type systems, which implies strong uniformity & modularity properties of the structure of types within systems possessing it. In recent years, various systems of dependent type theory have…

Logic in Computer Science · Computer Science 2024-12-18 C. B. Aberlé

In dependent type theory, being able to refer to a type universe as a term itself increases its expressive power, but requires mechanisms in place to prevent Girard's paradox from introducing logical inconsistency in the presence of…

Programming Languages · Computer Science 2025-03-03 Jonathan Chan , Stephanie Weirich

We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…

Category Theory · Mathematics 2021-07-13 Michael Shulman

We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…

Logic · Mathematics 2014-08-20 Jouko Väänänen

We introduce a new categorical framework for studying derived functors, and in particular for comparing composites of left and right derived functors. Our central observation is that model categories are the objects of a double category…

Category Theory · Mathematics 2011-03-01 Michael Shulman

Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…

Logic in Computer Science · Computer Science 2025-09-17 Ádám Kurucz , Péter Bereczky , Dániel Horpácsi

We review the notions of a multiplier category and the $W^{*}$-envelope of a $C^{*}$-category. We then consider the notion of an orthogonal sum of a (possibly infinite) family of objects in a $C^{*}$-category. Furthermore, we construct…

K-Theory and Homology · Mathematics 2025-12-11 Ulrich Bunke , Alexander Engel

We investigate when the categories of all rational $A$-modules and of finite dimensional rational modules are closed under extensions inside the category of $C^*$-modules, where $C^*$ is the cofinite topological completion of $A$. We give a…

Category Theory · Mathematics 2011-10-13 Miodrag C. Iovanov

We provide several crucial technical extensions of the theory of stable independence notions in accessible categories. In particular, we describe circumstances under which a stable independence notion can be transferred from a subcategory…

Logic · Mathematics 2022-08-31 Michael Lieberman , Jiri Rosicky , Sebastien Vasey

Let $\mathcal{C}$ be a finite tensor category, and let $\mathcal{M}$ be an exact left $\mathcal{C}$-module category. The action of $\mathcal{C}$ on $\mathcal{M}$ induces a functor $\rho: \mathcal{C} \to \mathrm{Rex}(\mathcal{M})$, where…

Quantum Algebra · Mathematics 2018-04-03 Kenichi Shimizu

In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule. One should…

Logic in Computer Science · Computer Science 2019-04-16 Jiaming Jiang , Harley Eades , Valeria de Paiva

Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary…

Logic in Computer Science · Computer Science 2022-07-04 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki
‹ Prev 1 3 4 5 6 7 10 Next ›