{"id":"https://openalex.org/W1994179113","doi":"https://doi.org/10.1145/567752.567759","title":"First order programming logic","display_name":"First order programming logic","publication_year":1979,"publication_date":"1979-01-01","ids":{"openalex":"https://openalex.org/W1994179113","doi":"https://doi.org/10.1145/567752.567759","mag":"1994179113"},"language":"en","primary_location":{"id":"doi:10.1145/567752.567759","doi":"https://doi.org/10.1145/567752.567759","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567752.567759","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567752.567759","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/567752.567759","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068157052","display_name":"Robert Cartwright","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Cartwright","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001232416","display_name":"John McCarthy","orcid":"https://orcid.org/0000-0003-2878-1921","observed_orcids":["https://orcid.org/0000-0003-2878-1921","https://orcid.org/0000-0002-8903-6573","https://orcid.org/0000-0001-6356-4266"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John McCarthy","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.686,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.9335443,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"68","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0003000000142492354,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.00019999999494757503,"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/recursive-programs","display_name":"recursive programs","score":0.6830000281333923},{"id":"https://openalex.org/keywords/least-fixed-point","display_name":"least fixed point","score":0.8809999823570251},{"id":"https://openalex.org/keywords/relative-completeness","display_name":"relative completeness","score":0.9459999799728394},{"id":"https://openalex.org/keywords/program-verification","display_name":"program verification","score":0.4959999918937683},{"id":"https://openalex.org/keywords/partial-functions","display_name":"partial functions","score":0.8100000023841858},{"id":"https://openalex.org/keywords/iterative-programs","display_name":"iterative programs","score":0.8740000128746033},{"id":"https://openalex.org/keywords/code-translation","display_name":"program translation","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.7250841856002808},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5608704686164856},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.5064054727554321},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.47242629528045654},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4602107107639313},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.45292675495147705},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.43804556131362915},{"id":"https://openalex.org/C124047733","wikidata":"https://www.wikidata.org/wiki/Q5157327","display_name":"Computational logic","level":3,"score":0.436175674200058},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.4349321126937866},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.4315968155860901},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.4130174517631531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3651486933231354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.346166729927063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32121628522872925},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.318581223487854},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.15517780184745789},{"id":"https://openalex.org/C172385210","wikidata":"https://www.wikidata.org/wiki/Q5339","display_name":"Transistor","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C165801399","wikidata":"https://www.wikidata.org/wiki/Q25428","display_name":"Voltage","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/567752.567759","doi":"https://doi.org/10.1145/567752.567759","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567752.567759","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567752.567759","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/567752.567759","doi":"https://doi.org/10.1145/567752.567759","is_oa":true,"landing_page_url":"https://doi.org/10.1145/567752.567759","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/567752.567759","source":{"id":"https://openalex.org/S7407088133","display_name":"ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '79","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1994179113.pdf","grobid_xml":"https://content.openalex.org/works/W1994179113.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W88524382","https://openalex.org/W109993195","https://openalex.org/W147299627","https://openalex.org/W151011738","https://openalex.org/W1512502927","https://openalex.org/W1579433101","https://openalex.org/W1998555378","https://openalex.org/W2012220159","https://openalex.org/W2085335923","https://openalex.org/W2090767487","https://openalex.org/W2123596219","https://openalex.org/W2133938930","https://openalex.org/W2143730943","https://openalex.org/W2166089338","https://openalex.org/W2340063198","https://openalex.org/W2378259225","https://openalex.org/W3146075203","https://openalex.org/W3199565109","https://openalex.org/W4300295709"],"related_works":["https://openalex.org/W2049714341","https://openalex.org/W1548659044","https://openalex.org/W2090307683","https://openalex.org/W1543481037","https://openalex.org/W7101237742","https://openalex.org/W2166757602","https://openalex.org/W2136410977","https://openalex.org/W7161305694","https://openalex.org/W1506471434","https://openalex.org/W140068435"],"abstract_inverted_index":{"First":[0,59,133,169],"Order":[1,60,134,170],"Programming":[2,61,135,171],"Logic":[3,62,136,172],"is":[4,40,92,129,137],"a":[5,36],"simple,":[6],"yet":[7],"powerful":[8],"formal":[9],"system":[10],"for":[11,42,156],"reasoning":[12],"about":[13],"recursive":[14,37,116,176],"programs.":[15,180],"In":[16,73,144],"its":[17],"simplest":[18],"form,":[19],"it":[20,25,95,97],"has":[21,160],"one":[22],"major":[23],"limitation:":[24],"cannot":[26,105],"establish":[27,99,131],"any":[28,112],"property":[29],"of":[30,35,88,115,126,178],"the":[31,69,74,79,89,107,149,175],"least":[32],"fixed":[33,45],"point":[34],"program":[38],"which":[39,120,159],"false":[41],"some":[43],"other":[44],"point.":[46],"To":[47],"rectify":[48],"this":[49,127],"weakness,":[50],"we":[51,76,104,146],"present":[52],"two":[53,80],"intuitively":[54],"distinct":[55],"approaches":[56,81],"to":[57,130,139,174],"strengthening":[58],"and":[63],"prove":[64,77],"that":[65,78,132,148],"either":[66],"extension":[67],"makes":[68],"logic":[70,91],"relatively":[71],"complete.":[72],"process,":[75],"are":[82],"formally":[83],"equivalent.":[84],"The":[85],"relative":[86],"completeness":[87],"extended":[90],"significant":[93],"because":[94],"suggests":[96],"can":[98],"all":[100],"\"ordinary\"":[101],"properties":[102],"(obviously":[103],"escape":[106],"Godelian":[108],"incompleteness":[109],"inherent":[110],"in":[111],"programming":[113],"logic)":[114],"programs":[117,141,158],"including":[118],"those":[119],"compute":[121],"partial":[122],"functions.The":[123],"second":[124],"contribution":[125],"paper":[128],"applicable":[138],"iterative":[140,157,179],"as":[142,167],"well.":[143],"particular,":[145],"show":[147],"intermittent":[150],"assertions":[151],"method--an":[152],"informal":[153],"proof":[154],"method":[155],"not":[161],"been":[162],"formalized--is":[163],"conveniently":[164],"formalized":[165],"simply":[166],"sugared":[168],"applied":[173],"translations":[177]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-10-29T09:56:32.521200","created_date":"2016-06-24T00:00:00"}