English
Related papers

Related papers: Aspects of an internal logic for persistence

200 papers

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

Sheaves of structures are useful to give constructions in universal algebra and model theory. We can describe their logical behavior in terms of Heyting-valued structures. In this paper, we first provide a systematic treatment of sheaves of…

Logic · Mathematics 2021-12-15 Hisashi Aratake

This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…

Representation Theory · Mathematics 2007-05-23 Alice Fialowski , Michael Penkava

By general case we mean methods able to process simplicial sets and chain complexes not of finite type. A filtration of the object to be studied is the heart of both subjects persistent homology and spectral sequences. In this paper we…

Computational Geometry · Computer Science 2014-04-01 Ana Romero , Jónathan Heras , Julio Rubio , Francis Sergeraert

Continuous logic extends the multi-valued Lukasiewicz logic by adding a halving operator on propositions. This extension is designed to give a more satisfactory model theory for continuous structures. The semantics of these logics can be…

Artificial Intelligence · Computer Science 2013-10-15 Rob Arthan , Paulo Oliva

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

Logic · Mathematics 2023-07-25 Sergey V. Sudoplatov

An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be…

Artificial Intelligence · Computer Science 2007-05-23 J. Engelfriet

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

We provide a general notion of induced structures of operated algebras in the context of unary-binary operads. This notion fully captures the binary quadratic relations encoded by a unary-binary operad, thereby unifying and formalizing the…

Category Theory · Mathematics 2026-03-23 Li Guo , Xiaoyan Wang , Huhu Zhang

Perfect paradefinite algebras are De Morgan algebras expanded with an operation that allows for the full behavior of classical negation to be restored. They form a variety that is term-equivalent to the variety of involutive Stone algebras.…

Logic in Computer Science · Computer Science 2025-03-12 Vitor Greati , Sérgio Marcelino , João Marcos , Umberto Rivieccio

This text gives a construction of a differential graded Lie algebra in Nori's category of effective homological motives. In fact the construction works in more a general setting than that of an Abelian category. This allows us to give the…

Algebraic Geometry · Mathematics 2007-05-23 Kaj Gartz

In this work, we explore links between natural homology and persistent homology for the classification of directed spaces. The former is an algebraic invariant of directed spaces, a semantic model of concurrent programs. The latter was…

Algebraic Topology · Mathematics 2024-08-07 Cameron Calk , Eric Goubault , Philippe Malbos

We develop an algebraic language theory based on the notion of an Eilenberg--Moore algebra. In comparison to previous such frameworks the main contribution is the support for algebras with infinitely many sorts and the connection to logic…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Achim Blumensath

A logic is presented for reasoning on iterated sequences of formulae over some given base language. The considered sequences, or "schemata", are defined inductively, on some algebraic structure (for instance the natural numbers, the lists,…

Logic in Computer Science · Computer Science 2012-04-16 Mnacho Echenim , Nicolas Peltier

In this article we describe an algebraic framework which can be used in three related but different contexts: string topology, symplectic field theory, and Lagrangian Floer theory of higher genus. It turns out that the relevant algebraic…

Quantum Algebra · Mathematics 2022-12-06 Kai Cieliebak , Kenji Fukaya , Janko Latschev

We present an algebraic view on logic programming, related to proof theory and more specifically linear logic and geometry of interaction. Within this construction, a characterization of logspace (deterministic and non-deterministic)…

Logic in Computer Science · Computer Science 2014-06-10 Clément Aubert , Marc Bagnol , Paolo Pistone , Thomas Seiller

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved…

Logic in Computer Science · Computer Science 2007-05-23 Alessio Guglielmi

We investigate a natural Heyting algebra structure on the set of Dyck paths of the same length. We provide a geometrical description of the operations of pseudocomplement and relative pseudocomplement, as well as of regular elements. We…

Combinatorics · Mathematics 2015-03-18 Luca Ferrari

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Artificial neural networks can learn complex, salient data features to achieve a given task. On the opposite end of the spectrum, mathematically grounded methods such as topological data analysis allow users to design analysis pipelines…

Machine Learning · Computer Science 2022-12-29 Mattia G. Bergomi , Massimo Ferri , Alessandro Mella , Pietro Vertechi