English
Related papers

Related papers: A New Foundation for Finitary Corecursion and Iter…

200 papers

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…

Logic in Computer Science · Computer Science 2026-04-30 Colin Riba , Adam Donadille

For finitely generated subgroups $H$ of a free group $F_m$ of finite rank $m$, we study the language $L_H$ of reduced words that represent $H$ which is a regular language. Using the (extended) core of Schreier graph of $H$, we construct the…

Group Theory · Mathematics 2023-06-22 Arman Darbinyan , Rostislav Grigorchuk , Asif Shaikh

The injective right comodules appearing in the minimal injective resolution of a finite-dimensional comodule need not to be of finite dimension or even quasi-finite. The obstruction here is that factor comodules of quasi-finite comodules…

Rings and Algebras · Mathematics 2007-05-23 J. Gomez-Torrecillas , C. Nastasescu , B. Torrecillas

In this second installment of the Alpay Algebra framework, I formally define identity as a fixed point that emerges through categorical recursion. Building upon the transfinite operator $\varphi^\infty$, I characterize identity as the…

General Mathematics · Mathematics 2025-05-29 Faruk Alpay

We call a finitely complete category algebraically coherent when the change-of-base functors of its fibration of points are coherent, which means that they preserve finite limits and jointly strongly epimorphic pairs of arrows. We give…

Category Theory · Mathematics 2015-12-10 Alan S. Cigoli , James R. A. Gray , Tim Van der Linden

In this note, we deal with the fixed points of an endofunctor $F: \mathcal{C} \longrightarrow \mathcal{C}$. Three classes of fixed points are introduced, and the case when $F$ is an endomorphism of a category with pretopology is…

Category Theory · Mathematics 2017-05-09 Aleksandr Luzhenkov

We introduce a pro-\'etale geometric object $D_\infty$ arising naturally from the tower of Artin-Schreier extensions in characteristic 2, equipped with a canonical endofunctor $O$ whose fixed points correspond to automorphic representations…

General Mathematics · Mathematics 2025-06-19 Anatoly Galikhanov

Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distributed systems. We show that these logics constitute good…

Logic in Computer Science · Computer Science 2009-04-22 Stephane Grumbach , Fang Wang , Zhilin Wu

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

Local actions of $\mathbb{P}_\mathbb{N}$, the group of finite permutations on $\mathbb{N}$, on quasi-local algebras are defined and proved to be $\mathbb{P}_\mathbb{N}$-abelian. It turns out that invariant states under local actions are…

Operator Algebras · Mathematics 2022-01-10 Vitonofrio Crismale , Stefano Rossi , Paola Zurlo

The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…

Artificial Intelligence · Computer Science 2018-10-12 Pietro Baroni , Federico Cerutti , Paul E. Dunne , Massimiliano Giacomin

Each finite-dimensional algebra can be identified to the cubic matrix given by structural constants defining the multiplication between the basis elements of the algebra. In this paper we introduce the notion of flow (depending on time) of…

Dynamical Systems · Mathematics 2016-08-26 M. Ladra , U. A. Rozikov

Processes are often viewed as coalgebras, with the structure maps specifying the state transitions. In the simplest case, the state spaces are discrete, and the structure map simply takes each state to the next states. But the coalgebraic…

Category Theory · Mathematics 2015-12-23 Dusko Pavlovic , Bertfried Fauser

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

Given a Hilbert space and a finite family of operators defined on the space, the common fixed point problem (CFPP) is to find a point in the intersection of the fixed point sets of these operators. Instances of the problem have numerous…

Optimization and Control · Mathematics 2025-09-05 Yair Censor , Daniel Reem , Maroun Zaknoon

This paper contributes to the Alpay Algebra by demonstrating that the stable outcome of a self referential process, obtained by iterating a transformation through all ordinal stages, is identical to the unique equilibrium of an unbounded…

Logic in Computer Science · Computer Science 2025-07-28 Faruk Alpay , Bugra Kilictas , Taylan Alpay

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

Logic · Mathematics 2017-12-05 Matthew Harrison-Trainor , Meng-Che Ho

We introduce "continuous deformed preprojective algebras" attached to infinite affine Dynkin quivers of type A_{\infty}, A_{+\infty}, D_{\infty}. We define a one-parameter family of deformations of the wreath product of a symmetric group…

Representation Theory · Mathematics 2007-05-23 Silvia Montarani

The coincidence between initial algebras (IAs) and final coalgebras (FCs) is a phenomenon that underpins various important results in theoretical computer science. In this paper, we identify a general fibrational condition for the IA-FC…

Logic in Computer Science · Computer Science 2021-08-25 Mayuko Kori , Ichiro Hasuo , Shin-ya Katsumata