{"id":"https://openalex.org/W2751381847","doi":"https://doi.org/10.1007/978-3-319-66902-1_18","title":"Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent","display_name":"Realizability in Cyclic Proof: Extracting Ordering Information for Infinite Descent","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2751381847","doi":"https://doi.org/10.1007/978-3-319-66902-1_18","mag":"2751381847"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-66902-1_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66902-1_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kar.kent.ac.uk/62287/1/Realizability%20in%20Cyclic%20Proof.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056648657","display_name":"Reuben N. S. Rowe","orcid":"https://orcid.org/0000-0002-4271-9078"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Reuben N. S. Rowe","raw_affiliation_strings":["School of Computing, University of Kent, Canterbury, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, University of Kent, Canterbury, UK","institution_ids":["https://openalex.org/I20581793"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025368137","display_name":"J G. Brotherston","orcid":"https://orcid.org/0000-0002-7536-4496"},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"James Brotherston","raw_affiliation_strings":["Department of Computer Science, University College London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, UK","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5056648657"],"corresponding_institution_ids":["https://openalex.org/I20581793"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.1388,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.42333682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/realizability","display_name":"Realizability","score":0.9181979894638062},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7535978555679321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7158815860748291},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6105834245681763},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.5025100708007812},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4698715806007385},{"id":"https://openalex.org/keywords/logical-consequence","display_name":"Logical consequence","score":0.46040475368499756},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.44139036536216736},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.4225988984107971},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4205491542816162},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.41034942865371704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2877480983734131},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23484471440315247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1005709171295166}],"concepts":[{"id":"https://openalex.org/C2776378722","wikidata":"https://www.wikidata.org/wiki/Q3454417","display_name":"Realizability","level":2,"score":0.9181979894638062},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7535978555679321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7158815860748291},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6105834245681763},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.5025100708007812},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4698715806007385},{"id":"https://openalex.org/C134752490","wikidata":"https://www.wikidata.org/wiki/Q374182","display_name":"Logical consequence","level":2,"score":0.46040475368499756},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.44139036536216736},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.4225988984107971},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4205491542816162},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.41034942865371704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2877480983734131},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23484471440315247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1005709171295166},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-66902-1_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66902-1_18","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:kar.kent.ac.uk:62287","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-66902-1_18>)","pdf_url":"https://kar.kent.ac.uk/62287/1/Realizability%20in%20Cyclic%20Proof.pdf","source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference proceeding"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:10058848","is_oa":false,"landing_page_url":"https://discovery.ucl.ac.uk/id/eprint/10058848/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: Schmidt, RA and Nalon, C, (eds.) Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2017). (pp. pp. 295-310). Springer: Cham, Switzerland. (2017)","raw_type":"Proceedings paper"}],"best_oa_location":{"id":"pmh:oai:kar.kent.ac.uk:62287","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-319-66902-1_18>)","pdf_url":"https://kar.kent.ac.uk/62287/1/Realizability%20in%20Cyclic%20Proof.pdf","source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference proceeding"},"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G3795326585","display_name":null,"funder_award_id":"EP/K040049/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G731138035","display_name":null,"funder_award_id":"EP/N028759/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7369439297","display_name":"Boosting Automated Verification Using Cyclic Proof","funder_award_id":"EP/K040049/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8523113323","display_name":"Trustworthy refactoring","funder_award_id":"EP/N028759/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2751381847.pdf","grobid_xml":"https://content.openalex.org/works/W2751381847.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1196275239","https://openalex.org/W1497067119","https://openalex.org/W1556837122","https://openalex.org/W1643571618","https://openalex.org/W1835836356","https://openalex.org/W1969587526","https://openalex.org/W1969682671","https://openalex.org/W1974265510","https://openalex.org/W1983496086","https://openalex.org/W1993129359","https://openalex.org/W1999823887","https://openalex.org/W2072102045","https://openalex.org/W2083342911","https://openalex.org/W2112648200","https://openalex.org/W2123056643","https://openalex.org/W2136242294","https://openalex.org/W2137628566","https://openalex.org/W2564359929","https://openalex.org/W2594396803","https://openalex.org/W2735988056","https://openalex.org/W4233310630","https://openalex.org/W4243994983","https://openalex.org/W6871734986"],"related_works":["https://openalex.org/W1603488308","https://openalex.org/W4298120007","https://openalex.org/W2136737082","https://openalex.org/W2321910655","https://openalex.org/W3173554384","https://openalex.org/W1511249877","https://openalex.org/W3158407919","https://openalex.org/W2926764908","https://openalex.org/W2284629830","https://openalex.org/W2084080545"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-25T07:29:55.448023","created_date":"2025-10-10T00:00:00"}