{"id":"https://openalex.org/W1975754030","doi":"https://doi.org/10.1145/1328438.1328455","title":"The intensional content of Rice's theorem","display_name":"The intensional content of Rice's theorem","publication_year":2008,"publication_date":"2008-01-07","ids":{"openalex":"https://openalex.org/W1975754030","doi":"https://doi.org/10.1145/1328438.1328455","mag":"1975754030"},"language":"en","primary_location":{"id":"doi:10.1145/1328438.1328455","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"conference-paper","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/A5032765727","display_name":"Andrea Asperti","orcid":"https://orcid.org/0000-0002-9677-6350"},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Andrea Asperti","raw_affiliation_strings":["University of Bologna, Bologna, Italy","University of Bologna , Bologna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bologna, Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]},{"raw_affiliation_string":"University of Bologna , Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5032765727"],"corresponding_institution_ids":["https://openalex.org/I9360294"],"apc_list":null,"apc_paid":null,"fwci":0.8571,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.68244301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9980999827384949,"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/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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/decidability","display_name":"Decidability","score":0.7770810127258301},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6048243045806885},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.543205738067627},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5411685109138489},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5265735983848572},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.5237208008766174},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4832364022731781},{"id":"https://openalex.org/keywords/argument","display_name":"Argument (complex analysis)","score":0.4621037244796753},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41960686445236206},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41577330231666565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3343886137008667},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30130642652511597},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18603599071502686}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7770810127258301},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6048243045806885},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.543205738067627},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5411685109138489},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5265735983848572},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5237208008766174},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4832364022731781},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.4621037244796753},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41960686445236206},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41577330231666565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3343886137008667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30130642652511597},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18603599071502686},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1328438.1328455","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1328438.1328455","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.6421","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.6421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unibo.it/~asperti/PAPERS/popl.pdf","raw_type":"text"},{"id":"pmh:oai:cris.unibo.it:11585/61097","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/61097","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1488494826","https://openalex.org/W1496947201","https://openalex.org/W1551612278","https://openalex.org/W1555412307","https://openalex.org/W1583968748","https://openalex.org/W1801500381","https://openalex.org/W1966090989","https://openalex.org/W1973392890","https://openalex.org/W2015666295","https://openalex.org/W2021141490","https://openalex.org/W2034112179","https://openalex.org/W2043382625","https://openalex.org/W2044539289","https://openalex.org/W2047764386","https://openalex.org/W2073812497","https://openalex.org/W2077694941","https://openalex.org/W2089442854","https://openalex.org/W2100563078","https://openalex.org/W2109174418","https://openalex.org/W2117832390","https://openalex.org/W2125407741","https://openalex.org/W2125495920","https://openalex.org/W2131389166","https://openalex.org/W2133538984","https://openalex.org/W2161331421","https://openalex.org/W2337267853","https://openalex.org/W2484534360","https://openalex.org/W2595178415","https://openalex.org/W4239241440","https://openalex.org/W4245581594","https://openalex.org/W4250366902","https://openalex.org/W4256442140"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W4394650907","https://openalex.org/W2331020993","https://openalex.org/W4383764068","https://openalex.org/W154364797","https://openalex.org/W4254119641","https://openalex.org/W1481826604","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076"],"abstract_inverted_index":{"The":[0],"proofs":[1],"of":[2,5,18,37,47,50,52,57,59,115,141,144],"major":[3],"results":[4],"Computability":[6],"Theory":[7],"like":[8],"Rice,":[9],"Rice-Shapiro":[10,100,125],"or":[11],"Kleene's":[12,145],"fixed":[13],"point":[14],"theorem":[15],"hidemore":[16],"information":[17,29],"what":[19],"is":[20,86,93,119,130],"usually":[21],"expressed":[22],"in":[23],"theirrespective":[24],"statements.":[25],"We":[26,74,134],"make":[27],"this":[28],"explicit,":[30],"allowing":[31],"to":[32,106,110,123,126],"state":[33],"stronger,":[34],"complexity":[35,71,79,118],"theoretic-versions":[36],"all":[38],"these":[39],"theorems.":[40],"In":[41],"particular,":[42],"we":[43],"replace":[44],"the":[45,64,113,136],"notion":[46],"extensional":[48,66,95],"set":[49,56,96],"indices":[51,58],"programs,":[53],"by":[54],"a":[55,139],"programs":[60],"having":[61,116],"not":[62,120,131],"only":[63],"same":[65],"behavior":[67],"but":[68],"also":[69],"similar":[70],"(Complexity":[72],"Clique).":[73],"prove,":[75],"under":[76],"very":[77],"weak":[78],"assumptions,":[80],"that":[81,112,128],"any":[82,89],"recursive":[83],"Complexity":[84,91],"Clique":[85,92],"trivial,":[87],"and":[88,122],"r.e.":[90],"an":[94],"(and":[97],"thus":[98],"satisfies":[99],"conditions).":[101],"This":[102],"allows,":[103],"for":[104],"instance,":[105],"use":[107,124],"Rice's":[108],"argument":[109],"prove":[111],"property":[114],"polynomial":[117],"decidable,":[121],"conclude":[127,135],"it":[129],"even":[132],"semi-decidable.":[133],"paper":[137],"with":[138],"discussion":[140],"\"complexity-theoretic\"":[142],"versions":[143],"Fixed":[146],"Point":[147],"Theorem.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}