<https://kar.kent.ac.uk/id/document/1940812>	<http://purl.org/dc/terms/hasPart>	<https://kar.kent.ac.uk/67460/1/cyclicTC-CSL.pdf> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://purl.org/dc/terms/hasPart>	<https://kar.kent.ac.uk/67460/1/cyclicTC-CSL.pdf_nocoversheet> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://creativecommons.org/ns#license>	<http://creativecommons.org/licenses/by/3.0/> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://purl.org/ontology/bibo/Document> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://www.w3.org/2000/01/rdf-schema#label>	"Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (PDF)"^^<http://www.w3.org/2001/XMLSchema#string> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://www.w3.org/2007/05/powder-s#describedby>	<https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://www.w3.org/2007/05/powder-s#describedby>	<https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://eprints.org/ontology/hasFile>	<https://kar.kent.ac.uk/67460/1/cyclicTC-CSL.pdf_nocoversheet> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://www.w3.org/1999/02/22-rdf-syntax-ns#type>	<http://eprints.org/ontology/Document> .
<https://kar.kent.ac.uk/id/document/1940812>	<http://eprints.org/ontology/hasFile>	<https://kar.kent.ac.uk/67460/1/cyclicTC-CSL.pdf> .