Related papers: On Pitts' Relational Properties of Domains
We study properties related to relevance in non-monotonic consequence relations obtained by systems of structured argumentation. Relevance desiderata concern the robustness of a consequence relation under the addition of irrelevant…
Most modern formalisms used in Databases and Artificial Intelligence for describing an application domain are based on the notions of class (or concept) and relationship among classes. One interesting feature of such formalisms is the…
Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…
Using the minimax technique from the critical point theory, which consists in constructing or transforming a suitable class of applications such that a critical value $c$ of a functional $f$ can be characterized as a minimax value over this…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…
Learning guarantees often rely on assumptions of i.i.d. data, which will likely be violated in practice once predictors are deployed to perform real-world tasks. Domain adaptation approaches thus appeared as a useful framework yielding…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…
Unifying theories distil common features of programming languages and design methods by means of algebraic operators and their laws. Several practical concerns --- e.g., improvement of a program, conformance of code with design, correctness…
A branch of generalizations of the Banach Fixed Point Theorem replaces contractivity by a weaker but still effective property. The aim of the present note is to extend the contraction principle in this spirit for such complete semimetric…
The dependency pair (DP) framework is one of the most powerful techniques for automatic termination and complexity analysis of term rewrite systems. While DPs were extended to prove almost-sure termination of probabilistic term rewrite…
Clocked Cubical Type Theory is a new type theory combining the power of guarded recursion with univalence and higher inductive types (HITs). This type theory can be used as a metalanguage for synthetic guarded domain theory in which one can…
Tarski's relevance logic is defined and shown to contain many formulas and derived rules of inference. The definition arises from Tarski's work on first-order logic restricted to finitely many variables. It is a relevance logic because it…
In this paper, we give an overview of some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics. The motivations for this work come from Computer…
Relational parametricity was first introduced by Reynolds for System F. Although System F provides a strong model for the type systems at the core of modern functional programming languages, it lacks features of daily programming practice…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
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…
The following natural question arises from Shalom's innovational work (1999, Publ. IHES): "Can we establish an intrinsic criterion to synthesize relative fixed point properties into the whole fixed point property without assuming Bounded…
This is in some sense an addendum to the book Relational Mathematics by the first-named author. It originated from work on diverse other topics during which a lot of purely relational results with broad applicability have been produced.…