Related papers: Matching-Logic-Based Understanding of Polynomial F…
Symmetry in finite model finding problems of many-sorted first-order logic (MSFOL) can be exploited to reduce the number of interpretations considered during search, thereby improving solver performance. In this thesis, we situate symmetry…
Matching plays a vital role in the rational allocation of resources in many areas, ranging from market operation to people's daily lives. In economics, the term matching theory is coined for pairing two agents in a specific market to reach…
The main objective of this paper is to give a wide study on the conformable fractional Legendre polynomials (CFLPs). This study is assumed to be a generalization and refinement, in an easy way, of the scalar case into the context of the…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
We investigate the expressive power of a Turing-complete logic based on game-theoretic semantics. By defining suitable fragments and variants of the logic, we obtain a range of natural characterizations for some fundamental families of…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
We give a comprehensive account on the parameterized complexity of model checking and satisfiability of propositional inclusion and independence logic. We discover that for most parameterizations the problems are either in FPT or…
Representations are essential to mathematically model phenomena, but there are many options available. While each of those options provides useful properties with which to solve problems related to the phenomena in study, comparing results…
In this paper we present equivalence results for several types of unbounded operator functions. A generalization of the concept equivalence after extension is introduced and used to prove equivalence and linearization for classes of…
Uniform interpolation properties are defined for equational consequence in a variety of algebras and related to properties of compact congruences on first the free and then the finitely presented algebras of the variety. It is also shown,…
We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…
Linear Programs (LP) are celebrated widely, particularly so in machine learning where they have allowed for effectively solving probabilistic inference tasks or imposing structure on end-to-end learning systems. Their potential might seem…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
Mixtures of Mallows models are a popular generative model for ranking data coming from a heterogeneous population. They have a variety of applications including social choice, recommendation systems and natural language processing. Here we…
We describe a notion of categorical model for unitless fragments of (multiplicative) linear logic. The basic definition uses promonoidal categories, and we also give an equivalent elementary axiomatisation.
We consider some combinatorial problems on matrix polynomials over finite fields. Using results from control theory we give a proof of a result of Helmke, Jordan and Lieb on the number of linear unimodular matrix polynomials over a finite…