English
Related papers

Related papers: On Quantitative Algebraic Higher-Order Theories

200 papers

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

Quantum logic aims to capture essential quantum mechanical structure in order-theoretic terms. The Achilles' heel of quantum logic is the absence of a canonical description of composite systems, given descriptions of their components. We…

Quantum Physics · Physics 2013-05-10 Bob Coecke , Chris Heunen , Aleks Kissinger

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field $k$. We survey some results on algebras of finite global dimension and address some open problems.

Representation Theory · Mathematics 2012-09-11 Dieter Happel , Dan Zacharia

The differential $\lambda$-calculus studies how the quantitative aspects of programs correspond to differentiation and to Taylor expansion inside models of linear logic. Recent work has generalized the axioms of Taylor expansion so they…

Logic in Computer Science · Computer Science 2026-03-27 Christine Tasson , Aymeric Walch

We give infinite triangularization and strict triangularization results for algebras of operators on infinite dimensional vector spaces. We introduce a class of algebras we call Ore-solvable algebras: these are similar to iterated Ore…

Rings and Algebras · Mathematics 2020-07-27 Miodrag Iovanov , Jeremy Edison , Alexander Sistko

We consider continuous structures which are obtained from finite dimensional Hilbert spaces over $\mathbb{C}$ by adding some unitary operators. Quantum automata and quantum circuits are naturally interpretable in such structures. We…

Logic · Mathematics 2014-06-19 Aleksander Ivanov

Higher structures - infinity algebras and other objects up to homotopy, categorified algebras, `oidified' concepts, operads, higher categories, higher Lie theory, higher gauge theory... - are currently intensively investigated in…

Category Theory · Mathematics 2015-01-13 David Khudaverdyan

Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…

Logic in Computer Science · Computer Science 2019-05-14 Lê Thành Dũng Nguyên

Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…

Category Theory · Mathematics 2015-07-22 Martin Hyland

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…

Category Theory · Mathematics 2023-12-06 Samuele Maschio , Davide Trotta

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

Programming Languages · Computer Science 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical,…

Quantum Physics · Physics 2014-12-31 Yoshihiro Maruyama

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

We briefly review the r\^ole played by algebraic structures like combinatorial Hopf algebras in the renormalizability of (noncommutative) quantum field theory. After sketching the commutative case, we analyze the noncommutative…

Combinatorics · Mathematics 2011-03-28 Adrian Tanasa

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…

Logic · Mathematics 2010-08-05 Chris Heunen

Geometric Algebra and Calculus are mathematical languages encoding fundamental geometric relations that theories of physics seem to respect. We propose criteria given which statistics of expressions in geometric algebra are computable in…

Quantum Physics · Physics 2020-12-16 Ross N. Greenwood

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit
‹ Prev 1 3 4 5 6 7 10 Next ›