نتایج جستجو برای: godel algebra
تعداد نتایج: 69871 فیلتر نتایج به سال:
Uniform proofs systems have recently been proposed [Mil91] as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is tota...
After introducing double derivations of $n$-Lie algebra $L$ we describe the relationship between the algebra $mathcal D(L)$ of double derivations and the usual derivation Lie algebra $mathcal Der(L)$. In particular, we prove that the inner derivation algebra $ad(L)$ is an ideal of the double derivation algebra $mathcal D(L)$; we also show that if $L$ is a perfect $n$-Lie algebra wit...
let a be a banach algebra and e be a banach a-bimodule then s = a e, the l1-direct sum of a and e becomes a module extension banach algebra when equipped with the algebras product (a; x):(a′; x′) = (aa′; a:x′ + x:a′). in this paper, we investigate △-amenability for these banach algebras and we show that for discrete inverse semigroup s with the set of idempotents es, the module extension bana...
This article discusses a variety of mathematically-inspired approaches to the study of complexity and their application to the study and understanding of complex systems. These approaches have their origin in the study of limitative results in logic, mathematical linguistics, and the theory of computation, based upon the work of Godel, Turing, Chomsky, and Kolmogorov, among many others. The top...
Uniform proofs systems have recently been proposed [Mil91] as a proof-theoretic foundation and generalization of logic programming. In [Mom92a] an extension with constructive negation is presented preserving the nature of abstract logic programming language. Here we adapt this approach to provide a complete theorem proving technique for minimal, intuitionistic and classical logic, which is tota...
The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters.
The Aluffi algebra is an algebraic version of characteristic cycles in intersection theory which is an intermediate graded algebra between the symmetric algebra (naive blowup) and the Rees algebra (blowup). Let R be a commutative Noetherian ring and J ⊂I ideals of R. We say that J ⊂I satisfy linearity condition if the Aluffi algebra of I/J is isomorphic with the symmetric algebra. In this pa...
first we show that the cosets of a fuzzy ideal μ in a bck-algebrax form another bck-algebra x/μ (called the fuzzy quotient bck-algebra of x by μ). also we show thatx/μ is a fuzzy partition of x and we prove several some isomorphism theorems. moreover we prove that if the associated fuzzy similarity relation of a fuzzy partition p of a commutative bck-algebra iscompatible, then p is a fuzzy quo...
We present some connections between the max-min general fuzzy automaton theory and the hyper structure theory. First, we introduce a hyper BCK-algebra induced by a max-min general fuzzy automaton. Then, we study the properties of this hyper BCK-algebra. Particularly, some theorems and results for hyper BCK-algebra are proved. For example, it is shown that this structure consists of different ty...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید