Related papers: Combinatory Completeness in Structured Multicatego…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We describe a classification of degree n complex coefficient polynomials with respect to combinatorial patterns that arise from the two real algebraic curves obtained as the zero sets for their real and imaginary part. In particular, we…
A notion of central importance in categorical topology is that of topological functor. A faithful functor E -> B is called topological if it admits cartesian liftings of all (possibly large) families of arrows; the basic example is the…
We introduce the notion of a "category with path objects", as a slight strengthening of Kenneth Brown's classic notion of a "category of fibrant objects". We develop the basic properties of such a category and its associated homotopy…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
We claim that both multipartiteness and localization of subsystems of compound quantum systems are of an essentially relative nature crucially depending on the set of operationalistically available states. In a more general setting, to…
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…
Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…
Categories enriched over a commutative unital quantale can be studied as generalized, or many-valued, ordered structures. Because many concepts, such as complete distributivity, in lattice theory can be characterized by existence of certain…
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
We introduce a notion of globular multicategory with homomorphism types. These structures arise when organizing collections of "higher category-like" objects such as type theories with identity types. We show how these globular…
We introduce an object that has obvious similarity to the classical one - the algebra of supersymmetric polynomials. Despite the similarity, the known structure theorems on supersymmetric polynomials do not help in the study of the new…
In a previous work, we have associated a complete differential graded Lie algebra to any finite simplicial complex in a functorial way. Similarly, we have also a realization functor from the category of complete differential graded Lie…
We develop a classical propositional logic for reasoning about combinatory logic. We define its syntax, axiomatic system and semantics. The syntax and axiomatic system are presented based on classical propositional logic, with typed…
When modeling an application of practical relevance as an instance of a combinatorial problem X, we are often interested not merely in finding one optimal solution for that instance, but in finding a sufficiently diverse collection of good…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
An example of a cocomplete abelian category that is not complete is constructed.
We firstly prove the completeness of the category of crossed modules in a modified category of interest. Afterwards, we define pullback crossed modules and pullback cat$^1$-objects that are both obtained by pullback diagrams with extra…