Related papers: Name-free combinators for concurrency
The superposition calculus for reasoning in first-order logic with equality relies on simplification orderings on terms. Modern saturation provers use the Knuth-Bendix order (KBO) and the lexicographic path order (LPO) for discovering…
We consider absolutely free nonassociative algebras and, more generally, absolutely free algebras with (maybe infinitely) many multilinear operations. Such algebras are described in terms of labeled reduced planar rooted trees. This allows…
We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…
We develop a new method to deal with the Cancellation Conjecture of Zariski in different environments. We prove the conjecture for free associative algebras of rank two. We also produce a new proof of the conjecture for polynomial algebras…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
Lie-Trotter-Suzuki decompositions are an efficient way to approximate operator exponentials $\exp(t H)$ when $H$ is a sum of $n$ (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution…
Recent theoretical work on automatic differentiation (autodiff) has focused on characteristics such as correctness and efficiency while assuming that all derivatives are automatically generated by autodiff using program transformation, with…
By applying p-adic integral on the set of p-adic integers in [27] (Interpolation Functions for New Classes Special Numbers and Polynomials via Applications of p-adic Integrals and Derivative Operator, Montes Taurus J. Pure Appl. Math. 3…
Enriched Lawvere theories are a generalization of Lawvere theories that allow us to describe the operational semantics of formal systems. For example, a graph enriched Lawvere theory describes structures that have a graph of operations of…
Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…
In an earlier paper, a new theory of measurefree "conditional" objects was presented. In this paper, emphasis is placed upon the motivation of the theory. The central part of this motivation is established through an example involving a…
We relate two apparently different bases in the representations of affine Lie algebras of type A: one arising from statistical mechanics, the other from gauge theory. We show that the two are governed by the same combinatorics and therefore…
Higher order free moments and cumulants, introduced by Collins, Mingo, \'Sniady and Speicher in 2006, describe the fluctuations of unitarily invariant random matrices in the limit of infinite size. The functional relations between their…
In a recent paper, after introducing the notion of plus-one generated hyperplane arrangements, Takuro Abe has shown that if we add (resp. delete) a line to (resp. from) a free line arrangement, then the resulting line arrangement is either…
This paper presents a logical approach to the translation of functional calculi into concurrent process calculi. The starting point is a type system for the {\pi}-calculus closely related to linear logic. Decompositions of intuitionistic…
The $\lambda$-superposition calculus is a successful approach to proving higher-order formulas. However, some parts of the calculus are extremely explosive, notably due to the higher-order unifier enumeration and the functional…
With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not well-understood yet. In…
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for…