Multiplicative valued difference fields

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiplicative valued difference fields

The theory of valued difference fields (K,σ, v) depends on how the valuation v interacts with the automorphism σ. Two special cases have already been worked out the isometric case, where v(σ(x)) = v(x) for all x ∈ K, has been worked out by Luc Belair, Angus Macintyre and Thomas Scanlon; and the contractive case, where v(σ(x)) > nv(x) for all x ∈ K× with v(x) > 0 and n ∈ N, has been worked out b...

متن کامل

Valued Difference Fields and Ntp

We show that the theory of the non-standard Frobenius automorphism, acting on an algebraically closed valued field of equal characteristic 0, is NTP2. More generally, in the contractive as well as in the isometric case, we prove that a σ-Henselian valued difference field of equicharacteristic 0 is NTP2, provided both the residue difference field and the value group (as an ordered difference gro...

متن کامل

Multiplicative Finite Difference Methods

Based on multiplicative calculus, the finite difference schemes for the numerical solution of multiplicative differential equations and Volterra differential equations are presented. Sample problems were solved using these new approaches.

متن کامل

FUZZY HYPERVECTOR SPACES OVER VALUED FIELDS

In this note we first redefine the notion of a fuzzy hypervectorspace (see [1]) and then introduce some further concepts of fuzzy hypervectorspaces, such as fuzzy convex and balance fuzzy subsets in fuzzy hypervectorspaces over valued fields. Finally, we briefly discuss on the convex (balanced)hull of a given fuzzy set of a hypervector space.

متن کامل

Multiplicative complexity of vector valued Boolean functions

We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called ΣΠΣ circuits, we show that there is a tight connection between error correcting codes and circuits computing functions with high nonlinearity. Combining this with known coding theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Symbolic Logic

سال: 2012

ISSN: 0022-4812,1943-5886

DOI: 10.2178/jsl/1333566637