نتایج جستجو برای: lukasiewicz composition

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

2012
Paul Barry Aoife Hennessy

We study a family of polynomials in two variables, identifying them as the moments of a two-parameter family of orthogonal polynomials. The coefficient array of these orthogonal polynomials is shown to be an ordinary Riordan array. We express the generating function of the sequence of polynomials under study as a continued fraction, and determine the corresponding Hankel transform. An alternati...

Journal: :ITA 2001
Ludwig Staiger

The paper presents an elementary approach for the calculation of the entropy of a class of languages. This approach is based on the consideration of roots of a real polynomial and is also suitable for calculating the Bernoulli measure. The class of languages we consider here is a generalisation of the Lukasiewicz language. Mathematics Subject Classification. 68Q30, 68Q45, 94A17.

Journal: :Int. J. Approx. Reasoning 1998
George Georgescu Ioana Leustean

We define a concept of probability on an n-valued Lukasiewicz-Moisil algebra and we present some basic properties. The main result is an extension theorem for continuous probabilities, which is already known for probabilities defined on Boolean algebras and MV-algebras. © 1998 Elsevier Science Inc. All rights reserved.

Journal: :J. UCS 2005
Ludwig Staiger

The paper investigates fixed points and attractors of infinite iterated function systems in Cantor space. By means of the theory of formal languages simple examples of the non-coincidence of fixed point and attractor (closure of the fixed point) are given.

2008
Antonio Di Nola George Georgescu Luca Spada

In this paper we study the notion of forcing for Lukasiewicz predicate logic ( L∀, for short), along the lines of Robinson’s forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for L∀, while for the latter, we study the generic and existentially complete standard models of L∀.

1999
Siegfried Gottwald

In fuzzy logic in wider sense t norms got a prominent r ole in recent times In many valued logic the Lukasiewicz systems the G odel sytems and also the product logic are t norm based The present paper discusses the more general problem of the adequate axiomatizability for such t norm based logical systems in general survey ing results of the last years

1998
Giovanni Panti

2 General theory 3 2.1 Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Some logical calculi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.1 Sequent and tableau calculi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.2 Resolution calculi . . . . . . . . . . . . . . . . . . . . . ...

Journal: :iranian journal of science and technology (sciences) 2006
o. r sayed

in this paper the concepts of fuzzifying β − irresolute functions and fuzzifying β − compactspaces are characterized in terms of fuzzifying β − open sets and some of their properties are discussed.

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

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