Related papers: Abstraction Principles and the Classification of S…

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

In the classification of real singularities by Arnold et al. (1985), normal forms, as representatives of equivalence classes under right equivalence, are not always uniquely determined. We describe the complete structure of the equivalence…

We define the notion of 2-filtered 2-category and give an explicit construction of the bicolimit of a category valued 2-functor. A category considered as a trivial 2-category is 2-filtered if and only if it is a filtered category, and our…

In the previous author's paper the Macdonald norm conjecture (including the famous constant term conjecture) was proved. This paper contains the proof of the remaining two (the duality and evaluation conjectures). The evaluation theorem is…

We consider two relations on a $\cap$-semigroup of partial functions of a given set: the inclusion of domains and the semiadjacencity (i.e., the inclusion of the image of the first function into the domain of the second), which…

In this paper we study the strict refinement property for connected partial ordersalso known as Hashimoto's Theorem. This property implies that any isomorphismbetween products of irreducible structures is determined is uniquely determinedas…

We discuss the connection between various orders on the class of all the ultrafilters and certain compactness properties of abstract logics and of topological spaces. We present a model theoretical characterization of Comfort order. We…

We are born with the ability to learn concepts by comparing diverse observations. This helps us to understand the new world in a compositional manner and facilitates extrapolation, as objects naturally consist of multiple concepts. In this…

Many situations in quantum theory and other areas of physics lead to quasi-probabilities which seem to be physically useful but can be negative. The interpretation of such objects is not at all clear. In this paper, we show that…

We propose two new dependent type systems. The first, is a dependent graded/linear type system where a graded dependent type system is connected via modal operators to a linear type system in the style of Linear/Non-linear logic. We then…

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

Category theory unifies mathematical concepts, aiding comparisons across structures by incorporating objects and morphisms, which capture their interactions. It has influenced areas of computer science such as automata theory, functional…

Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…

E prover is a state-of-the-art theorem prover for first-order logic with equality. E prover is built around a saturation loop, where new clauses are derived by inference rules from previously derived clauses. Selection of clauses for the…

Applying the classical Serre-Swan theorem, as this is extended to topological (non-normed) algebras, one attains a classification of elementary particles via their spin-structure. In this context, our argument is virtually based on a…

The additivity theorem for derivateurs associated to complicial biWaldhausen categories is proved. Also, to any exact category in the sense of Quillen a K-theory space is associated. This K-theory is shown to satisfy the additivity,…

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

Several theorems about the equivalence of familiar theories of reverse mathematics with certain well-ordering principles have been proved by recursion-theoretic and combinatorial methods (Friedman, Marcone, Montalban et al.) and with…

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…