We show how and why it makes sense to use a relational formalisation instead of the usual functional one in the treatment of term graphs. Special attention is paid to term graphs with bound variables, that have, to our knowledge, never been formalised with such a generality before. Besides the novel treatment of term graphs themselves, we present an innovative relational homomorphism concept th...

This paper presents an analysis of bound variable pronouns in English using Synchronous Tree Adjoining Grammar. Bound variables are represented as multi-component sets, composing in delayed tree-local derivations. We propose that the observed anti-locality restriction on English bound variables can be for-malised in terms of a constraint on the delay in the composition of the bound variable mul...

Ala~traet--Errors-in-variables problems are considered for the case of three variables, where the underlying relations among the noise-free variables are linear, and covariance information for the noisy variables is available. The static problem where the variables are complex (which can arise when narrowband filtering is used) is analysed in detail. Some results are also presented for the case...

in this paper, we consider the inhomogeneous time-fractional nonlinear fisher equation with three known boundary conditions. we first apply a modified homotopy perturbation method for translating the proposed problem to a set of linear problems. then we use the separation variables  method to solve obtained problems. in examples, we illustrate that by right choice of source term in the modified...

Some basic properties relating to relative lower order of entire functions of two complex variables are discussed in this paper.

The paper consists of two parts. The rst one is a concise introduction to epistemic (both propositional and predicate) logic with common knowl-ege operator. As the full common knowledge predicate logics are not even recursively enumerable, in the second part we introduce and investigate the monodic fragment of these logics which allows applications of the epistemic operators to formulas with at...

Let z = (z1, z2, · · · , zn) be noncommutative free variables and t a formal parameter which commutes with z. Let k be a unital commutative ring of any characteristic and Ft(z) = z−Ht(z) with Ht(z) ∈ k[[t]]〈〈z〉〉 ×n and o(Ht(z)) ≥ 2. Note that Ft(z) can be viewed as a deformation of the formal map F (z) := z−Ht=1(z) when it makes sense. The inverse map Gt(z) of Ft(z) can always be written as Gt(...