{"id":"https://openalex.org/W1985742359","doi":"https://doi.org/10.1305/ndjfl/1093894637","title":"Non-recursiveness of the set of finite sets of equations whose theories are one-based.","display_name":"Non-recursiveness of the set of finite sets of equations whose theories are one-based.","publication_year":1972,"publication_date":"1972-01-01","ids":{"openalex":"https://openalex.org/W1985742359","doi":"https://doi.org/10.1305/ndjfl/1093894637","mag":"1985742359"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093894637","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093894637","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-13/issue-1/Non-recursiveness-of-the-set-of-finite-sets-of-equations/10.1305/ndjfl/1093894637.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-13/issue-1/Non-recursiveness-of-the-set-of-finite-sets-of-equations/10.1305/ndjfl/1093894637.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101072423","display_name":"Douglas D. Smith","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Douglas D. Smith","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5101072423"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.20943613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14320","display_name":"Optics and Image Analysis","score":0.531499981880188,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T14320","display_name":"Optics and Image Analysis","score":0.531499981880188,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13935","display_name":"Mathematical Control Systems and Analysis","score":0.5202999711036682,"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/T14420","display_name":"Advanced Research in Systems and Signal Processing","score":0.5169000029563904,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6215397715568542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5268185138702393},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.5166761875152588},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.41874799132347107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35355156660079956},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3499778211116791},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.32881224155426025},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3200087547302246},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.24919649958610535},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15116345882415771},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.060417890548706055},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.04277855157852173}],"concepts":[{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6215397715568542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5268185138702393},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.5166761875152588},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.41874799132347107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35355156660079956},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3499778211116791},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.32881224155426025},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3200087547302246},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.24919649958610535},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15116345882415771},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.060417890548706055},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.04277855157852173},{"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/1093894637","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093894637","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-13/issue-1/Non-recursiveness-of-the-set-of-finite-sets-of-equations/10.1305/ndjfl/1093894637.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/1093894637","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093894637","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/1093894637","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093894637","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-13/issue-1/Non-recursiveness-of-the-set-of-finite-sets-of-equations/10.1305/ndjfl/1093894637.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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4000000059604645}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1985742359.pdf","grobid_xml":"https://content.openalex.org/works/W1985742359.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1575371065","https://openalex.org/W2070471622","https://openalex.org/W2078252586","https://openalex.org/W6668338772"],"related_works":["https://openalex.org/W372882296","https://openalex.org/W2378801550","https://openalex.org/W2141075946","https://openalex.org/W4360891774","https://openalex.org/W1983767262","https://openalex.org/W1967096152","https://openalex.org/W2323914380","https://openalex.org/W3102517575","https://openalex.org/W4206905038","https://openalex.org/W2553290232"],"abstract_inverted_index":{"Among":[0],"the":[1,30,35,45,52,55,86,92,107,119,130,176,241],"decision":[2],"problems":[3],"for":[4,29,124,171],"finite":[5,153,182,206],"sets":[6,154],"of":[7,19,34,49,59,69,100,109,127,133,152,155,179,184,208],"equations":[8,70,87,128,156,185],"listed":[9],"by":[10,23,72,95,106],"A.":[11],"Tarski":[12],"[1]":[13],"are":[14,160],"six":[15],"related":[16],"problems,":[17],"five":[18],"which":[20,80,266],"were":[21],"solved":[22],"Peter":[24],"Perkins":[25,73],"[2],":[26],"The":[27],"solution":[28],"one":[31,137,161,195,222],"equation":[32,144],"case":[33],"remaining":[36],"problem":[37,53,58],"S":[38,215],"3":[39],",":[40,203,245],"given":[41],"below,":[42],"follows":[43],"closely":[44],"method":[46,170],"(and":[47],"notation)":[48],"Perkins,":[50],"reducing":[51],"to":[54,83],"(unsolvable)":[56],"word":[57,213,229],"a":[60,64,67,76,125,142,205,209,231,237,248,263],"semigroup,":[61],"but":[62],"making":[63],"modification":[65],"in":[66,186,230,240],"set":[68,126,151,183],"used":[71],"and":[74,191,232],"introducing":[75],"transformation":[77],"on":[78,113],"terms":[79],"allows":[81],"us":[82],"show":[84],"that":[85,147,260],"do":[88],"not":[89,164,175],"\"mix\"":[90],"(in":[91],"sense":[93],"indicated":[94],"our":[96,252],"lemma":[97],"below).This":[98],"property":[99],"\"not":[101],"mixing'":[102],"9":[103],"was":[104,254],"suggested":[105],"work":[108],"W.":[110],"E.":[111],"Singletary":[112],"partial":[114],"propositional":[115],"calculi":[116],"[3].We":[117],"assume":[118],"basic":[120],"notions":[121],"from":[122,265],"[1].Thus,":[123],"E,":[129,134],"equational":[131,158,177,219],"theory":[132,178],"Th(E),":[135],"is":[136,163,167,194],"based":[138,162],"iff":[139],"there":[140,166],"exists":[141],"single":[143],"e":[145],"such":[146],"Th(^)":[148],"=":[149,200],"Th(E).Theorem*.The":[150],"whose":[157],"theories":[159],"recursive.Specifically,":[165],"no":[168],"effective":[169],"determining":[172],"whether":[173],"or":[174],"an":[180,218],"arbitrary":[181],"two":[187,192],"binary":[188,223],"operation":[189,224],"symbols":[190],"constants":[193],"based.Proof:":[196],"Let":[197],"\u03b2;{a,b;":[198],"U{":[199],"7":[201],"t":[202],"l^z^wjbe":[204],"presentation":[207],"semigroup":[210],"with":[211],"unsolvable":[212],"problem.Let":[214],"+":[216,244],"denote":[217],"language":[220,242],"having":[221],"+.To":[225],"each":[226],"\u03b2-word":[227],"(i.e.,":[228],"b)":[233],"we":[234],"make":[235],"correspond":[236],"term":[238],"\u038asl{x,y)":[239],"\u00a3":[243],"as":[246],"follows:*In":[247],"letter":[249],"received":[250],"after":[251],"proof":[253],"completed,":[255],"George":[256],"F.":[257],"McNulty":[258],"indicates":[259],"he":[261],"has":[262],"result":[264],"ours":[267],"follows.":[268]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}