{"id":"https://openalex.org/W1970753511","doi":"https://doi.org/10.1305/ndjfl/1093637938","title":"Infima of recursively enumerable truth table degrees.","display_name":"Infima of recursively enumerable truth table degrees.","publication_year":1988,"publication_date":"1988-06-01","ids":{"openalex":"https://openalex.org/W1970753511","doi":"https://doi.org/10.1305/ndjfl/1093637938","mag":"1970753511"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093637938","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093637938","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/A5015766241","display_name":"Peter A. Fejer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter A. Fejer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041739806","display_name":"Richard A. Shore","orcid":"https://orcid.org/0000-0003-0381-5259"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard A. Shore","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.0835108,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","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":1.0,"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":1.0,"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.9933000206947327,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.8907886743545532},{"id":"https://openalex.org/keywords/recursively-enumerable-language","display_name":"Recursively enumerable language","score":0.659522294998169},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.5191009044647217},{"id":"https://openalex.org/keywords/maximal-set","display_name":"Maximal set","score":0.5078762173652649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4314045310020447},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4019904136657715},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.20981749892234802},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.07808884978294373}],"concepts":[{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.8907886743545532},{"id":"https://openalex.org/C203702658","wikidata":"https://www.wikidata.org/wiki/Q1073063","display_name":"Recursively enumerable language","level":2,"score":0.659522294998169},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.5191009044647217},{"id":"https://openalex.org/C188521023","wikidata":"https://www.wikidata.org/wiki/Q6795644","display_name":"Maximal set","level":3,"score":0.5078762173652649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4314045310020447},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4019904136657715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.20981749892234802},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.07808884978294373},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093637938","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093637938","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/1093637938","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093637938","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":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5099999904632568}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W243218583","https://openalex.org/W2006726677","https://openalex.org/W2026091787","https://openalex.org/W2051601785","https://openalex.org/W2056414301","https://openalex.org/W2075451552","https://openalex.org/W2088993859","https://openalex.org/W2213438832","https://openalex.org/W2530006810","https://openalex.org/W4232277851","https://openalex.org/W4240602437","https://openalex.org/W4246936007"],"related_works":["https://openalex.org/W2089792255","https://openalex.org/W2037833610","https://openalex.org/W2135152748","https://openalex.org/W2113378332","https://openalex.org/W1977420633","https://openalex.org/W2069987267","https://openalex.org/W2097898753","https://openalex.org/W2011410600","https://openalex.org/W2036737307","https://openalex.org/W4249312125"],"abstract_inverted_index":{"Etude":[0],"des":[1,3],"infima":[2],"degres":[4],"de":[5,7],"tables":[6],"verite":[8],"recursivement":[9],"enumerables.":[10],"Reponse":[11],"par":[12],"la":[13,20],"negative":[14],"a":[15],"une":[16],"question":[17],"d'Odifreddi":[18],"sur":[19],"reductibilite":[21]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}