Bellin, G. and J. Ketonen, A decision procedure revisited: Notes on direct logic, linear logic and its implementation, Theoretical Computer Science 95 (1992) 115-142. This paper studies decidable fragments of predicate calculus. We will focus on the structure of direct predicate calculus as defined in Ketonen and Weyhrauch (1984) in the light of the recent work of Girard (Girard 1987, 1988) on ...

Background: Patients need peace of mind to disclose their information to medical staff and with the lack of trust or in specific health status, they may avoid providing sensitive information for their care or might change the information. This research aims to examine the impact of perceived health status and trust propensity on privacy calculus. Methods: This research was analytical-study. 3 ...

Mascari, G. F. and M. Pedicini, Head linear reduction and pure proof net extraction, Theoretical Computer Science 135 (1994) 111–137. Proof net calculus introduced in [10] has been extended in the paradigm of the Scott’s domains equation D = D → D which generates a logical point of view for pure λ-calculus in [7]. Methodologically speaking: in this paper the proof theoretic counterpart of the B...

We introduce a formal language, the C-calculus, for modelling lowlevel interaction inside and among cells, the basic building blocks of all known life. We focus on two main actors of cells, proteins and membranes. Proteins are represented as clusters of domains sharing a common hidden name; domain-domain bonds are also represented via name-sharing. Compartments are formed by formal membranes. W...

In this paper, the second in a series of eight we continue our development of the basic tools of the multivector and extensor calculus which are used in our formulation of the differential geometry of smooth manifolds of arbitrary topology. We introduce metric and gauge extensors, pseudo-orthogonal metric extensors, gauge bases, tetrad bases and prove the remarkable golden formula, which permit...

This paper presents a sequent calculus and dual domain semantics for theory of definite descriptions in which these expressions are formalised the context complete sentences by binary quantifier I. I forms formula from two formulas. Ix[F, G] means ‘The F is G’. approach has advantage incorporating scope distinctions directly into notation. Cut elimination proved system classical positive free l...

In this paper, the second in a series of three we continue our development of the basic tools of the multivector and extensor calculus. We introduce metric and gauge extensors, orthogonal metric extensor, gauge bases tetrad bases and prove the remarkable golden formula, which permit us to view any Clifford algebra Cℓ(V, G) as a deformation of the euclidean Clifford algebra Cℓ(V, G E) discussed ...

We study the space X (G) of pictures of a graph G in complex projective d-space. The main result is that the homology groups (with integer coefficients) of X (G) are completely determined by the Tutte polynomial of G. One application is a criterion in terms of the Tutte polynomial for independence in the d-parallel matroids studied in combinatorial rigidity theory. For certain special graphs ca...

From elliptic regularity one immediately has that, should such a minimizer u exist, u ∈ C∞(Ω̄). Then u is in fact a smooth (analytic, even) harmonic function obtaining the boundary value g, i.e. a solution to the classical Dirichlet problem with boundary data g. A standard exercise in the Direct Method of the Calculus of Variations provides for the existence of a minimizer, i.e. ∃u ∈ H g (Ω;R) s...

We consider random variables of the form F = f(V1, . . . , Vn), where f is a smooth function and Vi, i ∈N, are random variables with absolutely continuous law pi(y)dy. We assume that pi, i= 1, . . . , n, are piecewise differentiable and we develop a differential calculus of Malliavin type based on ∂ lnpi. This allows us to establish an integration by parts formula E(∂iφ(F )G) = E(φ(F )Hi(F,G)),...