نتایج جستجو برای: g calculus

تعداد نتایج: 500869  

2007
Patrick Cousot

ion to the Bifinitary Relational Semantics of the Eager –-calculus remember the input/output behaviors, forget about the intermediate computation steps ̧(T ) def = f ̧(ff) j ff 2 Tg ̧(ff0 › ff1 › : : : › ffn) def = hff0; ffni ̧(ff0 › : : : › ffn › : : :) def = hff0; ?i CS Colloquium, NYU, 9/4/2007 — 29 — ľ P. Cousot Bifinitary Relational Semantics of the Eager –-calculus v =) v; v 2 V a =) ? a b =)...

2006
David Nualart

The Malliavin calculus is an infinite dimensional calculus on a Gaussian space, which is mainly applied to establish the regularity of the law of nonlinear functionals of the underlying Gaussian process. Suppose that H is a real separable Hilbert space with scalar product denoted by 〈·, ·〉H . The norm of an element h ∈ H will be denoted by ‖h‖H . Consider a Gaussian family of random variables W...

The Euler-Lagrange equation plays an important role in the minimization problems of the calculus of variations. This paper employs the differential transformation method (DTM) for finding the solution of the Euler-Lagrange equation which arise from problems of calculus of variations. DTM provides an analytical solution in the form of an infinite power series with easily computable components. S...

Journal: :Journal of Mathematical Physics 2021

In this paper, we investigate the reachability of linear and non-linear systems in sense ?-Hilfer pseudo-fractional derivative g-calculus by means Mittag–Leffler functions (one two parameters). sense, numerical examples are discussed order to elucidate investigated results.

2007
Raul Hakli Sara Negri

The proof theory of multi-agent epistemic logic extended with operators for distributed knowledge is studied. Distributed knowledge of A within a group G means that A follows from the totality of what the individual members of G know. There are known axiomatizations for epistemic logics with the distributed knowledge operator, but apparently no cut-free proof system for such logics has yet been...

Journal: :computational methods for differential equations 0
abbas saadatmandi university of kashan, kashan, iran tahereh abdolahi-niasar university of kashan, kashan, iran

the euler-lagrange equation plays an important role in the minimization problems of the calculus of variations. this paper employs the differential transformation method (dtm) for finding the solution of the euler-lagrange equation which arise from problems of calculus of variations. dtm provides an analytical solution in the form of an infinite power series with easily computable components. s...

Journal: :International Mathematics Research Notices 2022

Abstract We establish a noncommutative generalisation of the Borel–Weil theorem for Heckenberger–Kolb calculi irreducible quantum flag manifolds ${\mathcal {O}}_q(G/L_S)$, generalising previous work Grassmannians {O}}_q(\textrm {Gr}_{n,m})$. As direct consequence we get novel differential geometric presentation coordinate rings $S_q[G/L_S]$ manifolds. The proof is formulated in terms principal ...

Journal: :Journal of Pure and Applied Algebra 2022

In the present paper we provide a general algorithm to compute multiplicative cohomological operations on algebraic oriented cohomology of projective homogeneous G-varieties, where G is split reductive group over field k characteristic 0. More precisely, extend such respective T-equivariant (T maximal torus G) theories, and then them using equivariant Schubert calculus techniques. This generali...

1998
Ralph Matthes Felix Joachimski

We study inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms in order to give short proofs of weak and strong normalization for the simply-typed-calculus and for an extension by sum types with permutative conversions. In contrast to the strong computability/candidate style a la Tait and Girard this proof can be formalized in primitive recu...

2001
Giuseppe Longo Kathleen Milsted Sergei Soloviev

Longo, G., K. M&ted and S. Soloviev, The genericity theorem and parametricity in the polymorphic I-calculus, Theoretical Computer Science 121 (1993) 323-349. This paper focuses on how terms of the polymorphic I-calculus, which may take types as inputs, depend on types. These terms are generally understood, in all models, to have an “essentially” constant meaning on input types. We show how the ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید