The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...

This paper presents some steps of defining a finitely supported mathematics by using sets with atoms. Such a mathematics generalizes the classical Zermelo-Fraenkel mathematics, and represents an appropriate framework to work with (infinite) structures in terms of finitely supported objects. We focus on the techniques of translating the Zermelo-Fraenkel results to this finitely supported mathema...

We introduce and study …nitely well-positioned sets, a class of asymptotically “narrow”sets that generalize the well-positioned sets recently investigated by Adly, Ernst and Thera [1] and [3], as well as the plastering property of Krasnoselskii [11].

We present a survey of some results published recently by the authors regarding fuzzy aspects finitely supported structures. Considering notion finite support, we introduce new degree membership association between crisp set and function modelling for each element in set. define study notions invariant set, complete lattices, monoids strong inductive sets. The (fuzzy) subgroups an group, as wel...

A finitely supported sequence a that sums to 2 defines a scaling operator Taf = ∑ k∈Z a(k)f(2 ·−k) on functions f, a transition operator Sav = ∑ k∈Z a(k)(2 ·−k) on sequences v, and a unique compactly supported scaling function φ that satisfies φ = Taφ normalized with φ̂(0) = 1. It is shown that the eigenvalues of Ta on the space of compactly supported square-integrable functions are a subset of ...

Nominal techniques are based on the idea of sets with a finitelysupported atoms-permutation action. In this paper we consider the idea of sets with a finitely-supported atoms-renaming action (renamings can identify atoms; permutations cannot). We show that these exhibit many of the useful qualities found in traditional nominal techniques; an elementary sets-based presentation, inductive datatyp...