Related papers: On properties of $B$-terms
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
We study a question posed by Stephen Simons in his 2008 monograph involving "bigger conjugate" (BC) functions and the partial infimal convolution. As Simons demonstrated in his monograph, these function have been crucial to the…
In this note, we continue to highlight some applications of Theorem 1 of [3]. Here is a sample: Let $X$ be an open set in ${\bf C}^n$, $\Omega$ an open convex set in ${\bf C}$ and $f, g : X\to {\bf C}$ two holomorphic functions such that…
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar…
Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing constraints on the structure of such circuits, certain inference…
We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…
Relational machine learning programs like those developed in Inductive Logic Programming (ILP) offer several advantages: (1) The ability to model complex relationships amongst data instances; (2) The use of domain-specific relations during…
Let H be a separable, infinite dimensional Hilbert space and let S be a countable subset of H. Then most positive operators on H have the property that every nonzero vector in the span of S is cyclic, in the sense that the set of operators…
This paper contributes to the mathematical foundations of logic programming by introducing and studying the sequential composition of answer set programs. On the semantic side, we show that the immediate consequence operator of a program…
The construction of frames for a Hilbert space H can be equated to the decomposition of the frame operator as a sum of positive operators having rank one. This realization provides a different approach to questions regarding frames with…
This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group $G$ is…
Systematic compositionality is the ability to recombine meaningful units with regular and predictable outcomes, and it's seen as key to humans' capacity for generalization in language. Recent work has studied systematic compositionality in…
In this paper we characterize some basic properties of composition operators on the spaces of harmonic Bloch functions. First we provide some equivalent conditions for boundedness and compactness of composition operators. Then by using…
Let $X$ be a complex topological vector space with $dim(X)>1$ and $\mathcal{B}(X)$ the set of all continuous linear operators on $X$. The concept of hypercyclicity for a subset of $\mathcal{B}(X)$, was introduced in \cite{AKH}. In this…
In recent years, the BCFW construction provided a very powerful tool for computing scattering amplitudes as well as it shed light on the perturbation theory structure. In this talk, we discuss the long-standing issue of the boundary term…
Choice constructs are an important part of the language of logic programming, yet the study of their semantics has been a challenging task. So far, only two-valued semantics have been studied, and the different proposals for such semantics…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
Consider $\mathscr{F}$ a non-empty set of subsets of $\mathbb{N}$. An operator $T$ on $X$ satisfies property $\mathcal{P}_{\mathscr{F}}$ if for any $U$ non-empty open set in $X$, there exists $x\in X$ such that $\{n\in\mathbb{N}: T^nx\in…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…