Related papers: An abstract fixed-point theorem for Horn formula e…
In this paper, we introduce new methods for solving the vacuum Einstein constraints equations: the first one is based on Schaefer's fixed point theorem (known methods use Schauder's fixed point theorem) while the second one uses the concept…
Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
This article is concerned with the existence and uniqueness of solutions to some fractional order boundary value problems. Our results are based on some fixed point theorems. For the applicability of our results, we provide an example.
We show a fixed-point property of random quotients by plain words for a wide class of CAT(0) spaces.
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable…
Over the last few years, neural networks have started penetrating safety critical systems to take decisions in robots, rockets, autonomous driving car, etc. A problem is that these critical systems often have limited computing resources.…
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…
Following the definition of perturbed metric space, in this paper, some fixed point theorems are established for $ F $-perturbed mappings in complete perturbed metric spaces and justify the result by counter example. Finally, an application…
In this paper, we introduce a new class of implicit function to prove common fixed point theorems in fuzzy metric space. Moreover we define a new altering distance in terms of integral and utilize the same to deduce integral type…
A theory of gravity with a generic action functional and minimally coupled to N matter fields has a nontrivial fixed point in the leading large N approximation. At this fixed point, the cosmological constant and Newton's constant are…
The aim of this paper is to present some fixed point theorems for generalized contractions by altering distance functions in a complete cone metric spaces endowed with a partial order. We also generalize fixed point theorems of J. Harjani,…
The study of fixed point ratios is a classical topic in permutation group theory, with a long history stretching back to the origins of the subject in the 19th century. Fixed point ratios arise naturally in many different contexts, finding…
In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…
In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…
This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on some relevant notions in logic programming. We introduce the notion of term structure associated to a set of formulas in the…
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…
We introduce a new definition of topological degree for a meaningful class of operators which need not be continuous. Subsequently, we derive a number of fixed point theorems for such operators. As an application, we deduce a new existence…
We propose a stable model semantics for higher-order logic programs. Our semantics is developed using Approximation Fixpoint Theory (AFT), a powerful formalism that has successfully been used to give meaning to diverse non-monotonic…