Eksempler på brug af Boolean algebra på Engelsk og deres oversættelser til Dansk
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Official/political
-
Computer
And John von Neumann took Boolean algebra and created the digital computer.
Og John von Neumann tog boolsk algebra og skabte den digitale computer.The analysis software of the flow cytometer(e.g., BD CELLQuest)allows for the use of Boolean algebra.
Analysen software af flowcytometer(f. eks BD CELLQuest)tillader anvendelse af boolsk algebra.Boolean algebra has wide applications in telephone switching and the design of modern computers.
Boolesk algebra har vide anvendelsesmuligheder på telefon opkobling og projektering af moderne computere.In recognition of his distinguished contributions to combinatory topology, Boolean algebras and mathematical logic.
I anerkendelse af hans fremtrædende bidrag til combinatory topologi, Boolean algebraer og matematisk logik.Boolean algebra is a logic based analysis method that allows for multiple operations in a single definition.
Boolsk algebra er en logik baseret analysemetode, der giver mulighed for flere operationer i en enkelt definition.Algebraic languages are common in computing: Boolean algebra for logic gates; and Relational algebra for database DML.
Algebraiske sprog er almindelige i computing: Boolean algebra for logiske gates; og relationelle Boolean In 1953 showed that the variety generated by a primal algebra has the same essential structure as the variety of Boolean algebras.
I 1953 viste, at sorten er genereret af en oprindelig algebra har samme væsentlige struktur som den vifte af Boolesk algebraer.He continued his work showing how Boolean algebra could be used to synthesise and simplify relay switching circuits.
Han fortsatte sit arbejde viser, hvordan Boolesk algebra kan bruges til at syntetisere og forenkle relæet skifter kredsløb.Shannon's spark of genius came in 1940 at MIT,when he noticed a relationship between Boolean algebra and telephone switching circuits.
Shannon's geniale ide kom i 1940 vedMIT[Massachusset Institute of Technology], da han bemærkede forholdet mellem Boolean algebra og telefoncentralbordene.In 1922:… he used Boolean algebra to characterise the topology of an abstract space independently of the notion of points.
I 1922:… han har brugt Boolesk algebra til at beskrive de topologi af en abstrakt rum uafhængigt af begrebet punkter.Apr 18 in Educational& Science Software, Math Software Windows read more Karnaugh Minimizer 2.0 updated Boolean algebra assistant.
Apr 18 I Uddannelsesmæssige og videnskab software, Matematik software Windows Læs mere Karnaugh Minimizer 2.0 Opdateret Boolean Algebra assistent program er et interaktivt program meget let at bruge.However through a natural interest in Boolean algebra and Boolean rings, he moved more towards an interest in algebraic structures.
Men gennem en naturlig interesse i Boolesk algebra og Her inclination towards algebra was never completely forgotten andshe always seemed to draw results concerning Boolean algebras from her results about infinitary languages.
Hendes hældning i retning algebra blev aldrig helt glemt, oghun altid syntes at trække resultater vedrørende Boolesk algebraer fra hendes resultater om infinitary sprog.It began the algebra of logic called Boolean algebra which now finds application in computer construction, switching circuits etc.
Det begyndte den He was later(1958)to receive the Sylvester medal from the Royal Society:… in recognition of his distinguished contributions to combinatory topology, Boolean algebras and mathematical logic.
Han blev senere(1958)at modtage Sylvester medalje fra Royal Society:… i anerkendelse af hans fremtrædende bidrag til combinatory topologi, Boolean algebraer og matematisk logik.George Boole took Leibniz's binary code and created Boolean algebra, and John von Neumann took Boolean algebra and created the digital computer.
George Boole tog Leibniz' binære kode og skabte boolsk algebra,-- og John von Neumann tog boolsk algebra og skabte den digitale computer.Aleksandrov and Urysohn had made a conjecture in 1923 concerning necessary and sufficient conditions for a Hausdorff space to be compact andthis was not proved until 1935 when M H Stone gave an exceedingly complicated proof using representation theory of Boolean algebras.
Aleksandrov og Urysohn havde gjort en formodninger i 1923 om de nødvendige og tilstrækkelige betingelser for et Hausdorff plads tilat være kompakt og det var ikke bevist indtil 1935, når MH Stone gav en ekstremt kompliceret bevis vha. repræsentation teori om Boolesk algebraer.Foster went on to define the concept of a primal algebra generalising a Boolean algebra within the theory of varieties of universal algebras. .
Foster fortsatte med at definere begrebet en oprindelig It began the algebra of logic called Boolean algebra which now finds application in computer construction, switching circuits etc. Boole himself understood the importance of the work.
Det begyndte den Foster, as a student of Church, naturally began his research career working in mathematical logic.However through a natural interest in Boolean algebra and Boolean rings, he moved more towards an interest in algebraic structures.
Foster, som studerende i kirken, naturligvis begyndte sin forskerkarriere arbejder i matematisk logik. Mengennem en naturlig interesse i Boolesk algebra og Then in 1934 he published two papers on Boolean algebras: Boolean algebras andtheir applications to topology and Subsumption of Boolean algebras under the theory of rings.
Så i 1934, han udgivet to papirer om He continued devoting his efforts to the structure theory of algebras that are generalizations of Boolean algebras and, more than ten years down the line in 1966, he published Families of algebras with unique(sub-)direct factorization.
Han fortsatte med at afsætte sine bestræbelser på at strukturen teori om The construction of a set of structure invariants for certain classes of Boolean algebras, the characterisation of the lattice of congruence relations of a lattice, the imbedding of finite lattices in finite partition lattices, the word problem for free modular lattices, and a construction of a dimension theory for continuous, non-complemented, modular lattices, have an intrinsic interest independent of the problems associated with other algebraic systems.
Opførelse af et sæt af struktur invariants for visse klasser af Boolesk algebraer, karakterisering af gitter af kongruens forbindelser af et gitter, imbedding finite lattices i finite partition lattices, ordet problem for fri modulære lattices, og en opførelse af et dimension teori for kontinuerlig, ikke-suppleret, modulære lattices, har en iboende interesse uafhængig af de problemer, der er forbundet med andre algebraiske systemer.He continued devoting his efforts to the structure theory of algebras that are generalizations of Boolean algebras and, more than ten years down the line in 1966, he published Families of algebras with unique(sub-)direct factorization. Equational characterization of factorization in Mathematische Annalen.
Han fortsatte med at afsætte sine bestræbelser på at strukturen teori om 
