The Bateman function revisited: A critical reevaluation of the quantitative expressions to characterize concentrations in the one compartment body model as a function of time with first-order invasion and first-order elimination

1994 ◽  
Vol 22 (2) ◽  
pp. 103-128 ◽  
Author(s):  
Edward R. Garrett
Keyword(s):  
2020 ◽  
Vol 8 (1) ◽  
pp. 68-91
Author(s):  
Gianmarco Giovannardi

AbstractThe deformability condition for submanifolds of fixed degree immersed in a graded manifold can be expressed as a system of first order PDEs. In the particular but important case of ruled submanifolds, we introduce a natural choice of coordinates, which allows to deeply simplify the formal expression of the system, and to reduce it to a system of ODEs along a characteristic direction. We introduce a notion of higher dimensional holonomy map in analogy with the one-dimensional case [29], and we provide a characterization for singularities as well as a deformability criterion.


1991 ◽  
Vol 15 (2) ◽  
pp. 123-138
Author(s):  
Joachim Biskup ◽  
Bernhard Convent

In this paper the relationship between dependency theory and first-order logic is explored in order to show how relational chase procedures (i.e., algorithms to decide inference problems for dependencies) can be interpreted as clever implementations of well known refutation procedures of first-order logic with resolution and paramodulation. On the one hand this alternative interpretation provides a deeper insight into the theoretical foundations of chase procedures, whereas on the other hand it makes available an already well established theory with a great amount of known results and techniques to be used for further investigations of the inference problem for dependencies. Our presentation is a detailed and careful elaboration of an idea formerly outlined by Grant and Jacobs which up to now seems to be disregarded by the database community although it definitely deserves more attention.


1993 ◽  
Vol 71 (5-6) ◽  
pp. 227-236 ◽  
Author(s):  
M. E. Carrington

There has been much recent interest in the finite-temperature effective potential of the standard model in the context of the electroweak phase transition. We review the calculation of the effective potential with particular emphasis on the validity of the expansions that are used. The presence of a term that is cubic in the Higgs condensate in the one-loop effective potential appears to indicate a first-order electroweak phase transition. However, in the high-temperature regime, the infrared singularities inherent in massless models produce cubic terms that are of the same order in the coupling. In this paper, we discuss the inclusion of an infinite set of these terms via the ring-diagram summation, and show that the standard model has a first-order phase transition in the weak coupling expansion.


1968 ◽  
Vol 5 (03) ◽  
pp. 648-668
Author(s):  
D. G. Lampard

In this paper we discuss a counter system whose output is a stochastic point process such that the time intervals between pairs of successive events form a first order Markov chain. Such processes may be regarded as next, in order of complexity, in a hierarchy of stochastic point processes, to “renewal” processes, which latter have been studied extensively. The main virtue of the particular system which is studied here is that virtually all its important statistical properties can be obtained in closed form and that it is physically realizable as an electronic device. As such it forms the basis for a laboratory generator whose output may be used for experimental work involving processes of this kind. Such statistical properties as the one and two-dimensional probability densities for the time intervals are considered in both the stationary and nonstationary state and also discussed are corresponding properties of the successive numbers arising in the stores of the counter system. In particular it is shown that the degree of coupling between successive time intervals may be adjusted in practice without altering the one dimensional probability density for the interval lengths. It is pointed out that operation of the counter system may also be regarded as a problem in queueing theory involving one server alternately serving two queues. A generalization of the counter system, whose inputs are normally a pair of statistically independent Poisson processes, to the case where one of the inputs is a renewal process is considered and leads to some interesting functional equations.


1987 ◽  
Vol 120 ◽  
pp. 103-105
Author(s):  
J. Le Bourlot ◽  
E. Roueff

We present a new calculation of intercombination transition probabilities between levels X1Σg+ and a 3Πu of the C2 molecule. Starting from experimental energy levels, we calculate RKR potential curves using Leroy's Near Dissociation Expansion (NDE) method; these curves give us wave functions for all levels of interest. We then compute the energy matrix for the four lowest states of C2, taking into account Spin-Orbit coupling between a 3Πu and A 1Πu on the one hand and X 1Σ+g and b 3Σg− on the other. First order wave functions are then derived by diagonalization. Einstein emission transition probabilities of the Intercombination lines are finally obtained.


2018 ◽  
Vol 18 (3-4) ◽  
pp. 390-405 ◽  
Author(s):  
PEDRO CABALAR ◽  
JORGE FANDINNO ◽  
LUIS FARIÑAS DEL CERRO ◽  
DAVID PEARCE

AbstractIn this paper, we propose a variant of Answer Set Programming (ASP) with evaluable functions that extends their application to sets of objects, something that allows a fully logical treatment of aggregates. Formally, we start from the syntax of First Order Logic with equality and the semantics of Quantified Equilibrium Logic with evaluable functions (${\rm QEL}^=_{\cal F}$). Then, we proceed to incorporate a new kind of logical term,intensional set(a construct commonly used to denote the set of objects characterised by a given formula), and to extend${\rm QEL}^=_{\cal F}$semantics for this new type of expression. In our extended approach, intensional sets can be arbitrarily used as predicate or function arguments or even nested inside other intensional sets, just as regular first-order logical terms. As a result, aggregates can be naturally formed by the application of some evaluable function (count,sum,maximum, etc) to a set of objects expressed as an intensional set. This approach has several advantages. First, while other semantics for aggregates depend on some syntactic transformation (either via a reduct or a formula translation), the${\rm QEL}^=_{\cal F}$interpretation treats them as regular evaluable functions, providing a compositional semantics and avoiding any kind of syntactic restriction. Second, aggregates can be explicitly defined now within the logical language by the simple addition of formulas that fix their meaning in terms of multiple applications of some (commutative and associative) binary operation. For instance, we can use recursive rules to definesumin terms of integer addition. Last, but not least, we prove that the semantics we obtain for aggregates coincides with the one defined by Gelfond and Zhang for the${\cal A}\mathit{log}$language, when we restrict to that syntactic fragment.


Author(s):  
Vasil Penchev

Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with other well-known mathematical observations: (1) the paradox of Achilles and the Turtle; (2) the transitivity of the relation of equality. Analogically to (1), one can juxtapose the paradox of the Liar (for Lewis Carroll’s paradox) and that of the arrow (for “Achilles and the Turtle”), i.e. a logical paradox, on the one hand, and an aporia of motion, on the other hand, suggesting a shared formal structure of both, which can be called “ontological”, on which basis “motion” studied by physics and “conclusion” studied by logic can be unified being able to bridge logic and physics philosophically in a Hegelian manner: even more, the bridge can be continued to mathematics in virtue of (2), which forces the equality (for its property of transitivity) of any two quantities to be postponed analogically ad lib and ad infinitum. The paper shows that Hilbert arithmetic underlies naturally Lewis Carroll’s paradox admitting at least three interpretations linked to each other by it: mathematical, physical and logical. Thus, it can be considered as both generalization and solution of his paradox therefore naturally unifying the completeness of quantum mechanics (i.e. the absence of hidden variables) and eventual completeness of mathematics as the same and isomorphic to the completeness of propositional logic in relation to set theory as a first-order logic (in the sense of Gödel (1930)’s completeness theorems).


Sign in / Sign up

Export Citation Format

Share Document