English
Related papers

Related papers: Partial Combinatory Algebras of Functions

200 papers

We develop the basic constructions of homological algebra in the (appropriately defined) unbounded derived categories of modules over algebras over coalgebras over noncommutative rings (which we call semialgebras over corings). We define…

Category Theory · Mathematics 2014-05-12 Leonid Positselski

We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…

Logic in Computer Science · Computer Science 2020-11-03 Cory Knapp

In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…

Rings and Algebras · Mathematics 2025-05-14 Tianran Hua , Ekaterina Napedenina , Marina Tvalavadze

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

Logic in Computer Science · Computer Science 2019-07-19 Mario Carneiro

In this work, the notion of partial representation of a Hopf algebra is introduced and its relationship with partial actions of Hopf algebras is explored. Given a Hopf algebra $H$, one can associate it to a Hopf algebroid $H_{par}$ which…

Rings and Algebras · Mathematics 2013-09-23 Marcelo Muniz S. Alves , Eliezer Batista , Joost Vercruysse

Uniform preorders are a class of combinatory representations of Set-indexed preorders that generalize Pieter Hofstra's basic relational objects. An indexed preorder is representable by a uniform preorder if and only if it has as generic…

Logic · Mathematics 2024-03-27 Jonas Frey

computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…

Logic in Computer Science · Computer Science 2007-05-23 J. V. Tucker , J. I. Zucker

This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…

Rings and Algebras · Mathematics 2009-06-26 Mahesh Rudrachar , Shrisha Rao , Amit Raj

We study the globalization of partial actions on sets and topological spaces and of partial coactions on algebras by applying the general theory of globalization for geometric partial comodules, as previously developed by the authors. We…

Rings and Algebras · Mathematics 2022-03-31 Paolo Saracco , Joost Vercruysse

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

Combinatorics · Mathematics 2007-05-23 J. -C. Novelli , J. -Y. Thibon

In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…

Rings and Algebras · Mathematics 2021-03-24 Ivan Chajda , Helmut Länger

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

Information Theory · Computer Science 2021-01-01 Juerg Kohlas , Juerg Schmid

We describe some connections between three different fields: combinatorics (umbral calculus), functional analysis (linear functionals and operators) and harmonic analysis (convolutions on group-like structures). Systematic usage of…

funct-an · Mathematics 2008-02-03 Vladimir V. Kisil

Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired…

Category Theory · Mathematics 2020-01-15 Thorsten Wißmann , Stefan Milius , Shin-ya Katsumata , Jérémy Dubut

We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…

Databases · Computer Science 2025-05-21 Shaleen Deep , Paraschos Koutris

We define the notion of a partially additive Kleene algebra, which is a Kleene algebra where the + operation need only be partially defined. These structures formalize a number of examples that cannot be handled directly by Kleene algebras.…

Logic in Computer Science · Computer Science 2007-05-23 Riccardo Pucella

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

Logic in Computer Science · Computer Science 2022-06-06 Damian Arellanes

In this paper, we study partial actions of groups on $R$-algebras, where $R$ is a commutative ring. We describe the partial actions of groups on the indecomposable algebras with enveloping actions. Then we work on algebras that can be…

Rings and Algebras · Mathematics 2017-08-07 Wagner Cortes , Eduardo Marcos

We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…

Logic in Computer Science · Computer Science 2026-02-18 Murdoch J. Gabbay

We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…

Logic · Mathematics 2022-12-05 Célia Borlido , Brett McLean