Approximation Logic and Strong Bunge Algebra
نویسندگان
چکیده
منابع مشابه
fragmentability and approximation
in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...
15 صفحه اولstrong approximation for itô stochastic differential equations
in this paper, a class of semi-implicit two-stage stochastic runge-kutta methods (srks) of strong global order one, with minimum principal error constants are given. these methods are applied to solve itô stochastic differential equations (sdes) with a wiener process. the efficiency of this method with respect to explicit two-stage itô runge-kutta methods (irks), it method, milstien method, sem...
متن کاملProcess Algebra and Dynamic Logic
An extension of process algebra is introduced which can be compared to (propositional) dynamic logic. The additional feature is a ‘guard’ construct, related to the notion of a test in dynamic logic. This extension of process algebra is semantically based on processes that transform data, and its operational semantics is defined relative to a structure describing these transformations via transi...
متن کاملProcess Algebra and Hoare's Logic
A Hoare-like logic is introduced for deriving`partial correctness assertions' of the form fg p fg, where ; are unary predicates over some state space S and p is an expression over a recursive, non-uniform language containing global nondeterminism (+) and sequential composition (). This logic is (relatively) complete if only guarded recursion is considered.
متن کاملUniversal Algebra and Mathematical Logic
In this paper, first-order logic is interpreted in the framework of universal algebra, using the clone theory developed in three previous papers [1] [2] and [3]. We first define the free clone T pL, Cq of terms of a first order language L over a set C of parameters in a standard way. The free right algebra FpL, Cq of formulas over the clone T pL, Cq of terms is then generated by atomic formulas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1995
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1040136919