{"id":"https://openalex.org/W2008453494","doi":"https://doi.org/10.1305/ndjfl/1093957392","title":"A rule-completeness theorem.","display_name":"A rule-completeness theorem.","publication_year":1963,"publication_date":"1963-01-01","ids":{"openalex":"https://openalex.org/W2008453494","doi":"https://doi.org/10.1305/ndjfl/1093957392","mag":"2008453494"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093957392","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093957392","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal 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/A5036317806","display_name":"Nuel Belnap","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nuel D. Belnap","raw_affiliation_strings":["Yale University  ;"],"affiliations":[{"raw_affiliation_string":"Yale University  ;","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065972798","display_name":"Richmond H. Thomason","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richmond H. Thomason","raw_affiliation_strings":["Yale University  ;"],"affiliations":[{"raw_affiliation_string":"Yale University  ;","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5036317806"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":1.482,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.82548701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"4","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7164999842643738,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.7164999842643738,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.6793000102043152,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.6653000116348267,"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/completeness","display_name":"Completeness (order theory)","score":0.7005985975265503},{"id":"https://openalex.org/keywords/g\u00f6dels-completeness-theorem","display_name":"G\u00f6del's completeness theorem","score":0.5113208293914795},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47779756784439087},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4630783498287201},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42489057779312134},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.09196281433105469},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08756983280181885}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7005985975265503},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.5113208293914795},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47779756784439087},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4630783498287201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42489057779312134},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.09196281433105469},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08756983280181885},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093957392","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093957392","pdf_url":null,"source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1093957392","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093957392","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2169551167","https://openalex.org/W2369292347","https://openalex.org/W3111972484","https://openalex.org/W1994701759","https://openalex.org/W1588277780","https://openalex.org/W958050847","https://openalex.org/W170300041","https://openalex.org/W4252539554","https://openalex.org/W2144352681","https://openalex.org/W2019382695"],"abstract_inverted_index":{"From":[0],"an":[1],"intuitive":[2,30],"standpoint":[3],"it":[4,62],"would":[5],"seem":[6],"that":[7,94,123],"the":[8,18,41,45,84,124,136,161,201,239],"connectives":[9],"of":[10,36,44,55,70,218,236],"conjunction":[11,110],"and":[12,150,173,177,187,210,224],"disjunction":[13,112],"assume":[14],"in":[15,22,99],"intuitionistic":[16,37,71],"logic":[17,72],"same":[19],"role":[20],"as":[21],"classical":[23,79],"logic.We":[24],"may":[25],"lend":[26],"precision":[27],"to":[28,58,65,132],"these":[29],"ideas":[31],"by":[32,52,82,121,160,222],"considering":[33],"Gentzen's":[34],"formulation":[35,69],"logic,":[38],"which":[39],"separates":[40],"deductive":[42],"roles":[43],"various":[46],"logical":[47],"connectives,":[48],"defining":[49],"each":[50],"connective":[51],"a":[53,59,67,78,130],"pair":[54],"rules":[56,85,101,103,108],"added":[57],"structural":[60,100],"system.Though":[61],"is":[63,127],"possible":[64],"convert":[66],"Gentzen":[68],"(with":[73],"singular":[74],"right":[75],"sides)":[76],"into":[77],"two-valued":[80,138],"system":[81],"altering":[83],"for":[86,109],"negation,":[87],"implication,":[88],"or":[89,107,111],"equivalence,":[90],"Leblanc":[91],"has":[92],"conjectured":[93],"no":[95,105],"classically":[96],"valid":[97],"changes":[98],"(i.e.,":[102],"exhibiting":[104],"connectives)":[106],"can":[113],"have":[114],"this":[115,119],"effect.We":[116],"here":[117],"verify":[118],"conjecture":[120],"showing":[122],"conjunction-disjunction":[125],"fragment":[126],"\"rule-complete\"":[128],"(in":[129],"sense":[131],"be":[133],"specified)":[134],"under":[135],"ordinary":[137],"interpretation.Notation.Let":[139],"q":[140,142,164,166],"\u03af9":[141],"i7":[143],".":[144,145,154,169,170,195,196],".range":[146,197],"over":[147,198,213,231],"propositional":[148],"variables,":[149],"A,":[151],"B,":[152],"A^":[153],"..over":[155],"well-formed":[156,219],"formulas":[157,220],"(wffs)":[158],"defined":[159],"conditions":[162],"(i)":[163],"l9":[165],"2":[167,229],",":[168],".are":[171],"well-formed,":[172,180],"(ii)":[174],"if":[175],"A":[176,185,204],"B":[178],"are":[179,183],"then":[181],"so":[182],"(A":[184,188],"\u03b2)":[186],"v":[189],"B).Let":[190],"S":[191,193],"y":[192],"lf":[194],"statements":[199,237],"having":[200,238],"form":[202,240],"(I)":[203],"u":[205],"...,A":[206],"n":[207],"\\-B.Let":[208],"O\u03af":[209],"\u03b2":[211],"range":[212,230],"finite":[214,232],"(possibly":[215,233],"null)":[216,234],"sequences":[217,235],"separated":[221],"commas,":[223],"let":[225],"\u03a3,":[226],"\u03a3i,":[227],"\u03a3":[228],"(I).":[241]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}