Related papers: Structural Interactions and Absorption of Structur…
This paper is concerned with the sequential covariance intersection (CI) fusion problem that the fusion result is independent of fusion structure including the fusion order and the number of estimates fused in each sequential fusion. An…
In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…
In this paper we investigate the question: 'How can A Foundational Classical Singlesuccedent Sequent Calculus be formulated?' The choice of this particular area of proof-theoretic study is based on a particular ground that is, to formulate…
The logic of Dependence and Independence Bunched Implications (DIBI) is a logic to reason about conditional independence (CI); for instance, DIBI formulas can characterise CI in probability distributions and relational databases, using the…
Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics.…
Structural models with no solution are incoherent, and those with multiple solutions are incomplete. We show that models with occasionally binding constraints are not generically coherent. Coherency requires restrictions on the parameters…
The understanding of the large-scale structure formation requires the resolution of coupled nonlinear equations describing the cosmic density and velocity fields. This is a complicated problem that, for the last decade, has been essentially…
We associate bicomplexes with several integrable models in such a way that conserved currents are obtained by a simple iterative construction. Gauge transformations and dressings are discussed in this framework and several examples are…
We provide the analytic expressions of the totally symmetric and anti-symmetric structure constants in the $\mathfrak{su}(N)$ Lie algebra. The derivation is based on a relation linking the index of a generator to the indexes of its non-null…
Classical non-neural dependency parsers put considerable effort on the design of feature functions. Especially, they benefit from information coming from structural features, such as features drawn from neighboring tokens in the dependency…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
We describe a basic correspondence between linear algebraic structures within vector embeddings in artificial neural networks and conditional independence constraints on the probability distributions modeled by these networks. Our framework…
Is incentive compatibility still necessary for implementation if we relax the rational expectations assumption? This paper proposes a generalized model of implementation that does not assume agents hold rational expectations and…
Learning compact and interpretable representations is a very natural task, which has not been solved satisfactorily even for simple binary datasets. In this paper, we review various ways of composing experts for binary data and argue that…
The lambda calculus is not upward confluent, one of counterexamples known thanks to Plotkin. This paper investigates upward confluence in the interaction calculus. Can an interaction system have this property? We positively answer this…
We have found a "non-purely-constructive" method of acquiring algebraic cycles involving multiple steps. This note tries to present the main idea in the last step by concentrating on an example of 4-folds. The method demonstrates a contrast…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
We discuss the problem of finding non-trivial invariants of non-deterministic, symmetric cut-reduction procedures in the classical sequent calculus. We come to the conclusion that (an enriched version of) the propositional fragment of GS4…
A mathematical notion of interaction is introduced for noncommutative dynamical systems, i.e., for one parameter groups of *-automorphisms of $\Cal B(H)$ endowed with a certain causal structure. With any interaction there is a well-defined…