Related papers: Real structures. An introduction to a general appr…

Structured recursion schemes have been widely used in constructing, optimising, and reasoning about programs over inductive and coinductive datatypes. Their plain forms, catamorphisms and anamorphisms, are restricted in expressiveness. Thus…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We introduce the notion of an ordered face structure. The ordered face structures to many-to-one computads are like positive face structures to positive-to-one computads. This allow us to give an explicit combinatorial description of…

One often sees a sharp distinction in mathematics between descriptions from the outside and from the inside. Think of defining a set in the plane through an algebraic equation, or dynamically as the closure of the orbit of some point under…

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

We discuss the local and global problems for the equivalence of geometric structures of an arbitrary order and, in later sections, attention is given to what really matters, namely the equivalence with respect to transformations belonging…

We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…

We show that it is decidable whether or not a relation on the reals definable in the structure $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$ can be defined in the structure $\langle \mathbb{R}, +,<, 1 \rangle$. This result is achieved by…

We introduce the concept of a class of graphs, or more generally, relational structures, being locally tree-decomposable. There are numerous examples of locally tree-decomposable classes, among them the class of planar graphs and all…

With this paper, we gain a better understanding of the set of near-field structures on a fixed scalar group. If we were able to describe all near-field structures on a fixed scalar group, we could describe all near-vector spaces. The…

We present new real algebraic maps of non-positive codimensions with prescribed images whose boundaries consist of explicit non-singular real algebraic hypersurfaces satisfying so-called "transversality" as follows. Explicit information on…

The first papers on o-minimal structures appeared in the mid 1980s, since then the subject has grown into a wide ranging generalisation of semialgebraic, subanalytic and subpfaffian geometry. In these notes we try to show that this is in…

We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…

In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…

In this paper, using the classical covering theory, we introduce a generalization of covering maps of a space $X$ with respect to a topology $\tau$ on the fundamental group of $X$. We show that the famous notions, covering, semicovering,…

We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

Let $X$ be the prime spectrum of a ring. In [arXiv:0707.1525] the authors define a topology on $X$ by using ultrafilters and they show that this topology is precisely the constructible topology. In this paper we generalize the construction…

In this paper we will first introduce the notion of affine structures on a ringed space and then obtain several properties. Affine structures on a ringed space, arising mainly from complex analytical spaces of algebraic schemes over number…

The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery and data mining. The theory of matroids is a…