相关论文: A Note on One Less Known Class of Generated Residu…

The powers of generating functions and its properties are analyzed. A new class of functions is introduced, based on the application of compositions of an integer $n$, called composita. The methods for obtaining reciprocal and reverse…

In this paper we show that using implicative algebras one can produce models of set theory generalizing Heyting/Boolean-valued models and realizability models of (I)ZF, both in intuitionistic and classical logic. This has as consequence…

We show that for every orthomodular poset P of finite height there can be defined two operators forming an adjoint pair with respect to an order-like relation defined on the power set of P. This enables us to introduce the so-called…

This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…

In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…

Riemann surfaces with nodes can be described by introducing simple composite operators in matrix models. In the case of the Kontsevich model, it is sufficient to add the quadratic, but ``non-propagating'', term (tr[X])^2 to the Lagrangian.…

Estimating causal effects of joint interventions on multiple variables is crucial in many domains, but obtaining data from such simultaneous interventions can be challenging. Our study explores how to learn joint interventional effects…

Most machine learning (ML) models are developed for prediction only; offering no option for causal interpretation of their predictions or parameters/properties. This can hamper the health systems' ability to employ ML models in clinical…

GP-GOMEA is among the state-of-the-art for symbolic regression, especially when it comes to finding small and potentially interpretable solutions. A key mechanism employed in any GOMEA variant is the exploitation of linkage, the…

With one exception, our previous work on recurrence extraction and denotational semantics has focused on a source language that supports inductive types and structural recursion. The exception handles general recursion via an initial…

Statistical inference in physics is often based on samples from a generator (sometimes referred to as a ``forward model") that emulate experimental data and depend on parameters of the underlying theory. Modern machine learning has…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Clocked Type Theory (CloTT) is a type theory for guarded recursion useful for programming with coinductive types, allowing productivity to be encoded in types, and for reasoning about advanced programming language features using an abstract…

The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a…

Using the operators of taking upper and lower cones in a poset with a unary operation, we define operators M(x,y) and R(x,y) in the sense of multiplication and residuation, respectively, and we show that by using these operators, a general…

We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence. While Blok and J\'onsson admit, in place…

Let $V$ be a vertex operator algebra and $g$ an automorphism of finite order. We construct an associative algebra $A_g(V)$ and a pair of functors between the category of $A_g(V)$-modules and a certain category of admissible $g$-twisted…

We generalize Loewner's method for proving that matrix monotone functions are operator monotone. The relation x \leq y on bounded operators is our model for a definition for C*-relations of being residually finite dimensional. Our main…

We generalize the proximal g-formula of Miao, Geng, and Tchetgen Tchetgen (2018) for causal inference under unobserved confounding using proxy variables. Specifically, we show that the formula holds true for all causal models in a certain…

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…