{"id":"https://openalex.org/W2143817362","doi":"https://doi.org/10.1017/s1755020315000088","title":"CUT FOR CLASSICAL CORE LOGIC","display_name":"CUT FOR CLASSICAL CORE LOGIC","publication_year":2015,"publication_date":"2015-03-20","ids":{"openalex":"https://openalex.org/W2143817362","doi":"https://doi.org/10.1017/s1755020315000088","mag":"2143817362"},"language":"en","primary_location":{"id":"doi:10.1017/s1755020315000088","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020315000088","pdf_url":null,"source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051746616","display_name":"Neil Tennant","orcid":"https://orcid.org/0000-0002-3523-2296"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"NEIL TENNANT","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051746616"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4536,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.8966983,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":"2","first_page":"236","last_page":"256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9948999881744385,"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"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9948999881744385,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9919000267982483,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9829999804496765,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sequent","display_name":"Sequent","score":0.8837513327598572},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.7206640243530273},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.6486700177192688},{"id":"https://openalex.org/keywords/constructive-proof","display_name":"Constructive proof","score":0.6363832950592041},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"Sequent calculus","score":0.6067560315132141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5642806887626648},{"id":"https://openalex.org/keywords/cut-elimination-theorem","display_name":"Cut-elimination theorem","score":0.555346667766571},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.49477046728134155},{"id":"https://openalex.org/keywords/intuitionistic-logic","display_name":"Intuitionistic logic","score":0.484292209148407},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.46352913975715637},{"id":"https://openalex.org/keywords/natural-deduction","display_name":"Natural deduction","score":0.4422400891780853},{"id":"https://openalex.org/keywords/paraconsistent-logic","display_name":"Paraconsistent logic","score":0.4203142523765564},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4104726314544678},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4099140465259552},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.407673716545105},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.34699344635009766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33596184849739075},{"id":"https://openalex.org/keywords/proof-calculus","display_name":"Proof calculus","score":0.23182782530784607},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.23094162344932556},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2038460075855255},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.18330508470535278},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.14300119876861572},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.12633299827575684},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07244670391082764}],"concepts":[{"id":"https://openalex.org/C89421646","wikidata":"https://www.wikidata.org/wiki/Q843632","display_name":"Sequent","level":2,"score":0.8837513327598572},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.7206640243530273},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.6486700177192688},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.6363832950592041},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.6067560315132141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5642806887626648},{"id":"https://openalex.org/C111404639","wikidata":"https://www.wikidata.org/wiki/Q376166","display_name":"Cut-elimination theorem","level":4,"score":0.555346667766571},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.49477046728134155},{"id":"https://openalex.org/C178421362","wikidata":"https://www.wikidata.org/wiki/Q176786","display_name":"Intuitionistic logic","level":3,"score":0.484292209148407},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.46352913975715637},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.4422400891780853},{"id":"https://openalex.org/C16796852","wikidata":"https://www.wikidata.org/wiki/Q426592","display_name":"Paraconsistent logic","level":4,"score":0.4203142523765564},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4104726314544678},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4099140465259552},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.407673716545105},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.34699344635009766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33596184849739075},{"id":"https://openalex.org/C6489637","wikidata":"https://www.wikidata.org/wiki/Q7250002","display_name":"Proof calculus","level":3,"score":0.23182782530784607},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.23094162344932556},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2038460075855255},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.18330508470535278},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.14300119876861572},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.12633299827575684},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07244670391082764},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1755020315000088","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1755020315000088","pdf_url":null,"source":{"id":"https://openalex.org/S24077076","display_name":"The Review of Symbolic Logic","issn_l":"1755-0203","issn":["1755-0203","1755-0211"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Review of Symbolic Logic","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1482532876","https://openalex.org/W1488538795","https://openalex.org/W1593617641","https://openalex.org/W1985662836","https://openalex.org/W1986532158","https://openalex.org/W2039977878","https://openalex.org/W2082822474","https://openalex.org/W2125185604","https://openalex.org/W2328394552"],"related_works":["https://openalex.org/W2584381231","https://openalex.org/W1562648369","https://openalex.org/W4295728898","https://openalex.org/W4289719533","https://openalex.org/W2562634993","https://openalex.org/W3112266304","https://openalex.org/W3090765541","https://openalex.org/W4253113110","https://openalex.org/W2504661205","https://openalex.org/W2560336053"],"abstract_inverted_index":{"Abstract":[0],"In":[1,97,135,168],"an":[2,174],"earlier":[3],"paper":[4,137],"in":[5,106,112],"this":[6,136],"journal":[7],"I":[8],"provided":[9],"detailed":[10],"motivation":[11],"for":[12,43,146],"the":[13,37,57,69,88,98,101,107,110,163,169,181],"constructive":[14,99],"and":[15,26,45,63,124,195],"relevant":[16],"system":[17],"of":[18,36,56,68,84,87,118,162,165,177,190],"Core":[19,148,154],"Logic":[20,155],";":[21],"explained":[22],"its":[23],"main":[24],"features;":[25],"established":[27,140],"that,":[28],"even":[29,126],"though":[30],"Cut":[31,40,142],"is":[32,41,53,65,78,139,143,151,173],"not":[33],"a":[34,54,66,79,115,158,187],"rule":[35,164],"system,":[38],"nevertheless":[39],"admissible":[42,145],"it,":[44],"indeed":[46,125],"with":[47],"potential":[48,102,178],"epistemic":[49,103,179],"gain.":[50],"If":[51],"\u03a0":[52,194],"proof":[55,67,182],"sequent":[58,70],"\u0394":[59],":":[60,73,94,121,132],"A":[61,72],",":[62,75,123],"\u03a3":[64],"\u0413,":[71],"\u03b8":[74,95,122,133],"then":[76],"there":[77,172],"computable":[80],"reduct":[81],"[\u03a0,":[82,183],"\u03a3]":[83,184],"some":[85],"subsequent":[86,111,117],"\u2018overall":[89],"target":[90],"sequent\u2019":[91],"\u0394,":[92,119,130],"\u0413":[93,120,131],".":[96,134],"case":[100,171],"gain":[104],"consists":[105],"possibility":[108],"that":[109,141],"question":[113],"be":[114],"proper":[116],"logically":[127],"stronger":[128],"than":[129,192],"it":[138],"likewise":[144],"Classical":[147,166],"Logic,":[149],"which":[150],"obtained":[152],"from":[153],"by":[156],"adding":[157],"suitably":[159],"relevantized":[160],"form":[161],"Dilemma.":[167],"classical":[170],"additional":[175],"feature":[176],"gain:":[180],"might":[185],"have":[186],"lower":[188],"degree":[189],"non-constructivity":[191],"do":[193],"\u03a3.":[196]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}