Related papers: Transfinite sequences of topologies, descriptive c…

In many networks, including networks of protein-protein interactions, interdisciplinary collaboration networks, and semantic networks, connections are established between nodes with complementary rather than similar properties. While…

We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…

Finitary/static semantics in the form of intersection type assignments have become a paradigm for analysing the fine structure of all sorts of lambda-models. The key step is the construction of a filter model isomorphic to a given…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

We show that the existence of a martingale approximation of a stationary process depends on the choice of the filtration. There exists a stationary linear process which has a martingale approximation with respect to the natural filtration,…

The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…

We exhibit the invariance of cycle affinities in finite state Markov processes under various natural probabilistic constructions, for instance under conditioning and under a new combinatorial construction that we call ``drag and drop''. We…

This paper introduces a class of objects called decision rules that map infinite sequences of alternatives to a decision space. These objects can be used to model situations where a decision maker encounters alternatives in a sequence such…

To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to $N$-multicomplexes. We present a family of model category structures on the…

In multistage perfect matching problems we are given a sequence of graphs on the same vertex set and asked to find a sequence of perfect matchings, corresponding to the sequence of graphs, such that consecutive matchings are as similar as…

One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…

Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…

This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

The survey is devoted to the combinatorial and metric theory of filtrations, i.\,e., decreasing sequences of $\sigma$-algebras in measure spaces or decreasing sequences of subalgebras of certain algebras. One of the key notions, that of…

A salient feature of topological phases are surface states and many of the widely studied physical properties are directly tied to their existence. Although less explored, a variety of topological phases can however similarly be…

The set of open subsets in a proximity space (X,{\zeta}) forms a topological system that enables the definition of proximal and descriptive topological groups. This framework naturally extends to proximal and descriptive topological rings…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

Recently, alternating transition systems are adopted to describe control systems with disturbances and their finite abstract systems. In order to capture the equivalence relation between these systems, a notion of alternating approximate…

Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…