{"id":"https://openalex.org/W1965871469","doi":"https://doi.org/10.1305/ndjfl/1093883514","title":"A property which guarantees termination in weak combinatory logic and subtree replacement systems.","display_name":"A property which guarantees termination in weak combinatory logic and subtree replacement systems.","publication_year":1981,"publication_date":"1981-10-01","ids":{"openalex":"https://openalex.org/W1965871469","doi":"https://doi.org/10.1305/ndjfl/1093883514","mag":"1965871469"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093883514","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883514","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/A5018873219","display_name":"Alberto Pettorossi","orcid":"https://orcid.org/0000-0001-7858-4032"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alberto Pettorossi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018873219"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1877,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.42082119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"4","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9574000239372253,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9574000239372253,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9369999766349792,"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.92330002784729,"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/property","display_name":"Property (philosophy)","score":0.7254661321640015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4659745395183563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45979544520378113},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3493846654891968},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3371485471725464},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.22978559136390686},{"id":"https://openalex.org/keywords/epistemology","display_name":"Epistemology","score":0.1236298680305481}],"concepts":[{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.7254661321640015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4659745395183563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45979544520378113},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3493846654891968},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3371485471725464},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.22978559136390686},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.1236298680305481}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093883514","is_oa":false,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093883514","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/1093883514","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093883514","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1547038616"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":{"It":[0],"is":[1,24,131],"well-known":[2],"that":[3,95,121],"recursive":[4],"equations":[5,23,78],"may":[6,79],"be":[7,44,80],"conveniently":[8],"used":[9],"for":[10,20,85,136],"defining":[11],"functions":[12,53],"and":[13,54,68,93,123],"specifying":[14],"their":[15,69],"computations.A":[16],"particular":[17],"syntactic":[18],"system":[19],"writing":[21],"such":[22,141],"Weak":[25],"Combinatory":[26],"Logic.Such":[27],"logical":[28],"formalism,":[29],"even":[30],"if":[31],"not":[32],"particularly":[33],"appealing":[34],"to":[35,49,57,63],"computer":[36],"scientists":[37],"because":[38],"of":[39,66,100,103,127,140],"its":[40],"syntactical":[41],"characteristics,":[42],"could":[43],"useful":[45],"when":[46],"we":[47,119],"want":[48],"consider":[50],"also":[51],"untyped":[52],"would":[55],"like":[56],"avoid":[58],"the":[59,64,97,101,104,111,125,138],"extra":[60],"problems":[61],"due":[62],"presence":[65],"variables":[67],"bindings,":[70],"as":[71,82],"in":[72,94],"type-free":[73],"X-calculus":[74],"[":[75],"1":[76],"].Those":[77],"considered":[81],"production":[83],"rules":[84],"deriving":[86],"\"simpler\"":[87],"terms":[88],"from":[89],"more":[90],"complex":[91],"ones,":[92],"case":[96],"crucial":[98],"problem":[99,122],"existence":[102,139],"\"normal":[105],"form\"":[106],"arises:":[107],"does":[108],"there":[109],"exist":[110],"\"simplest\"":[112],"derivable":[113],"term?Is":[114],"it":[115],"unique?In":[116],"this":[117],"paper":[118],"study":[120],"give":[124],"definition":[126],"a":[128],"property":[129],"which":[130],"sufficient,":[132],"under":[133],"some":[134],"hypotheses,":[135],"assuring":[137]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}