English
Related papers

Related papers: Oracle modalities

200 papers

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

The aim of this paper is to relate algebraic quantum mechanics to topos theory, so as to construct new foundations for quantum logic and quantum spaces. Motivated by Bohr's idea that the empirical content of quantum physics is accessible…

Quantum Physics · Physics 2009-10-12 Chris Heunen , Nicolaas P. Landsman , Bas Spitters

We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…

Algebraic Topology · Mathematics 2016-01-20 Alexander Berglund

Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of…

Logic in Computer Science · Computer Science 2015-04-20 Ranald Clouston , Rajeev Goré

Using the theory of coalgebra, we introduce a uniform framework for adding modalities to the language of propositional geometric logic. Models for this logic are based on coalgebras for an endofunctor on some full subcategory of the…

Logic · Mathematics 2023-06-22 Nick Bezhanishvili , Jim de Groot , Yde Venema

We discuss the homotopy type theory library in the Lean proof assistant. The library is especially geared toward synthetic homotopy theory. Of particular interest is the use of just a few primitive notions of higher inductive types, namely…

Logic in Computer Science · Computer Science 2017-09-21 Floris van Doorn , Jakob von Raumer , Ulrik Buchholtz

Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…

Category Theory · Mathematics 2020-10-28 Felix Cherubini , Egbert Rijke

Homotopy type theory is a new branch of mathematics which merges insights from abstract homotopy theory and higher category theory with those of logic and type theory. It allows us to represent a variety of mathematical objects as basic…

Logic in Computer Science · Computer Science 2015-10-15 Kristina Sojakova

In recent work we have shown how it is possible to define very precise type systems for object-oriented languages by abstractly compiling a program into a Horn formula f. Then type inference amounts to resolving a certain goal w.r.t. the…

Programming Languages · Computer Science 2010-06-09 Davide Ancona , Giovanni Lagorio

We consider the problem of defining the integers in Homotopy Type Theory (HoTT). We can define the type of integers as signed natural numbers (i.e., using a coproduct), but its induction principle is very inconvenient to work with, since it…

Logic in Computer Science · Computer Science 2020-07-02 Thorsten Altenkirch , Luis Scoccola

Modern categories of spectra such as that of Elmendorf et al equipped with strictly symmetric monoidal smash products allows the introduction of symmetric monoids providing a new way to study highly coherent commutative ring spectra. These…

Algebraic Topology · Mathematics 2022-11-09 Andrew Baker

In Homotopy Type Theory, cohomology theories are studied synthetically using higher inductive types and univalence. This paper extends previous developments by providing the first fully mechanized definition of cohomology rings. These rings…

Algebraic Topology · Mathematics 2022-12-09 Thomas Lamiaux , Axel Ljungström , Anders Mörtberg

Embedded topic models are able to learn interpretable topics even with large and heavy-tailed vocabularies. However, they generally hold the Euclidean embedding space assumption, leading to a basic limitation in capturing hierarchical…

Information Retrieval · Computer Science 2022-10-20 Yishi Xu , Dongsheng Wang , Bo Chen , Ruiying Lu , Zhibin Duan , Mingyuan Zhou

The paper gives a soundness and completeness proof for the implicative fragment of intuitionistic calculus with respect to the semantics of computability logic, which understands intuitionistic implication as interactive algorithmic…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

In general, universal (co)measuring (co)monoids and universal (co)acting bi/Hopf monoids, which prove to be a useful tool in the classification of quantum symmetries, do not always exist. In order to ensure their existence, the support of a…

Category Theory · Mathematics 2025-07-11 Ana Agore , Alexey Gordienko , Joost Vercruysse

This article describes an evaluation of Automated Theorem Proving (ATP) systems on problems taken from the QMLTP library of first-order modal logic problems. Principally, the problems are translated to both typed first-order and…

Logic in Computer Science · Computer Science 2026-04-08 Alexander Steen , Geoff Sutcliffe , Christoph Benzmüller

We develop a general theory of cluster categories, applying to a 2-Calabi-Yau extriangulated category $\mathcal{C}$ and cluster-tilting subcategory $\mathcal{T}$ satisfying only mild finiteness conditions. We show that the structure theory…

Representation Theory · Mathematics 2025-12-01 Jan E. Grabowski , Matthew Pressland

This lecture series is based on joint work in progress with Shaul Barkan, as well as work in progress of the author. The five sections of these notes correspond to the five lectures, but more details have been added. $2$-dimensional…

Category Theory · Mathematics 2025-06-30 Jan Steinebrunner

We study the topological $\mu$-calculus, based on both Cantor derivative and closure modalities, proving completeness, decidability and FMP over general topological spaces, as well as over $T_0$ and $T_D$ spaces. We also investigate…

Logic in Computer Science · Computer Science 2021-05-19 Alexandru Baltag , Nick Bezhanishvili , David Fernández-Duque

We propose for the Effective Topos an alternative construction: a realisability framework composed of two levels of abstraction. This construction simplifies the proof that the Effective Topos is a topos (equipped with natural numbers),…

Logic in Computer Science · Computer Science 2013-07-16 Alexis Bernadet , Stéphane Graham-Lengrand