相关论文: Equational properties of stratified least fixed po…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics of such non-monotonic…
Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…
We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by their definition, and swapping the ordering of equations,…
In this paper, we investigate the algebras of consequence operators and finite consequence operators on a fixed language. Significant new collections of consequence operators are defined and shown to be complete and distributive…
In this paper, we introduce a generalized notion of monotone property and prove some results regarding existence and uniqueness of multi-tupled fixed points for nonlinear contraction mappings satisfying monotone property in ordered complete…
Many contemporary applications in signal processing and machine learning give rise to structured non-convex non-smooth optimization problems that can often be tackled by simple iterative methods quite effectively. One of the keys to…
The celebrated Kleene fixed point theorem is crucial in the mathematical modelling of recursive specifications in Denotational Semantics. In this paper we discuss whether the hypothesis of the aforementioned result can be weakened. An…
Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more…
We introduce a new class of asymptotic contractions that employs two quasi-metrics defined directly in terms of the underlying mapping. The contraction condition compares these two quantities via a sequence of bounding functions that…
Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics…
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way. We prove a…
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties. The specificity of cost functions is…
We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…
The article is devoted to the solvability of a system of integro-differential equations in the case of the difference of the standard Laplacian and the bi-Laplacian in the diffusion terms. The proof of the existence of solutions is based on…
We introduce a new technique for proving the classical Stable Manifold theorem for hyperbolic fixed points. This method is much more geometrical than the standard approaches which rely on abstract fixed point theorems. It is based on the…
We survey recent results regarding the study of dynamical properties of the space of positive definite functions and characters of higher rank lattices. These results have several applications to ergodic theory, topological dynamics,…
An algebraic proof is presented for the finite strong standard completeness of involutive uninorm logic with fixed point. The result may provide a first step towards settling the open standard completeness problem for involutive uninorm…
Fixed point theorems are ubiquitous in economic research. Many studies cite Smithson (1971) ``Fixed points of order preserving multifunctions,'' yet the original proof contains errors. This note presents a new, concise proof and explains…
We construct families of rational functions $f \colon \bP^1_k \to \bP^1_k$ of degree $d \geq 2$ over a perfect field $k$ whose associated fixed-point processes fail to be martingales. Conversely, for any normal variety $X \subset…