Related papers: Fixpoint operators for 2-categorical structures
In this paper we regard languages and their acceptors -- such as deterministic or weighted automata, transducers, or monoids -- as functors from input categories that specify the type of the languages and of the machines to categories that…
We prove a new fixed point theorem of Schauder-type which applies to discontinuous operators in non-compact domains. In order to do so, we present a modification of a recent Schauder-type theorem due to Pouso. We apply our result to…
The aim of this paper is to establish some results regarding Infinite Iterated Function Systems with the help of the Tarski-Kantorovitch fixed-point principles for maps on partially ordered sets. To this end we introduce two new classes of…
Kurz et al. have recently shown that infinite $\lambda$-trees with finitely many free variables modulo $\alpha$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of…
In $\mathcal{N}=1$ superconformal theories in four dimensions the two-point function of superconformal multiplets is known up to an overall constant. A superconformal multiplet contains several conformal primary operators, whose two-point…
In this paper, influenced by the ideas from A. Mihail, The canonical projection between the shift space of an IIFS and its attractor as a fixed point, Fixed Point Theory Appl., 2015, Paper No. 75, 15 p., we associate to every generalized…
Bove and Capretta's popular method for justifying function definitions by general recursive equations is based on the observation that any structured general recursion equation defines an inductive subset of the intended domain (the "domain…
We study the subalgebra of the lattice vertex operator algebra $V_{\sqrt{2}A_2}$ consisting of the fixed points of an automorphism which is induced from an order 3 isometry of the root lattice $A_2$. We classify the simple modules for the…
Approximation Fixpoint Theory (AFT) was founded in the early 2000s by Denecker, Marek, and Truszczy\'nski as an abstract algebraic framework to study the semantics of non-monotonic logics. Since its early successes, the potential of AFT as…
The paper presents a constructive fixpoint semantics for autoepistemic logic (AEL). This fixpoint characterizes a unique but possibly three-valued belief set of an autoepistemic theory. It may be three-valued in the sense that for a…
We define representations of continuous functions on infinite streams of discrete values, both in the case of discrete-valued functions, and in the case of stream-valued functions. We define also an operation on the representations of two…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…
We introduce a framework for online structure theory. Our approach generalises notions arising independently in several areas of computability theory and complexity theory. We suggest a unifying approach using operators where we allow 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…
An efficient and flexible engine for computing fixed points is critical for many practical applications. In this paper, we firstly present a goal-directed fixed point computation strategy in the logic programming paradigm. The strategy…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
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…
AND-OR networks are Boolean networks where each coordinate function is either the AND or OR logical operator. We study the number of fixed points of these Boolean networks in the case that they have a wiring diagram with chain topology. We…
In this article we discuss the solvability of some class of fully nonlinear equations, and equations with p-Laplacian in more general conditions by using a new approach given in [1] for studying the nonlinear continuous operator. Moreover…
Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…