Related papers: On Nominal Syntax and Permutation Fixed Points
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation…
Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are…
In this paper, the notion of $\mathbb{C}$-simulation function is introduced and the existence and uniqueness of common fixed points of two self-mappings satisfying contractive conditions in the setting of complex valued metric spaces via…
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, i.e.\ operators whose range are sets…
It is generally well agreed that developing a unifying theory is one of the most important issues in Data Mining research. In the last two decades, a great deal of work has been devoted to the algorithmic aspects of the Frequent Itemset…
In this paper, we introduce the notion of $\alpha$--contractive mapping of Meir--Keeler type in complete metric spaces and prove new theorems which assure the existence, uniqueness and iterative approximation of the fixed point for this…
The univalence axiom expresses the principle of extensionality for dependent type theory. However, if we simply add the univalence axiom to type theory, then we lose the property of canonicity - that every closed term computes to a…
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…
A new hierarchy of "exact" unification types is introduced, motivated by the study of admissible rules for equational classes and non-classical logics. In this setting, unifiers of identities in an equational class are preordered, not by…
The unification problem in algebras capable of describing sets has been tackled, directly or indirectly, by many researchers and it finds important applications in various research areas--e.g., deductive databases, theorem proving, static…
Fixed point combinators (and their generalization: looping combinators) are classic notions belonging to the heart of lambda-calculus and logic. We start with an exploration of the structure of fixed point combinators (fpc's), vastly…
Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the proportion of points in $\Omega$ fixed by $x$. Fixed point ratios in this…
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…
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
Based on the concept and properties of $C^{*}$-algebras, the paper introduces a concept of $C_{*}$-class functions. Then by using these functions in $C^{*}$-algebra- valued modular metric spaces of moeini et al. [14], some common fixed…
Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…
In this paper, we establish coincidence fixed point and common fixed point theorems for two mapping in complete $C^*$-algebra-valued metric spaces which satisfy new contractive conditions. Some applications of our obtained results are…