English
Related papers

Related papers: Bi-intermediate logics of trees and co-trees

200 papers

We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…

Logic in Computer Science · Computer Science 2015-07-01 Amélie Gheerbrant , Balder ten Cate

The call-by-value lambda calculus can be endowed with permutation rules, arising from linear logic proof-nets, having the advantage of unblocking some redexes that otherwise get stuck during the reduction. We show that such an extension…

Logic in Computer Science · Computer Science 2023-06-22 Emma Kerinec , Giulio Manzonetto , Michele Pagani

A distributive lattice-ordered magma ($d\ell$-magma) $(A,\wedge,\vee,\cdot)$ is a distributive lattice with a binary operation $\cdot$ that preserves joins in both arguments, and when $\cdot$ is associative then $(A,\vee,\cdot)$ is an…

Logic · Mathematics 2024-08-07 Natanael Alpay , Peter Jipsen , Melissa Sugimoto

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

Logic · Mathematics 2024-06-25 Wesley H. Holliday

A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…

Combinatorics · Mathematics 2021-09-15 Shishuo Fu , Zhicong Lin , Yaling Wang

The purpose of the present paper is to show that: Eilenberg-type correspondences = Birkhoff's theorem for (finite) algebras + duality. We consider algebras for a monad T on a category D and we study (pseudo)varieties of T-algebras.…

Formal Languages and Automata Theory · Computer Science 2017-02-10 Julian Salamanca

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

Logic in Computer Science · Computer Science 2016-02-29 Luigi Santocanale

A lattice-ordered group (an $\ell$-group) $G(\oplus, \vee, \wedge)$ can be naturally viewed as a semiring $G(\vee,\oplus)$. We give a full classification of (abelian) $\ell$-groups which are finitely generated as semirings, by first showing…

Group Theory · Mathematics 2017-08-02 Vítězslav Kala

For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…

High Energy Physics - Theory · Physics 2009-09-29 Kurusch Ebrahimi-Fard , Li Guo , Dirk Kreimer

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal…

Logic in Computer Science · Computer Science 2023-06-22 Benedetto Intrigila , Giulio Manzonetto , Andrew Polonsky

We introduce abelian framed bicategories, which are particular framed bicategories that are locally abelian, and show that they are suitable for developing homology and cohomology theories for directed structures. This means in particular…

Category Theory · Mathematics 2026-02-05 Augustin Albert , Jérémy Dubut , Eric Goubault

We study a finite-dimensional algebra $\Lambda$ constructed from a Postnikov diagram $D$ in a disk, obtained from the dimer algebra of Baur-King-Marsh by factoring out the ideal generated by the boundary idempotent. Thus $\Lambda$ is…

Representation Theory · Mathematics 2019-04-09 Andrea Pasquali

This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and refer to its expansions as superabelian logics. The paper…

Logic · Mathematics 2026-04-17 Petr Cintula , Filip Jankovec , Carles Noguera

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Combinatorics · Mathematics 2023-03-15 Dale R. Worley

In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…

The concept of weighted infinitesimal bialgebras provides an algebraic framework for understanding the non-homogeneous associative Yang-Baxter equation. In this paper, we endow the space of decorated planar rooted forests with a…

Combinatorics · Mathematics 2025-10-15 Loïc Foissy , Yunzhou Xie , Dawei Zhang , Yi Zhang

Algebraic dichotomy is a generalization of an exponential dichotomy (Lin, JDE2009). This paper gives a version of Hartman-Grobman linearization theorem assuming that linear system admits an algebraic dichotomy, which generalizes the…

Classical Analysis and ODEs · Mathematics 2023-06-16 Chaofan Pan , Manuel Pinto , Y. H. Xia

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu