{"id":"https://openalex.org/W2026822390","doi":"https://doi.org/10.1305/ndjfl/1093635081","title":"Combinators and categorial grammar.","display_name":"Combinators and categorial grammar.","publication_year":1989,"publication_date":"1989-03-01","ids":{"openalex":"https://openalex.org/W2026822390","doi":"https://doi.org/10.1305/ndjfl/1093635081","mag":"2026822390"},"language":"en","primary_location":{"id":"doi:10.1305/ndjfl/1093635081","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635081","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-30/issue-2/Combinators-and-categorial-grammar/10.1305/ndjfl/1093635081.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-30/issue-2/Combinators-and-categorial-grammar/10.1305/ndjfl/1093635081.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113434575","display_name":"Peter C. Simons","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Simons","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113434575"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.13104341,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9063000082969666,"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"}},"topics":[{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9063000082969666,"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/combinatory-categorial-grammar","display_name":"Combinatory categorial grammar","score":0.8863199949264526},{"id":"https://openalex.org/keywords/categorial-grammar","display_name":"Categorial grammar","score":0.8648205995559692},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.8487238883972168},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.5846632719039917},{"id":"https://openalex.org/keywords/grammar","display_name":"Grammar","score":0.544268012046814},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5013206005096436},{"id":"https://openalex.org/keywords/head-driven-phrase-structure-grammar","display_name":"Head-driven phrase structure grammar","score":0.48938101530075073},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4692138731479645},{"id":"https://openalex.org/keywords/mildly-context-sensitive-grammar-formalism","display_name":"Mildly context-sensitive grammar formalism","score":0.45055416226387024},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.4103369414806366},{"id":"https://openalex.org/keywords/link-grammar","display_name":"Link grammar","score":0.3923802971839905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36261844635009766},{"id":"https://openalex.org/keywords/emergent-grammar","display_name":"Emergent grammar","score":0.21782362461090088},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.1598547101020813}],"concepts":[{"id":"https://openalex.org/C199837984","wikidata":"https://www.wikidata.org/wiki/Q730974","display_name":"Combinatory categorial grammar","level":5,"score":0.8863199949264526},{"id":"https://openalex.org/C840598","wikidata":"https://www.wikidata.org/wiki/Q1841499","display_name":"Categorial grammar","level":5,"score":0.8648205995559692},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.8487238883972168},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.5846632719039917},{"id":"https://openalex.org/C26022165","wikidata":"https://www.wikidata.org/wiki/Q8091","display_name":"Grammar","level":2,"score":0.544268012046814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5013206005096436},{"id":"https://openalex.org/C152862876","wikidata":"https://www.wikidata.org/wiki/Q379294","display_name":"Head-driven phrase structure grammar","level":3,"score":0.48938101530075073},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4692138731479645},{"id":"https://openalex.org/C172265290","wikidata":"https://www.wikidata.org/wiki/Q6134957","display_name":"Mildly context-sensitive grammar formalism","level":4,"score":0.45055416226387024},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.4103369414806366},{"id":"https://openalex.org/C957247","wikidata":"https://www.wikidata.org/wiki/Q6554304","display_name":"Link grammar","level":4,"score":0.3923802971839905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36261844635009766},{"id":"https://openalex.org/C69298649","wikidata":"https://www.wikidata.org/wiki/Q6045214","display_name":"Emergent grammar","level":3,"score":0.21782362461090088},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.1598547101020813}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1305/ndjfl/1093635081","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635081","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-30/issue-2/Combinators-and-categorial-grammar/10.1305/ndjfl/1093635081.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/1093635081","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1093635081","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/1093635081","is_oa":true,"landing_page_url":"https://doi.org/10.1305/ndjfl/1093635081","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-30/issue-2/Combinators-and-categorial-grammar/10.1305/ndjfl/1093635081.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":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2026822390.pdf","grobid_xml":"https://content.openalex.org/works/W2026822390.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W159082583","https://openalex.org/W188634130","https://openalex.org/W1519554123","https://openalex.org/W2036123678","https://openalex.org/W4231112046","https://openalex.org/W4234418851","https://openalex.org/W6602843012","https://openalex.org/W6641980167","https://openalex.org/W6646761804","https://openalex.org/W7007857410"],"related_works":["https://openalex.org/W2088427555","https://openalex.org/W4298724019","https://openalex.org/W2951015845","https://openalex.org/W2106016549","https://openalex.org/W1543466370","https://openalex.org/W2023948222","https://openalex.org/W2765620307","https://openalex.org/W334317705","https://openalex.org/W2059808570","https://openalex.org/W4309532040"],"abstract_inverted_index":{"From":[0],"Ajdukiewicz":[1],"onwards":[2],"categorial":[3],"grammar":[4],"has":[5],"failed":[6],"to":[7,44,76,101],"characterize":[8],"adequately":[9],"the":[10,17,36,109,112,115],"twin":[11],"roles":[12],"of":[13,61,97,111,117],"variable-binding":[14],"operators":[15],"and":[16,30,55,69,108],"variables":[18,47,79],"they":[19,72],"bind.":[20],"Categorial":[21],"grammars":[22],"are,":[23],"however,":[24],"adequate":[25],"for":[26,114],"languages":[27,49,85,118],"using":[28],"combinators":[29,37,68,103],"dispensing":[31],"with":[32,94,119],"bound":[33,46,78],"variables,":[34],"but":[35,90],"used":[38,75],"hitherto":[39],"have":[40],"been":[41],"insufficiently":[42],"flexible":[43,121],"eliminate":[45,77],"from":[48,80],"which":[50],"allow":[51],"both":[52],"higher-order":[53],"quantification":[54],"multi-place":[56],"functors,":[57],"such":[58],"as":[59,86,88],"those":[60],"Lesniewski.":[62],"This":[63],"paper":[64],"introduces":[65],"seven":[66],"multigrade":[67,102],"shows":[70],"how":[71],"can":[73],"be":[74,106],"Lesniewskian":[81],"languages,":[82],"yielding":[83],"logical":[84],"powerful":[87],"these":[89],"in":[91],"perfect":[92],"harmony":[93],"Ajdukiewicz's":[95],"type":[96],"grammar.":[98],"An":[99],"alternative":[100],"will":[104],"also":[105],"considered":[107],"significance":[110],"result":[113],"understanding":[116],"more":[120],"category":[122],"assignments":[123],"is":[124],"studied.":[125]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}