{"id":"https://openalex.org/W2798789889","doi":"https://doi.org/10.1017/cbo9780511526602","title":"Logic and Computation","display_name":"Logic and Computation","publication_year":1987,"publication_date":"1987-10-15","ids":{"openalex":"https://openalex.org/W2798789889","doi":"https://doi.org/10.1017/cbo9780511526602","mag":"2798789889"},"language":"en","primary_location":{"id":"doi:10.1017/cbo9780511526602","doi":"https://doi.org/10.1017/cbo9780511526602","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511526602","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},"volume":null,"type":"book","is_traditional":true,"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/A5086565312","display_name":"Lawrence Charles Paulson","orcid":"https://orcid.org/0000-0003-0288-4279","observed_orcids":["https://orcid.org/0000-0003-0288-4279"]},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Lawrence C. Paulson","raw_affiliation_strings":["University of Cambridge"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cambridge","institution_ids":["https://openalex.org/I241749"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086565312"],"corresponding_institution_ids":["https://openalex.org/I241749"],"apc_list":null,"apc_paid":null,"fwci":9.2884,"has_fulltext":false,"cited_by_count":194,"citation_normalized_percentile":{"value":0.97173913,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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.9994999766349792,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":9.999999747378752e-05,"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/T10142","display_name":"Formal Methods in Verification","score":9.999999747378752e-05,"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/formal-theorem-proving","display_name":"formal theorem proving","score":0.8830000162124634},{"id":"https://openalex.org/keywords/domain-theory","display_name":"domain theory","score":0.6909999847412109},{"id":"https://openalex.org/keywords/denotational-semantics","display_name":"denotational semantics","score":0.9819999933242798},{"id":"https://openalex.org/keywords/program-specification","display_name":"program specification","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4558776915073395},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44922110438346863},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24188685417175293}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/cbo9780511526602","doi":"https://doi.org/10.1017/cbo9780511526602","is_oa":false,"landing_page_url":"https://doi.org/10.1017/cbo9780511526602","pdf_url":null,"source":{"id":"https://openalex.org/S4306462995","display_name":"Cambridge University Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},{"id":"mag:2798789889","doi":null,"is_oa":false,"landing_page_url":"https://www.amazon.com/Logic-Computation-Interactive-Cambridge-Theoretical/dp/0521346320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1741698332","https://openalex.org/W2491580512","https://openalex.org/W74180852","https://openalex.org/W2113426200","https://openalex.org/W2112170202","https://openalex.org/W3026552755","https://openalex.org/W1991293669","https://openalex.org/W2128642478","https://openalex.org/W2774465176","https://openalex.org/W2201286794"],"abstract_inverted_index":{"This":[0],"book":[1,82,97],"is":[2,21,54,83],"concerned":[3],"with":[4,9,36],"techniques":[5],"for":[6,16,25,137,147],"formal":[7],"theorem-proving,":[8],"particular":[10],"reference":[11,121,135],"to":[12,45,72,84,122,131],"Cambridge":[13,19,52,138],"LCF":[14,20,53,155],"(Logic":[15],"Computable":[17],"Functions).":[18],"a":[22,65,134,144],"computer":[23],"program":[24,50],"reasoning":[26],"about":[27],"computation.":[28],"It":[29,140],"combines":[30],"the":[31,39,42,47,69,76,86,105,154],"methods":[32],"of":[33,41,49,80,99,149],"mathematical":[34,106],"logic":[35,109],"domain":[37,111],"theory,":[38,112],"basis":[40],"denotational":[43],"approach":[44],"specifying":[46],"meaning":[48],"statements.":[51],"based":[55,152],"on":[56,153],"an":[57,117],"earlier":[58],"theorem-proving":[59],"system,":[60],"Edinburgh":[61],"LCF,":[62],"which":[63,88],"introduced":[64],"design":[66],"that":[67],"gives":[68],"user":[70],"flexibility":[71],"use":[73],"and":[74,110,113],"extend":[75],"system.":[77],"A":[78],"goal":[79],"this":[81],"explain":[85],"design,":[87],"has":[89],"been":[90],"adopted":[91],"in":[92],"several":[93],"other":[94,150],"systems.":[95],"The":[96],"consists":[98],"two":[100],"parts.":[101],"Part":[102,126],"I":[103],"outlines":[104],"preliminaries,":[107],"elementary":[108],"explains":[114],"them":[115],"at":[116],"intuitive":[118],"level,":[119],"giving":[120],"more":[123],"advanced":[124],"reading;":[125],"II":[127],"provides":[128],"sufficient":[129],"detail":[130],"serve":[132],"as":[133],"manual":[136],"LCF.":[139],"will":[141],"also":[142],"be":[143],"useful":[145],"guide":[146],"implementors":[148],"programs":[151],"approach.":[156]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2018-05-07T00:00:00"}