In this paper we revisit the concept of “delocutive derivation”, originally explored by several French linguists, viz. Benveniste, Ducrot, Anscombre, Récanati. Thus, even though the early attempts to “theorize” the concept seem convincing, in this paper we argue for a clarification of the delocutive derivation process, which is seen as a unique procedure, parameterized in several ways, instead ...

We extend some recent results on the differentiability of torsion theories. In particular, we generalize the concept of (α, β)-derivation to (α, β)higher derivation and demonstrate that a filter of a hereditary torsion theory that is invariant for α and β is (α, β)-higher derivation invariant. As a consequence, any higher derivation can be extended from a module to its module of quotients. Then...

Amenability is a cohomological property of Banach algebras which was introduced by Johnson in [14]. Let A be a Banach algebra, and suppose that X is a Banach A−bimodule such that the following statements hold ∥a · x∥ ≤ ∥a∥∥x∥ and ∥x · a∥ ≤ ∥a∥∥x∥ for each a ∈ A and x ∈ X. We can define the right and left actions of A on dual space X∗ of X via ⟨x, λ · a⟩ = ⟨a · x, λ⟩ ⟨x, a · λ⟩ = ⟨x · a, λ⟩, for...

In this paper, we introduce the concept of a derivation in an Almost Distributive Lattice (ADL) and derive some important properties of derivations in ADLs. Also we introduce the concepts of a principal derivation, an isotone derivation and the fixed set of a derivation. We derive important results on derivations in Heyting ADLs.

Let R be an associative ring not necessarily with identity element. For any x, y ∈ R. Recall that R is prime if xRy = 0 implies x = 0 or y = 0, and is semiprime if xRx = 0 implies x = 0. Given an integer n ≥ 2, R is said to be n−torsion free if for x ∈ R, nx = 0 implies x = 0.An additive mapping d : R → R is called a derivation if d(xy) = d(x)y + yd(x) holds for all x, y ∈ R, and it is called a...

Relative correctness is the property of a program to be morecorrect than another program with respect to a given specification. Among the many properties of relative correctness, that which we found most intriguing is the property that program P ′ refines program P if and only if P ′ is more-correct than P with respect to any specification. This inspires us to reconsider program derivation by s...

In this appendix, we first describe the mathematical derivation of the marginal likelihood of model Mh: P (G|Mh) (Section 2). Then we show four equivalent formulas for solving P (G|Mh) (Section 3). After that, we show how to obtain the marginal likelihood of model Ml from the solution to the marginal likelihood of model Mh (Section 4). Finally, we show that the overall computational complexity ...

A derivation tree consists of nodes containing sets of assertions. The root node contains an initial set of assertions and each non-leaf node is labeled by a derivation rule used to derive the children of the node from the node itself. The derivation rules used by the T S solver give rise to a sequence of derivation trees (called a derivation). The initial tree in the derivation contains only a...

In this paper as a generalization of derivation and f -derivation on a lattice we introduce the notion of generalized (f, g)-derivation of a lattice. We give illustrative example. If the function g is equal to the function f then the generalized (f, g)-derivation is the f -derivation defined in [8]. Also if we choose the function f and g the identity functions both then the derivation we define...