相关论文: Models with second order properties, V: A General …
In this paper, we give some generalizations the concept of element order and we study some of the properties of these generalized order. In particular, with using this generalization we derive two solvability criteria.
This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for…
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
We study monoids equipped with a second binary operation that captures the structure of the endomorphisms of an object $X$ such that $X=X\times X$. We construct a universal monoid of this type and examine some of its rich combinatorial…
Attribute-driven software architecture design aims to provide decision support by taking into account the quality attributes of softwares. A central question in this process is: What architecture design best fulfills the desirable software…
We show that every small model category that satisfies certain size conditions can be completed to yield a combinatorial model category, and conversely, every combinatorial model category arises in this way. We will also see that these…
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula…
In this paper we provide a general tool to prove the consistency of $I1(\lambda)$ with various combinatorial properties at $\lambda$ typical at settings with $2^\lambda>\lambda^+$, that does not need a profound knowledge of the forcing…
This paper presents a clustering algorithm that is an extension of the Category Trees algorithm. Category Trees is a clustering method that creates tree structures that branch on category type and not feature. The development in this paper…
This work introduces a unified framework for analyzing games in greater depth. In the existing literature, players' strategies are typically assigned scalar values, and equilibrium concepts are used to identify compatible choices. However,…
General methods for the construction of magic squares of any order have been searched for centuries. There have been several standard strategies for this purpose, such as the knight movement, or the construction of bordered magic squares,…
In this paper, we give an overview of some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics. The motivations for this work come from Computer…
This thesis deals with the enumerative study of combinatorial maps, and its application to the enumeration of other combinatorial objects. Combinatorial maps, or simply maps, form a rich combinatorial model. They have an intuitive and…
This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…
The Blackboard Architecture provides a mechanism for embodying data, decision making and actuation. Its versatility has been demonstrated across a wide number of application areas. However, it lacks the capability to directly model…
A generalized model of games is proposed, in which cooperative games and non-cooperative games are special cases. Some games that are neither cooperative nor non-cooperative can be expressed and analyzed. The model is based on relationships…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
Federated learning is a setting where agents, each with access to their own data source, combine models from local data to create a global model. If agents are drawing their data from different distributions, though, federated learning…
A unification of characteristic mode decomposition for all method-of-moment formulations of field integral equations describing free-space scattering is derived. The work is based on an algebraic link between impedance and transition…
We consider the Deduction Theorem used in the literature of game theory to run a purported proof by contradiction. In the context of game theory, it is stated that if we have a proof of $\phi \vdash \varphi$, then we also have a proof of…