اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBoolean Algebras and Logic
179
0
0.0
(
0
)
تأليف
Cheng Hao
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we investigate the notion and basic properties of Boolean algebras and prove the Stones representation theorem. The relations of Boolean algebras to logic and to set theory will be studied and, in particular, a neat proof of completeness theorem in propositional logic will be given using Stones theorem from Boolean algebra.
قيم البحث
اقرأ أيضاً
The article is a study of two algebraic structures, the `contrapositionally complemented pseudo-Boolean algebra (ccpBa) and `contrapositionally $vee$ complemented pseudo-Boolean algebra (c$vee$cpBa). The algebras have recently been obtained from a to
pos-theoretic study of categories of rough sets. The salient feature of these algebras is that there are two negations, one intuitionistic and another minimal in nature, along with a condition connecting the two operators. We study properties of these algebras, give examples, and compare them with relevant existing algebras. `Intuitionistic Logic with Minimal Negation (ILM) corresponding to ccpBas and its extension ILM-${vee}$ for c$vee$cpBas, are then investigated. Besides its relations with intuitionistic and minimal logics, ILM is observed to be related to Peirces logic. With a focus on properties of the two negations, two kinds of relational semantics for ILM and ILM-${vee}$ are obtained, and an inter-translation between the two semantics is provided. Extracting features of the two negations in the algebras, a further investigation is made, following logical studies of negations that define the operators independently of the binary operator of implication. Using Dunns logical framework for the purpose, two logics $K_{im}$ and $K_{im-{vee}}$ are presented, where the language does not include implication. $K_{im}$-algebras are reducts of ccpBas. The negations in the algebras are shown to occupy distinct positions in an enhanced form of Dunns Kite of negations. Relational semantics for $K_{im}$ and $K_{im-{vee}}$ are given, based on Dunns compatibility frames. Finally, relationships are established between the different algebraic and relational semantics for the logics defined in the work.
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The construction and
certain properties of BTAs are investigated via their matrix expression, including the homomorphism and isomorphism, etc. Then the product/decomposition of BTLs are considered. A necessary and sufficient condition for decomposition of BTA is obtained. Finally, a universal generator is provided for arbitrary finite universal algebras.
We present a new approach to ternary Boolean algebras in which negation is derived from the ternary operation. The key aspect is the replacement of complete commutativity by other axioms that do not require the ternary operation to be symmetric.
Let 2<nleq l<m< omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded semantics, and f
or its packed n--variable fragments. Both are modal fragments of L_n. As a sample, we show that if there exists a finite relation algebra with a so--called strong l--blur, and no m--dimensional relational basis, then there exists a countable, atomic and complete L_n theory T and type Gamma, such that Gamma is realizable in every so--called m--square model of T, but any witness isolating Gamma cannot use less than $l$ variables. An $m$--square model M of T gives a form of clique guarded semantics, where the parameter m, measures how locally well behaved M is. Every ordinary model is k--square for any n<k<omega, but the converse is not true. Any model M is omega--square, and the two notions are equivalent if M is countable. Such relation algebras are shown to exist for certain values of l and m like for nleq l<omega and m=omega, and for l=n and mgeq n+3. The case l=n and m=omega gives that the omitting types theorem fails for L_n with respect to (usual) Tarskian semantics: There is an atomic countable L_n theory T for which the single non--principal type consisting of co--atoms cannot be omitted in any model M of T. For n<omega, positive results on omitting types are obained for L_n by imposing extra conditions on the theories and/or the types omitted. Positive and negative results on omitting types are obtained for infinitary variants and extensions of L_{omega, omega}.
Recent advances in manipulating single electron spins in quantum dots have brought us close to the realization of classical logic gates based on representing binary bits in spin polarizations of single electrons. Here, we show that a linear array of
three quantum dots, each containing a single spin polarized electron, and with nearest neighbor exchange coupling, acts as the universal NAND gate. The energy dissipated during switching this gate is the Landauer-Shannon limit of kTln(1/p) [T = ambient temperature and p = intrinsic gate error probability]. With present day technology, p = 1E-9 is achievable above 1 K temperature. Even with this small intrinsic error probability, the energy dissipated during switching the NAND gate is only ~ 21 kT, while todays nanoscale transistors dissipate about 40,000 - 50,000 kT when they switch.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
