相关论文: Involutive uninorm logic with fixed point enjoys f…
This paper is a continuation of our work concerning the logical and computational foundations of multi-step fuzzy inference. We bring further results on the implementation of the Mamdani-Assilian type of fuzzy rules and inference in Goedel…
The recently introduced continuous Hopfield network (see Ramsauer et al.) exhibits large memorization capabilities, which manifest as attractive fixed points of its update rule -- a differentiable function consisting of two linear mappings…
We develop a denotational semantics of Linear Logic with least and greatest fixed points in coherence spaces (where both fixed points are interpreted in the same way) and in coherence spaces with totality (where they have different…
In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
It is proved that flatness of an analytic mapping germ from a complete intersection is determined by its sufficiently high jet. As a consequence, one obtains finite determinacy of complete intersections. It is also shown that flatness and…
We generalize the notion of complete binary relation on complete lattice to residuated lattice valued ordered sets and show its properties. Then we focus on complete fuzzy tolerances on fuzzy complete lattices and prove they are in…
We exhibit a simple condition under which a finite involutary semigroup whose semigroup reduct is inherently nonfinitely based is also inherently nonfinitely based as a unary semigroup. As applications, we get already known as well as new…
In this paper, first we have established two sets of sufficient conditions for a TS-IF contractive mapping to have unique fixed point in a intuitionistic fuzzy metric space. Then we have defined \,$(\,\epsilon \,,\, \lambda\,)$\,…
We prove finiteness of hyperkaehler Lagrangian fibrations in any fixed dimension with fixed Fujiki constant and discriminant of the Beauville-Bogomolov-Fujiki lattice, up to deformation. We also prove finiteness of hyperk\"ahler Lagrangian…
The existence and uniqueness of the common fixed point for generalized contractive mappings in order partial metric spaces is investigated. The existence of nonnegative solution of implicit nonlinear integral equations is also studied. Some…
In this paper, first some results of [5] are extended for subadditive separating maps between C(X;E) and C(Y;E), such that E is a unital Banach algebra. Then we give some conditions under which a strongly subadditive map has a unique fixed…
In this article, we have introdued D-fuzzy sets. We have discussed the notions of inclusion, union, intersection, complementation and convexity of such D-fuzzy sets. Also we have proved separation theorem of convex D-fuzzy sets.
We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.
With the long-term goal of proving local structure theorems of algebraic stacks in positive characteristic near points with reductive (but possibly non-linearly reductive) stabilizer, we conjecture that quotient stacks of the form…
We consider a fuzzy linear system with crisp coefficient matrix and with an arbitrary fuzzy number in parametric form on the right-hand side. It is known that the well-known existence and uniqueness theorem of a strong fuzzy solution is…
A concept of abstract inductive definition on a complete lattice is formulated and studied. As an application, a constructive and predicative version of Tarski's fixed point theorem is obtained.
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema's proof that…