Related papers: Induction, Coinduction, and Fixed Points: A Concis…
Based on the needs of convergence proofs of preconditioned proximal point methods, we introduce notions of partial strong submonotonicity and partial (metric) subregularity of set-valued maps. We study relationships between these two…
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…
Performing the inference step of deep learning in resource constrained environments, such as embedded devices, is challenging. Success requires optimization at both software and hardware levels. Low precision arithmetic and specifically low…
The approach to proof search dubbed "coinductive proof search" (CoIPS), and previously developed by the authors for implicational intuitionistic logic, is in this paper extended to LJP, a focused sequent-calculus presentation of polarized…
We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual…
We give an explicit coinduction principle for recursively-defined stochastic processes. The principle applies to any closed property, not just equality, and works even when solutions are not unique. The rule encapsulates low-level analytic…
Most algorithms for solving optimization problems or finding saddle points of convex-concave functions are fixed-point algorithms. In this work we consider the generic problem of finding a fixed point of an average of operators, or an…
We investigate the properties of Inclusion Logic, that is, First Order Logic with Team Semantics extended with inclusion dependencies. We prove that Inclusion Logic is equivalent to Greatest Fixed Point Logic, and we prove that all…
In this paper, we introduce the concept of mixed (G, S)-monotone mappings and prove coupled coincidence and coupled common fixed point theorems for such mappings satisfying a nonlinear contraction involving altering distance functions.…
Some aspects of programming education are examined in this work. It is emphasised, based on the entertainment value, the most appropriate examples are chosen to demonstrate the different language constructions and data structures. Such an…
The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…
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,…
This paper is a fundamental study of comodules and contramodules over a comonoid in a symmetric closed monoidal category. We study both algebraic and homotopical aspects of them. Algebraically, we enrich the comodule and contramodule…
We introduce the concept of $\it{ startpoint}$ and $\it{endpoint}$ for multivalued maps defined on a quasi-pseudometric space. We investigate the relation between these new concepts and the existence of fixed points for these set valued…
In a paper presented at SOS 2010, we developed a framework for big-step semantics for interactive input-output in combination with divergence, based on coinductive and mixed inductive-coinductive notions of resumptions, evaluation and…
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…
Startpoints (resp. endpoints) can be defined as "oriented fixed points". They arise naturally in the study of fixed for multi-valued maps defined on quasi-metric spaces. In this article, we give a new result in the startpoint theory for…
This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…
This paper proposes the problem of point-and-count as a test case to break the what-and-where deadlock. Different from the traditional detection problem, the goal is to discover key salient points as a way to localize and count the number…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…