نتایج جستجو برای: forward powerset operator

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

‎In this paper we try to extend geometric concepts in the context of operator valued tensors‎. ‎To this end‎, ‎we aim to replace the field of scalars $ mathbb{R} $ by self-adjoint elements of a commutative $ C^star $-algebra‎, ‎and reach an appropriate generalization of geometrical concepts on manifolds‎. ‎First‎, ‎we put forward the concept of operator-valued tensors and extend semi-Riemannian...

Journal: :Set-Valued and Variational Analysis 2020

Journal: :J. Comput. Syst. Sci. 1996
Limsoon Wong

Strong normalization results are obtained for a general language for collection types. An induced normal form for sets and bags is then used to show that the class of functions whose input has height (that is, the maximal depth of nestings of sets/bags/lists in the complex object) at most i and output has height at most o de nable in a nested relational query language without powerset operator ...

Journal: :Math. Log. Q. 2004
Matteo Viale

We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell (see [5]) in order to prove that the universe of ZFA can also be obtained (without appealing to choice) as the least fixed point of a continuous operator and not only as the greatest fixed point of the powerset operator. Next w...

Journal: :Logical Methods in Computer Science 2022

Let CABA be the category of complete and atomic boolean algebras homomorphisms, let CSL meet-semilattices meet-homomorphisms. We show that forgetful functor from to has a left adjoint. This allows us describe an endofunctor H on such Alg(H) for is dually equivalent Coalg(P) coalgebras powerset P Set. As consequence, we derive Thomason duality Tarski duality, thus paralleling how J\'onsson-Tarsk...

Journal: :Journal of Logic, Language and Information 2009
Yael Sygal Shuly Wintner

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity s...

Journal: :International Journal on Software Tools for Technology Transfer 2007

2008
H. Neuberger

My talk is divided into five parts. In the first part the relevance of the chiral fermion issue to fundamental particle physics and to numerical QCD will be explained. In the second part the basic ideas of the overlap construction will be reviewed. In the third part I shall focus on the algebraic (as opposed to kinematic) meaning of the overlap. In the fourth part I shall discuss in greater det...

1999
Avrim Blum John Langford

The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we explore the extent to which its representation can be used for probabilistic planning In particular we consider an MDP style framework in which the state of the world is known but actions are probabilistic and the objective is to produce a nite horizon contingent plan wit...

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

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