Results 201 to 210 of about 650,064 (276)
Reasoning with the inverse of 3D cardinal direction relations based on direction matrices. [PDF]
Sci RepWang M +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Research Methods in the Social Sciences: An A-Z of key concepts, 2021
This chapter addresses Boolean algebra, which is based on Boolean logic. In the social sciences, Boolean algebra comes under different labels. It is often used in set-theoretic and qualitative comparative analysis to assess complex causation that leads ...
J. Hasić
semanticscholar +1 more source
This chapter addresses Boolean algebra, which is based on Boolean logic. In the social sciences, Boolean algebra comes under different labels. It is often used in set-theoretic and qualitative comparative analysis to assess complex causation that leads ...
J. Hasić
semanticscholar +1 more source
Disturbance decoupling control design for Boolean control networks: a Boolean algebra approach
IET Control Theory & Applications, 2020The disturbance decoupling problem (DDP) whereby the system outputs become insensitive to exogenous signals or disturbances plays a vital role in systems engineering and biological systems.
K. Sarda, A. Yerudkar, C. D. Vecchio
semanticscholar +1 more source
IEEE Transactions on Computers, 1980
Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory ...
Leinwand, S., Lamdan, T.
openaire +1 more source
Switching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory ...
Leinwand, S., Lamdan, T.
openaire +1 more source
Acta Mathematica Sinica, English Series, 2004
Let \(X\) be a Banach space. The classical Orlicz-Pettis theorem says that weak subseries convergence already implies subseries convergence. The authors use the term \(P(\mathbb N)\) is \(X\)-weakly summing to express that the conclusion of the Orlicz-Pettis theorem holds in \(X\) when subseries corresponding to all subsets of \(\mathbb N\) are ...
Aizpuru, Antonio +1 more
openaire +2 more sources
Let \(X\) be a Banach space. The classical Orlicz-Pettis theorem says that weak subseries convergence already implies subseries convergence. The authors use the term \(P(\mathbb N)\) is \(X\)-weakly summing to express that the conclusion of the Orlicz-Pettis theorem holds in \(X\) when subseries corresponding to all subsets of \(\mathbb N\) are ...
Aizpuru, Antonio +1 more
openaire +2 more sources
Algebraic partial Boolean algebras
Journal of Physics A: Mathematical and General, 2003Partial Boolean algebras are algebraic in this paper in the sense that their elements have coordinates in an algebraic number field. Within this context the author shows that every algebraic finitely-generated partial Boolean algebra is finite when the underlying space is three-dimensional.
openaire +2 more sources
Mathematics of the USSR-Sbornik, 1973
The paper contains the construction of a general theory of Boolean-valued algebras: There are introduced the notions of a homeomorphism, congruence, subalgebra and direct product. It is shown that these algebras possess properties that are totally analogous to the properties of two-valued algebras.
openaire +2 more sources
The paper contains the construction of a general theory of Boolean-valued algebras: There are introduced the notions of a homeomorphism, congruence, subalgebra and direct product. It is shown that these algebras possess properties that are totally analogous to the properties of two-valued algebras.
openaire +2 more sources
2018
Boolean algebra, or the algebra of logic, was devised by the English mathematician George Boole (1815–64) and embodies the first successful application of algebraic methods to logic. Boole seems to have had several interpretations for his system in mind.
Sergei Kurgalin, Sergei Borzunov
+4 more sources
Boolean algebra, or the algebra of logic, was devised by the English mathematician George Boole (1815–64) and embodies the first successful application of algebraic methods to logic. Boole seems to have had several interpretations for his system in mind.
Sergei Kurgalin, Sergei Borzunov
+4 more sources
Canadian Journal of Mathematics, 1971
A Boolean algebra B is a retract of an algebra A if there exist homomorphisms ƒ: B → A and g: A → B such that gƒ is the identity map B. Some important properties of retracts of Boolean algebras are stated in [3, §§ 30, 31, 32]. If A and B are a-complete, and A is α-generated by B, Dwinger [1, p.
openaire +1 more source
A Boolean algebra B is a retract of an algebra A if there exist homomorphisms ƒ: B → A and g: A → B such that gƒ is the identity map B. Some important properties of retracts of Boolean algebras are stated in [3, §§ 30, 31, 32]. If A and B are a-complete, and A is α-generated by B, Dwinger [1, p.
openaire +1 more source