The formal theory of division in arithmetical algebras reconstructs fractions as syntactic objects called fracterms. Basic to calculation, is the simplification fracterms with one operator, a process fracterm attening. We consider equational axioms calculus for calculating determine what necessary and sufficient allow flattening. For computation, require operators be total which there are sever...

a class of new methods based on a septic non-polynomial spline function for the numerical solution of problems in calculus of variations is presented. the local truncation errors and the methods of order 2th, 4th, 6th, 8th, 10th, and 12th, are obtained. the inverse of some band matrixes are obtained which are required in proving the convergence analysis of the presented method. convergence anal...

In the area of qualitative spatial reasoning, the LR calculus is a quite simple constraint calculus that forms the core of several orientation calculi like the dipole calculi and the OPRA1 calculus. For many qualitative spatial calculi, algebraic closure is applied as standard polynomial time decision procedure. For a long time it was believed that this can decide the consistency of scenarios o...

performance of heart has substantial role in breaking records of sports. achieving to optimal performance of endurance training builds upon the consistency in several parts of body specially heart. type, intensity, term training programs is determining components of providing structural consistency and performance of heart especially in left ventricular. aim of this research was comparing struc...

A clear and modular speciication of Prolog using the-calculus is presented in this paper. Prolog goals are represented as-calculus processes, and Prolog predicate deenitions are translated into-calculus agent deenitions. Prolog's depth-rst left-right control strategy as well as the cut control operator are modeled by the synchronized communication among processes, which is similar in spirit to ...

LJQ is a focused sequent calculus for intuitionistic logic, with a simple restriction on the first premisss of the usual left introduction rule for implication. We discuss its history (going back to about 1950, or beyond), present the underlying theory and its applications both to terminating proof-search calculi and to call-by-value reduction in lambda calculus.

OBJECTIVE To establish the incidence of systolic and diastolic dysfunction of the right and left ventricle in a large cohort of patients after Mustard or Senning operations and to assess changes in the incidence on long term follow up. DESIGN Postoperative case-control study using radionuclide ventriculography. Ejection fractions, peak filling rates, rapid filling periods and fractions, slow ...

Some temporal query languages work directly on a timestamp representation of the temporal database, while others provide a more implicit access to the ow of time by means of temporal connectives. We study the diier-ences in expressive power between these two approaches. We rst consider rst-order logic (i.e., the relational calculus). We show that rst-order future temporal logic is strictly less...

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 ...