Related papers: Fixpoint constructions in focused orthogonality mo…
Modal fixpoint logics traditionally play a central role in computer science, in particular in artificial intelligence and concurrency. The mu-calculus and its relatives are among the most expressive logics of this type. However, popular…
This paper develops a systematic framework for integrating local categories that model logical connectives using higher category theory. By extending these local categories into a unified two-category enriched with natural isomorphisms, the…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
Orbifold equivalence is a notion of symmetry that does not rely on group actions. Among other applications, it leads to surprising connections between hitherto unrelated singularities. While the concept can be defined in a very general…
Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…
Hyperspaces form a powerful tool in some branches of mathematics: lots of fractal and other geometric objects can be viewed as fixed points of some functions in suitable hyperspaces - as well as interesting classes of formal languages in…
By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…
The paper introduces the class of O-metric spaces, a novel generalization of metric-type spaces, classifying almost all possible metric types into upward and downward O-metrics. We list some topologies arising from O-metrics and discuss…
The purpose of this paper is twofold. First, we review applications of the bar duality of operads to the construction of explicit cofibrant replacements in categories of algebras over an operad. In view toward applications, we check that…
Compositionality is at the heart of computer science and several other areas of applied category theory such as computational linguistics, categorical quantum mechanics, interpretable AI, dynamical systems, compositional game theory, and…
We establish coupled fixed point theorems for contraction involving rational expressions in partially ordered metric spaces.
The filtered derived category of an abelian category has played a useful role in subjects including geometric representation theory, mixed Hodge modules, and the theory of motives. We develop a natural generalization using current methods…
The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…
Logic programming, as exemplified by datalog, defines the meaning of a program as its unique smallest model: the deductive closure of its inference rules. However, many problems call for an enumeration of models that vary along some set of…
We establish common fixed point theorems for two pairs of weakly compatible self-mappings using an auxiliary function of two variables. Unlike classical results, our theorems do not assume continuity of the mappings and require completeness…
We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular,…
This paper constructs model structures on the categories of coalgebras and pointed irreducible coalgebras over an operad. The underlying chain-complex is assumed to be unbounded and the results for bounded coalgebras over an operad are…
When reasoning about formal objects whose structures involve binding, it is often necessary to analyze expressions relative to a context that associates types, values, and other related attributes with variables that appear free in the…
We develop the first two heap logics that have implicit heaplets and that admit FO-complete program verification. The notion of FO-completeness is a theoretical guarantee that all theorems that are valid when recursive definitions are…
Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations on a category A in the category of categories over A are studied; in particular, the reflections and the coreflections of the latter in the…