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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n13http://www.cs.haifa.ac.il/~golumbic/courses/algorithmic-graph-theory/slides_and_notes_of_lectures/Lecture%207%20-%20Cographs%20and%20their%20Applications/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://mi.mathnet.ru/eng/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_Boolean_algebra_topics
dbo:wikiPageWikiLink
dbr:Read-once_function
Subject Item
dbr:Cograph
dbo:wikiPageWikiLink
dbr:Read-once_function
Subject Item
dbr:Boolean_function
dbo:wikiPageWikiLink
dbr:Read-once_function
Subject Item
dbr:Read-once_function
rdfs:label
Read-once function
rdfs:comment
In mathematics, a read-once function is a special type of Boolean function that can be described by a Boolean expression in which each variable appears only once. More precisely, the expression is required to use only the operations of logical conjunction, logical disjunction, and negation. By applying De Morgan's laws, such an expression can be transformed into one in which negation is used only on individual variables (still with each variable appearing only once). By replacing each negated variable with a new positive variable representing its negation, such a function can be transformed into an equivalent positive read-once Boolean function, represented by a read-once expression without negations.
dct:subject
dbc:Boolean_algebra
dbo:wikiPageID
50568483
dbo:wikiPageRevisionID
1089153594
dbo:wikiPageWikiLink
dbr:Triangle_graph dbr:Logical_conjunction dbr:Monotonic_function dbr:Conjunctive_normal_form dbr:Maximal_clique dbr:Disjunctive_normal_form dbr:Negation dbc:Boolean_algebra dbr:Polynomial_time dbr:Variable_(mathematics) dbr:Cograph dbr:Truth_assignment dbr:Lowest_common_ancestor dbr:Theoretical_Computer_Science_(journal) dbr:Journal_of_the_ACM dbr:Logical_disjunction dbr:Boolean_expression dbr:Boolean_function dbr:Discrete_Applied_Mathematics dbr:De_Morgan's_laws dbr:Discrete_Mathematics_(journal) dbr:Russian_Mathematical_Surveys dbr:Median_algebra
dbo:wikiPageExternalLink
n13:readonce-chapter-final.pdf n15:umn3055
owl:sameAs
wikidata:Q25305410 n14:2Nmxm
dbp:wikiPageUsesTemplate
dbt:Mvar dbt:Citation dbt:Reflist dbt:Refend dbt:Refbegin
dbo:abstract
In mathematics, a read-once function is a special type of Boolean function that can be described by a Boolean expression in which each variable appears only once. More precisely, the expression is required to use only the operations of logical conjunction, logical disjunction, and negation. By applying De Morgan's laws, such an expression can be transformed into one in which negation is used only on individual variables (still with each variable appearing only once). By replacing each negated variable with a new positive variable representing its negation, such a function can be transformed into an equivalent positive read-once Boolean function, represented by a read-once expression without negations.
prov:wasDerivedFrom
wikipedia-en:Read-once_function?oldid=1089153594&ns=0
dbo:wikiPageLength
7944
foaf:isPrimaryTopicOf
wikipedia-en:Read-once_function
Subject Item
wikipedia-en:Read-once_function
foaf:primaryTopic
dbr:Read-once_function