相关论文: Transport of finiteness structures and application…
Using the functor of Baumslag rationalization of groups we construct a functor on the category of all (non necessarily simply connected) spaces that extends the classical rationalization of simply connected spaces. We study this functor and…
The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed…
We point out that if spatial information is encoded through linear operators $X_i$, or `infinite-dimensional matrices' with an involution $X_i^*=X_i$ then these $X_i$ can only describe either continuous, discrete or certain "fuzzy"…
A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…
We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…
The functional interpretation is a systematic, syntactic method for transforming certain non-constructive proofs into constructive proofs with explicit bounds. We illustrate the interpretation by working through a concrete, fairly simple…
This paper presents preliminary work on a general system for integrating dependent types into substructural type systems such as linear logic and linear type theory. Prior work on this front has generally managed to deliver type systems…
Interfaces play a central role in determining compatible component compositions by prescribing permissible interactions between a service provider (server) and its consumers (clients). The high degree of concurrency in asynchronous…
We investigate algebraic and topological transitivity and, more generally, k-transitivity for linear spaces of operators. In finite dimensions, we determine minimal dimensions of k-transitive spaces for every k, and find relations between…
In this oaper, we prove some fixed point theorems in metric vector spaces, in which the continuity is not required for the considered mappings to satisfy. We provide some concrete examples to demonstrate these theorems. We also give some…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…
We study the possibility of applying a finite-dimensionality argument in order to address parts of the Baum-Connes conjecture for finitely generated linear groups. This gives an alternative approach to the results of Guentner, Higson, and…
We show that the functor which assigns to an A-infinity morphism between isotopy classes of A-infinity algebras whose linear part is a chain homotopy equivalence its underlying chain map is a discrete Grothendieck bifibration. We then…
In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…
In this paper, firstly, we determine the number of sublogics of variable inclusion of an arbitrary finitary logic L with partition function. Then, we investigate their position into the lattice of consequence relations over the language of…
This article is a continuation of my former article "On Connectivity Spaces". After some brief historical references relating to the subject, separation spaces and then adjoint notions of connective representation and connective foliation…
The finite set of subsystems of a finite quantum system with variables in ${\mathbb Z}(n)$, is studied as a Heyting algebra. The physical meaning of the logical connectives is discussed. It is shown that disjunction of subsystems is more…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…