{"id":"https://openalex.org/W1991484357","doi":"https://doi.org/10.1305/ndjfl/1093635747","title":"Bounds in weak truth-table reducibility.","display_name":"Bounds in weak truth-table reducibility.","publication_year":1991,"publication_date":"1991-03-01","ids":{"openalex":"https://openalex.org/W1991484357","doi":"https://doi.org/10.1305/ndjfl/1093635747","mag":"1991484357"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093635747","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635747","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-32/issue-2/Bounds-in-weak-truth-table-reducibility/10.1305/ndjfl/1093635747.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-32/issue-2/Bounds-in-weak-truth-table-reducibility/10.1305/ndjfl/1093635747.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018534391","display_name":"Karol Habart","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Karol Habart","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5018534391"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9697,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7795539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"32","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9803000092506409,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9803000092506409,"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/T10237","display_name":"Cryptography and Data Security","score":0.9776999950408936,"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/T11719","display_name":"Data Quality and Management","score":0.9760000109672546,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/table","display_name":"Table (database)","score":0.5691778659820557},{"id":"https://openalex.org/keywords/truth-table","display_name":"Truth table","score":0.5619419813156128},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46368923783302307},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.3702812194824219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3482610583305359},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.3479141592979431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23857131600379944},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.1487438976764679}],"concepts":[{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.5691778659820557},{"id":"https://openalex.org/C56949724","wikidata":"https://www.wikidata.org/wiki/Q219079","display_name":"Truth table","level":2,"score":0.5619419813156128},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46368923783302307},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.3702812194824219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3482610583305359},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.3479141592979431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23857131600379944},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.1487438976764679}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093635747","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635747","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-32/issue-2/Bounds-in-weak-truth-table-reducibility/10.1305/ndjfl/1093635747.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/1093635747","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093635747","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/1093635747","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635747","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-32/issue-2/Bounds-in-weak-truth-table-reducibility/10.1305/ndjfl/1093635747.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.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1991484357.pdf","grobid_xml":"https://content.openalex.org/works/W1991484357.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W2024373817","https://openalex.org/W2530006810","https://openalex.org/W2905135108","https://openalex.org/W4232277851"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W4200363804","https://openalex.org/W2105693220","https://openalex.org/W2119476919"],"abstract_inverted_index":{"A":[0,53,149,158,236,253,261,382],"necessary":[1,183,219],"and":[2,32,36,74,167,184,192,206,274,327,352,361],"sufficient":[3,185],"condition":[4,220],"on":[5,203,207,285,392],"a":[6,70,132,154,163,218,249,258,270,309,339,367,371,375],"recursive":[7,28,71,139,180],"function":[8,21,72],"is":[9,30,49,56,69,104,141,153,224,262,319,335],"given":[10,247,263],"so":[11],"that":[12,151,157],"arbitrary":[13],"sets":[14],"can":[15,245],"be":[16,246,277],"truth-table":[17,42],"reduced":[18,255],"via":[19,162],"this":[20,129,389],"as":[22,51],"the":[23,81,95,106,109,118,126,135,146,204,208,211,227,230,233,251,267,281,286,289,293,303,323,329,332,349,362,394],"bound.A":[24],"corresponding":[25],"hierarchy":[26,111,133,212,297],"of":[27,80,94,108,112,114,134,138,148,210,229,238,260,269,272,288,295,298,305,307,311,322,331,357,388],"functions":[29],"introduced":[31],"some":[33,354],"partial":[34],"results":[35],"an":[37,75,239,345],"open":[38],"problem":[39],"are":[40],"formulated.Weak":[41],"reducibility,":[43,48],"often":[44],"called":[45,105],"bounded":[46],"Turing":[47,254],"defined":[50],"follows:":[52],"<\u039e":[54],"\u03c9":[55,62,115,177,197,343],"weak-truth-table":[57],"reducible":[58],"to":[59,89,226,256,266],"B":[60,155,161,244,341],"Q":[61],"(A":[63],"<":[64,120,159,383],"wtt":[65,121,160,384],"B)":[66],"if":[67],"there":[68,152],"/":[73,201],"algorithm":[76],"which":[77,264,275],"answers":[78,88],"questions":[79,91],"form":[82,96],"\"\u00ab":[83],"E":[84,98],"A\u038a\"":[85],"when":[86],"supplied":[87],"any":[90],"it":[92],"asks":[93],"\"ra":[97],"B\u038a\"":[99],"for":[100,178,188,193,200,292],"m":[101],"</(fl).The":[102],"function/":[103],"bound":[107,228,287],"reduction.The":[110],"subsets":[113],"induced":[116,213],"by":[117,144,214,232,248,314,338,370],"relation":[119],"was":[122],"extensively":[123],"studied":[124],"in":[125,320,344],"past":[127],"(cf.[1]).In":[128],"paper,":[130],"however,":[131],"bounds":[136,299],"(i.e.":[137],"functions)":[140],"considered.We":[142],"denote":[143],"S(/)":[145,172,189,194],"set":[147,243,252,340,372],"such":[150,156],"reduction":[164,390],"with":[165],"bound/,":[166],"we":[168,379],"write":[169],"/<g":[170],"iff":[171],"cS(g),":[173],"Of":[174],"course,":[175],"(RcS(/)c2":[176],"all":[179,356],"functions/.We":[181],"give":[182,217],"conditions":[186],"on/":[187],"=":[190,195],"(R":[191],"2":[196],",":[198],"i.e.":[199],"being":[202],"bottom":[205],"top":[209],"<.We":[215],"also":[216,301],"for/<":[221],"g.Our":[222],"interest":[223],"focused":[225],"wtt-reduction":[231],"following":[234],"phenomenon:":[235],"part":[237,259,271],"(in":[240],"general)":[241],"nonrecursive":[242],"list.Having":[250],"B,":[257,273],"corresponds":[265],"list":[268,282],"may":[276,359,364],"much":[278],"larger":[279],"than":[280],"itselfdepending":[283],"mainly":[284],"reduction.A":[290],"motivation":[291],"study":[294],"our":[296],"comes":[300],"from":[302],"theory":[304],"nets":[306],"automata.Consider":[308],"chain":[310],"automata":[312,350],"numbered":[313],"natural":[315],"numbers.Suppose":[316],"each":[317],"automaton":[318],"one":[321],"two":[324],"states":[325],"0":[326],"1.Then":[328],"state":[330,368],"whole":[333],"net":[334,363,378],"uniquely":[336],"determined":[337,369],"c":[342],"obvious":[346],"way.Now":[347],"let":[348],"work,":[351],"after":[353],"time":[355],"them":[358],"stop":[360],"come":[365],"into":[366],"A.":[373],"In":[374],"fairly":[376],"devised":[377],"would":[380],"have":[381],"B.":[385],"The":[386],"bound/":[387],"depends":[391],"how":[393]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}