@prefix owl:	<http://www.w3.org/2002/07/owl#> .
@prefix dbpedia:	<http://dbpedia.org/resource/> .
dbpedia:Cyclic_negation	owl:sameAs	<http://rdf.freebase.com/ns/guid.9202a8c04000641f80000000047967c1> .
@prefix foaf:	<http://xmlns.com/foaf/0.1/> .
@prefix ns3:	<http://en.wikipedia.org/wiki/> .
dbpedia:Cyclic_negation	foaf:page	ns3:Cyclic_negation .
@prefix rdfs:	<http://www.w3.org/2000/01/rdf-schema#> .
dbpedia:Cyclic_negation	rdfs:label	"Cyclic negation"@en .
@prefix dbpprop:	<http://dbpedia.org/property/> .
dbpedia:Cyclic_negation	dbpprop:abstract	"In logic, cyclic negation is (assuming that the truth values are linearly ordered) a unary truth function that takes a truth value n and returns n-1 as value if n isn't the lowest value; otherwise it returns the highest value. For example, let (i) the set of truth values be {0,1,2}, (ii) '~' denote negation, and (iii) p be a variable over truth values (i.e. whose range is truth values). Thus if p=0 then ~p=2; and if p=1 then ~p=0. It was originally introduced by the logician and mathematician Emil Post."@en ;
	rdfs:comment	"In logic, cyclic negation is (assuming that the truth values are linearly ordered) a unary truth function that takes a truth value n and returns n-1 as value if n isn't the lowest value; otherwise it returns the highest value. For example, let (i) the set of truth values be {0,1,2}, (ii) '~' denote negation, and (iii) p be a variable over truth values (i.e. whose range is truth values). Thus if p=0 then ~p=2; and if p=1 then ~p=0."@en .
@prefix skos:	<http://www.w3.org/2004/02/skos/core#> .
@prefix ns7:	<http://dbpedia.org/resource/Category:> .
dbpedia:Cyclic_negation	skos:subject	ns7:Mathematical_logic ,
		<http://dbpedia.org/resource/Category:Articles_lacking_sources_%28Erik9bot%29> ,
		ns7:Logic .
@prefix ns8:	<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/> .
dbpedia:Cyclic_negation	dbpprop:hasPhotoCollection	ns8:Cyclic_negation .