In some temporal reasoning systems, inequations can give rise to disjunctions of inequa-tions when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense.) We present results on consistency checking, canonical forms and variable elimination for this ...

Functional programming language design has been shaped by the framework of natural deduction, in which constructs are divided into introduction and elimination rules for producers values. In sequent calculus-based languages, left replace (right) provide a dedicated sublanguage consumers this paper, we present analyze wider space languages encompasses four kinds rules: Introduction elimination, ...

background: the aim of this study was to propose a new stochastic model to study the time course of ethanol elimination in human bodies. methods: the times and amount of alcohol ingested are assumed to be random in controllable intervals. constant elimination rate follows zero order kinetics and is replaced by first order kinetics when the effects of alcohol increase due to alcohol ingestion. s...

I focus on two arguments, due to Jaegwon Kim and Trenton Merricks, that move from claims about the sufficiency of one class of causes to the reduction or elimination of another class of entity, via claims about overdetermination. I argue that in order to validate their move from sufficiency to reduction or elimination, both Kim and Merricks must assume that there can be no 'weak overdeterminati...

Drug elimination is described in terms of clearance from a well-stirred compartment containing uniform drug distribution. The term clearance describes the process of drug elimination from the body or from a single organ without identifying the individual processes involved. Clearance may be defined as the volume of fluid cleared of drug from the body per unit of time. The units for clearance ar...

Perfect vertex elimination schemes are part of the characterizations for several classes of graphs, including chordal and cop-win. Partial elimination schemes reduce a graph to an important subgraph, for example, k-cores and robber-win graphs. We are interested in those partial elimination schemes, in which once a vertex can be eliminated it is always ready to be eliminated. In such a scheme, t...

We prove several results related to local proofs, interpolation and superposition calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and results suggest that symbol-eliminating inferences may be an interesting alternative to interpolation.