نتایج جستجو برای: godel algebra

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

Journal: :iranian journal of science and technology (sciences) 2014
r. tayebi khorami

in this paper, we introduce the notion of multiplier in -algebra and study relationships between multipliers and some special mappings, likeness closure operators, homomorphisms and ( -derivations in -algebras. we introduce the concept of idempotent multipliers in bl-algebra and weak congruence and obtain an interconnection between idempotent multipliers and weak congruences. also, we introduce...

2010
FRED B. WRIGHT

In an important sequence of papers, Halmos has developed the beautiful and significant theory of algebraic logic. The central mathematical object of this theory is the polyadic algebra, which incorporates in an axiomatic way the concepts of substitution, transformation, and quantification for the lower functional calculus. The beauty of the theory is revealed by the fact that the semantic compl...

Journal: :Philosophia Mathematica 2010

1993
Patricia M. Hill

The paper is concerned with the design of a module system for logic programming so as to satisfy many of the requirements of software en­ gineering. The design is based on the language Godel which is a logic programming language which already has a simple type and module system. The module system described here ex­ tends the Godel module system so as to include parameterised modules. In particu...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی اصفهان 1390

we commence by using from a new norm on l1(g) the -algebra of all integrable functions on locally compact group g, to make the c-algebra c(g). consequently, we find its dual b(g), which is a banach algebra so-called fourier-stieltjes algebra, in the set of all continuous functions on g. we consider most of important basic theorems about this algebra. this consideration leads to a rather com...

1993
Harold Boley François Bry Ulrich Geske

Deduktive Datenbanksysteme, die Programmiersprache Godel und die Evolution von Wissensbasen (Abschnitte 2 bis 4).

Journal: :The Open Physical Chemistry Journal 2008

Journal: :Journal of Logic and Computation 2003

2013
Vikas Shivashankar Ron Alford Ugur Kuter Dana S. Nau

One drawback of Hierarchical Task Network (HTN) planning is the difficulty of providing complete domain knowledge, i.e., a complete and correct set of HTN methods for every task. To provide a principled way to overcome this difficulty, we define a simple formalism that extends classical planning to include problem decomposition using methods, and a planning algorithm based on this formalism. In...

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

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