This HTML5 document contains 158 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://dbpedia.org/resource/Wiktionary:
n6https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n12http://www.tac.mta.ca/tac/reprints/articles/5/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Boolean_algebras_canonically_defined
rdfs:label
Boolean algebras canonically defined
rdfs:comment
Boolean algebra is a mathematically rich branch of abstract algebra. Stanford Encyclopaedia of Philosophy defines Boolean algebra as 'the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation.' Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the equational theory of the two values 0 and 1 (whose interpretation need not be numerical). Common to Boolean algebras, groups, and vector spaces is the notion of an algebraic structure, a set closed under some operations satisfying certain equations.
dcterms:subject
dbc:Boolean_algebra
dbo:wikiPageID
6318542
dbo:wikiPageRevisionID
1122219374
dbo:wikiPageWikiLink
dbr:Arity dbr:Functional_completeness dbr:Clopen_set dbr:Boolean_ring dbr:Index_set dbr:Algebra_of_sets dbr:Digital_electronics dbr:Finitary_boolean_function dbr:Equational_theory dbr:Interpretation_(model_theory) dbr:List_of_Boolean_algebra_topics dbr:Digital_circuit dbr:Cantor's_diagonal_argument dbr:Addition dbr:Permutation dbr:Charles_Sanders_Peirce dbr:Uncountable dbr:First-order_logic dbr:Finitary dbr:Mathematical_logic dbr:Intersection_(set_theory) dbr:Two's_complement dbr:Sigma-algebra dbr:Lindenbaum–Tarski_algebra dbr:Associative dbr:Emil_Post n9:zeroary dbr:George_Boole dbr:Topological_space dbr:Free_Boolean_algebra dbr:Representation_(mathematics) dbr:Join_(mathematics) dbr:Complemented_lattice dbr:Nonstandard_analysis dbr:Direct_product dbr:Binary_digit dbr:Infimum dbr:Variety_(universal_algebra) dbr:Complement_(order_theory) dbr:Totally_disconnected_space dbr:Multiplication dbr:Decidability_(logic) dbr:Abstract_algebra dbr:Meet_(mathematics) dbr:Alan_Turing dbr:Propositional_calculus dbr:Algebraic_structure dbr:Strict_function dbr:Ideal_(order_theory) dbr:Universal_algebra dbr:Partially_ordered_set dbr:Binary_operation dbr:Iff dbr:Symmetric_group dbr:Closed_monoidal_category dbr:Linear_algebra dbr:Sheffer_stroke dbr:Set_(mathematics) dbr:Complete_Boolean_algebra dbr:Axiomatization dbr:Mathematical_Association_of_America dbr:Syntax dbr:Isomorphic dbr:Foundations_of_mathematics dbr:Set_theory dbr:De_Morgan's_laws dbr:Bit_vector dbr:Filter_(mathematics) dbr:Marshall_Stone dbr:Operation_(mathematics) dbr:Atom_(order_theory) dbr:Paul_Halmos dbr:Ultrafilter dbr:Switching_function dbr:Compact_Hausdorff_space dbr:Distributive_lattice dbr:Commutative dbr:Algorithm dbr:Filtered_colimit dbr:Homomorphism dbr:Georg_Cantor dbr:Topos dbr:Lattice_(order) dbr:Ivan_Ivanovich_Zhegalkin dbr:Vector_space dbr:Hausdorff_space dbr:Isomorphism dbr:Median_operator dbr:Alfred_Tarski dbr:Gödel_number dbr:Stone_space dbr:Profinite_set dbr:Alfred_W._Hales dbr:Boolean-valued_function dbr:Boolean_logic dbr:Free_object dbr:Monoidal_category dbr:Boolean-valued_model dbr:Zhegalkin_polynomial dbr:Generator_(mathematics) dbr:Supremum dbr:Affine_transformation dbr:Integer dbr:Unary_operation dbr:Compact_space dbr:Axiomatic_system dbr:Boolean_domain dbr:Truth_value dbr:Model_(model_theory) dbr:Discrete_space dbr:Boolean_algebra dbr:Complement_(set_theory) dbr:Boolean_algebra_(structure) dbr:Boolean_algebras_canonically_defined dbr:Countably_infinite dbr:Truth_table dbr:Category_(mathematics) dbr:Gate_array dbr:Boolean_function dbr:Group_theory dbr:Robbins_algebra dbr:Digital_logic dbr:Satisfiability dbr:Monotonic_function dbr:Undergraduate_Texts_in_Mathematics dbc:Boolean_algebra dbr:Union_(set_theory) dbr:Cardinality dbr:Group_(mathematics) dbr:Subalgebra dbr:Order_(group_theory) dbr:Axiom_schema dbr:Indexed_family dbr:Birkhoff's_HSP_theorem dbr:Power_set dbr:Field_of_sets dbr:Post's_class dbr:Cartesian_closed_category
dbo:wikiPageExternalLink
n12:tr5abs.html
owl:sameAs
wikidata:Q4943350 n6:4aSEN freebase:m.0g0s_3
dbp:wikiPageUsesTemplate
dbt:Div_col dbt:Div_col_end dbt:Math dbt:Cite_book dbt:Cite_journal dbt:Reflist dbt:ISBN
dbo:abstract
Boolean algebra is a mathematically rich branch of abstract algebra. Stanford Encyclopaedia of Philosophy defines Boolean algebra as 'the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation.' Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the equational theory of the two values 0 and 1 (whose interpretation need not be numerical). Common to Boolean algebras, groups, and vector spaces is the notion of an algebraic structure, a set closed under some operations satisfying certain equations. Just as there are basic examples of groups, such as the group of integers and the symmetric group Sn of permutations of n objects, there are also basic examples of Boolean algebras such as the following. * The algebra of binary digits or bits 0 and 1 under the logical operations including disjunction, conjunction, and negation. Applications include the propositional calculus and the theory of digital circuits. * The algebra of sets under the set operations including union, intersection, and complement. Applications are far-reaching because set theory is the standard foundations of mathematics. Boolean algebra thus permits applying the methods of abstract algebra to mathematical logic and digital logic. Unlike groups of finite order, which exhibit complexity and diversity and whose first-order theory is decidable only in special cases, all finite Boolean algebras share the same theorems and have a decidable first-order theory. Instead, the intricacies of Boolean algebra are divided between the structure of infinite algebras and the algorithmic complexity of their syntactic structure.
prov:wasDerivedFrom
wikipedia-en:Boolean_algebras_canonically_defined?oldid=1122219374&ns=0
dbo:wikiPageLength
65777
foaf:isPrimaryTopicOf
wikipedia-en:Boolean_algebras_canonically_defined