Related papers: Variable binding and substitution for (nameless) d…
Signed systems were introduced as a general, syntax-independent framework for paraconsistent reasoning, that is, non-trivialised reasoning from inconsistent information. In this paper, we show how the family of corresponding paraconsistent…
We define a novel, extensional, three-valued semantics for higher-order logic programs with negation. The new semantics is based on interpreting the types of the source language as three-valued Fitting-monotonic functions at all levels of…
We develop an analogue of universal algebra in which generating symbols are interpreted as relations. We prove a variety theorem for these relational algebraic theories, in which we find that their categories of models are precisely the…
We will first define what is meant by ``hidden variables". Then, we will review various theorems proving the impossibility of theories introducing such variables and then show that the de Broglie-Bohm theory is not refuted by those…
We investigate the variation of the string field action under changes of the string field vertices giving rise to different decompositions of the moduli spaces of Riemann surfaces. We establish that any such change in the string action…
Through the analyses of volume-forms in differentiable manifolds, it is shown that the usual way of defining minimal action principles for field theory on curved space-times is not appropriate on non-riemannian manifolds. An alternative…
Nominal abstract syntax is a popular first-order technique for encoding, and reasoning about, abstract syntax involving binders. Many of its applications involve constraint solving. The most commonly used constraint solving algorithm over…
A new version of a Strong Law of Large Numbers is proposed in this note for pairwise independent random variables. The main goal is to relax the assumption on a finite expectation for each term.
Let $G_\cpl$ be a connected complex reductive Lie group, and $G$ be a real form. Let $(\pi,V)$ be a finite-dimensional irreducible representation of $G$. Assume $(\pi,V)$ admits a $G$ invariant hermitian form. {In…
We examine the modular properties of nonrenormalizable superpotential terms in string theory and show that the requirement of modular invariance necessitates the nonvanishing of certain Nth order nonrenormalizable terms. In a class of…
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which…
Using theory of props we prove a formality theorem associated with universal quantizations of (strongly homotopy) Lie bialgebras.
The paper deals with $\Sigma-$composition of terms, which allows us to extend the derivation rules in formal deduction of identities. The concept of essential variables and essential positions of terms with respect to a set of identities is…
Based on Beurling's theory of balayage, we develop the theory of non-uniform sampling in the context of the theory of frames for the settings of the Short Time Fourier Transform and pseudo-differential operators. There is sufficient…
The subject of this paper is a simulation to that in [1] but here we consider substitutions corresponding to transpositions instead of replacements.
The good properties of Plotkin's call-by-value lambda-calculus crucially rely on the restriction to weak evaluation and closed terms. Open call-by-value is the more general setting where evaluation is weak but terms may be open. Such an…
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and…
We complete the study of characters on higher rank semisimple lattices initiated in [BH19,BBHP20], the missing case being the case of lattices in higher rank simple algebraic groups in arbitrary characteristics. More precisely, we…
The contribution of this paper is the development of the syntax and semantics of multi-sorted nominal abstract binding trees (abts), an extension of second order universal algebra to support symbol-indexed families of operators. Nominal…
A framework and method are proposed for the study of constituent composition in fMRI. The method produces estimates of neural patterns encoding complex linguistic structures, under the assumption that the contributions of individual…