Related papers: Shift spaces, Languages and Transfinite Induction
For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M.…
Infinite products, indexed by countably infinite linear orders, arise naturally in the context of fundamental groupoids. Such products are called "transfinite" if the index orders are permitted to contain a dense suborder and are called…
Inductive learning is based on inferring a general rule from a finite data set and using it to label new data. In transduction one attempts to solve the problem of using a labeled training set to label a set of unlabeled points, which are…
The downward closure of a word language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of any language is regular. While the downward closure appears to be a powerful…
We define a class of subsets of a topological space that coincides with the class of compact saturated subsets when the space is sober, and with enough good properties when the space is not sober. This class is introduced especially in view…
Consider the minimal $\beta$-shift containing the shift space generated by given Sturmian word. In this paper we characterize such $\beta$ and investigate its combinatorial, dynamical and topological properties and prove that such $\beta$…
We represent closed subspaces of the Hardy space that are invariant under finite-rank perturbations of the backward shift. We apply this to classify almost invariant subspaces of the backward shift and represent a more refined version of…
This is an introduction to the study of abstract homotopy theory by means of model categories and $(\infty,1)$-categories. The only prerequisites are very basic general topology and abstract algebra. None categorical background is needed.…
We investigate a hierarchy of arithmetical structures obtained by a transfinite addition of a canonic universal predicate, where the canonic universal predicate for M is defined as a minimum universal predicate for M in terms of…
Mutation of compact silting objects is a fundamental operation in the representation theory of finite-dimensional algebras due to its connections to cluster theory and to the lattice of torsion pairs in module or derived categories. In this…
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…
All languages have a noun category, but its realisation varies considerably. Depending on the language, semantic and/or morphosyntactic differences may be more or less pronounced. This paper explores these variations, using Riffian as a…
In this article we introduce the concept of limit space and fundamental limit space for the so-called closed injected systems of topological spaces. We present the main results on existence and uniqueness of limit spaces and several…
We define a modular multi-concept extension of the lexicographic closure semantics for defeasible description logics with typicality. The idea is that of distributing the defeasible properties of concepts into different modules, according…
As a practical foundation for a homotopy theory of abstract spacetime, we extend a category of certain compact partially ordered spaces to a convenient category of locally preordered spaces. In particular, we show that our new category is…
Session types describe the structure of communications implemented by channels. In particular, they prescribe the sequence of communications, whether they are input or output actions, and the type of value exchanged. Crucial to any language…
The aim of this paper is to reformulate the theory of unbounded derived categories, including more recent categories of first and second kind, using the language of $(\infty,1)$-categories.
Algebraic operations are understood as topologiztion of algebra. They become an example of simplest convergence space. In our article the convergence is a arbitrary multivalued appointment. The continuity of some mapping between two…
Inductive inference in supervised classification context constitutes to methods and approaches to assign some objects or items into different predefined classes using a formal rule that is derived from training data and possibly some…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…