{"id":"https://openalex.org/W1995181842","doi":"https://doi.org/10.1305/ndjfl/1093890999","title":"Combinatorial systems with axiom.","display_name":"Combinatorial systems with axiom.","publication_year":1973,"publication_date":"1973-07-01","ids":{"openalex":"https://openalex.org/W1995181842","doi":"https://doi.org/10.1305/ndjfl/1093890999","mag":"1995181842"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093890999","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093890999","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/Combinatorial-systems-with-axiom/10.1305/ndjfl/1093890999.pdf","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":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/Combinatorial-systems-with-axiom/10.1305/ndjfl/1093890999.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050861892","display_name":"Charles E. Hughes","orcid":"https://orcid.org/0000-0002-2528-3380"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C. E. Hughes","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039650554","display_name":"W. E. Singletary","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. E. Singletary","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050861892"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7488,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.90557313,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9972000122070312,"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/axiom-of-choice","display_name":"Axiom of choice","score":0.6747281551361084},{"id":"https://openalex.org/keywords/zermelo\u2013fraenkel-set-theory","display_name":"Zermelo\u2013Fraenkel set theory","score":0.648444414138794},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.5679918527603149},{"id":"https://openalex.org/keywords/urelement","display_name":"Urelement","score":0.5390197038650513},{"id":"https://openalex.org/keywords/axiom-independence","display_name":"Axiom independence","score":0.5334432721138},{"id":"https://openalex.org/keywords/constructive-set-theory","display_name":"Constructive set theory","score":0.52730393409729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49624305963516235},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.41289931535720825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3231310248374939},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.301764577627182},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.1140633225440979},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10043230652809143},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05887991189956665},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.04679781198501587}],"concepts":[{"id":"https://openalex.org/C151797676","wikidata":"https://www.wikidata.org/wiki/Q179692","display_name":"Axiom of choice","level":4,"score":0.6747281551361084},{"id":"https://openalex.org/C51460","wikidata":"https://www.wikidata.org/wiki/Q191849","display_name":"Zermelo\u2013Fraenkel set theory","level":5,"score":0.648444414138794},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.5679918527603149},{"id":"https://openalex.org/C78550038","wikidata":"https://www.wikidata.org/wiki/Q1896657","display_name":"Urelement","level":5,"score":0.5390197038650513},{"id":"https://openalex.org/C170088968","wikidata":"https://www.wikidata.org/wiki/Q4830547","display_name":"Axiom independence","level":3,"score":0.5334432721138},{"id":"https://openalex.org/C556429856","wikidata":"https://www.wikidata.org/wiki/Q5164501","display_name":"Constructive set theory","level":5,"score":0.52730393409729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49624305963516235},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.41289931535720825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3231310248374939},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.301764577627182},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.1140633225440979},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10043230652809143},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05887991189956665},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.04679781198501587}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093890999","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093890999","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/Combinatorial-systems-with-axiom/10.1305/ndjfl/1093890999.pdf","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/1093890999","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093890999","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":{"id":"doi:10.1305/ndjfl/1093890999","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093890999","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-14/issue-3/Combinatorial-systems-with-axiom/10.1305/ndjfl/1093890999.pdf","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"},"sustainable_development_goals":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G5363789830","display_name":null,"funder_award_id":"GP-23779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1995181842.pdf","grobid_xml":"https://content.openalex.org/works/W1995181842.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1992652529","https://openalex.org/W2004459113","https://openalex.org/W2019222694","https://openalex.org/W2092354571","https://openalex.org/W2331518422","https://openalex.org/W6648393293","https://openalex.org/W6651692382"],"related_works":["https://openalex.org/W288388583","https://openalex.org/W1995120876","https://openalex.org/W2350176099","https://openalex.org/W2796622564","https://openalex.org/W2980408391","https://openalex.org/W4233243512","https://openalex.org/W4251650946","https://openalex.org/W1987027468","https://openalex.org/W2892204474","https://openalex.org/W579532077"],"abstract_inverted_index":{"Introduction:*":[0],"The":[1,202],"purpose":[2],"of":[3,17,30,73,90,136,169,174,186,190,197,216,223,250,252,292,307],"this":[4,99],"paper":[5],"is":[6,86,102,234,240,246,266,284,303,336],"to":[7,104,181,199,205,268,278],"investigate":[8],"the":[9,27,31,38,47,57,187,191,221,253],"general":[10,32,39,48,58,92,192,224],"decision":[11,40,49,59,193,226],"problems":[12,93,140,194],"associated":[13,141],"with":[14,20,45,54,65,69,96,142],"a":[15,70,178,235,241,247,255,259,270,274,283,318,333],"number":[16],"combinatorial":[18,225],"systems":[19,44,53,64,95,124,128,144],"axiom.":[21,66,97],"In":[22,160],"particular,":[23,161],"we":[24,299],"shall":[25],"show":[26],"many-one":[28,82],"equivalence":[29,189,222],"halting":[33],"problem":[34,41,50,60],"for":[35,42,51,61,94,114,258],"Turing":[36],"machines,":[37],"Thue":[43,123,271],"axiom,":[46,55],"semi-Thue":[52,231],"and":[56,125,158,172,213,244,260,326,332],"Post":[62,126,132],"normal":[63,127],"This,":[67],"combined":[68,167],"recent":[71],"result":[72,101],"Overbeek":[74],"[5],":[75],"shows":[76],"that":[77,109,301],"every":[78,115],"recursively":[79],"enumerable":[80],"(r.e.)":[81,188],"degree":[83],"(of":[84],"unsolvability)":[85],"represented":[87],"by":[88,131,148],"each":[89],"these":[91,143],"Finally,":[98],"latter":[100],"proven":[103,207],"be":[105,206,269],"best":[106],"possible":[107],"in":[108,176,211,286,309],"it":[110],"does":[111],"not":[112],"hold":[113],"r.e.":[116],"one-one":[117],"degree.":[118],"Historical":[119],"Background:":[120],"Semi-Thue":[121],"systems,":[122],"were":[129,209],"defined":[130],"as":[133,180],"proper":[134],"subsets":[135],"canonical":[137],"forms.":[138],"Decision":[139],"have":[145],"been":[146],"studied":[147],"various":[149],"authors,":[150],"e.g.,":[151],"[l],":[152],"[2],":[153],"[3],":[154],"[4],":[155],"[6],":[156],"[7],":[157],"[8].":[159],"W.":[162],"E.":[163],"Singletary":[164],"[7]":[165],"has":[166],"results":[168,204],"his":[170],"own":[171],"those":[173],"others":[175],"such":[177],"way":[179],"provide":[182],"an":[183,217,304],"effective":[184],"proof":[185],"which":[195],"are":[196,328],"concern":[198],"us":[200],"here.":[201],"stronger":[203],"here":[208],"announced":[210],"[4]":[212],"form":[214,254],"part":[215],"extensive":[218],"study":[219],"into":[220],"problems.":[227],"Preliminary":[228],"Definitions:":[229],"A":[230],"system":[232,272],"T":[233,265],"pair":[236,291],"(\u03a3,R)":[237],"where":[238],"\u03a3":[239],"finite":[242,248],"alphabet":[243],"R":[245,279],"set":[249],"productions":[251],"\u2014\u00bb":[256],"\u03b2,":[257],"\u03b2":[261,276,281,323,335],"words":[262,293,329],"over":[263,297,330],"\u03a3.":[264],"said":[267],"if":[273,314],"-*":[275],"belongs":[277],"implies":[280],"\u2014>":[282],"also":[285],"R.":[287],"For":[288],"any":[289],"arbitrary":[290],"W,":[294],"W":[295,308,315,320],"r":[296],"\u03a3,":[298,331],"say":[300],"Wr":[302],"immediate":[305],"successor":[306],"T,":[310],"denoted":[311],"T(W,":[312],"W)":[313],"=":[316,321],"P":[317,322,325],"Q,":[319,324],"Q":[327],"\u2014":[334],"inR.":[337]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}