{"id":"https://openalex.org/W2761783297","doi":"https://doi.org/10.2168/lmcs-6(4:11)2010","title":"On the meaning of logical completeness","display_name":"On the meaning of logical completeness","publication_year":2010,"publication_date":"2010-12-22","ids":{"openalex":"https://openalex.org/W2761783297","doi":"https://doi.org/10.2168/lmcs-6(4:11)2010","mag":"2761783297"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-6(4:11)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:11)2010","pdf_url":"https://lmcs.episciences.org/1066/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1066/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Michele Basaldella","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michele Basaldella","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Kazushige Terui","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kazushige Terui","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4664,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78028793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 6, Issue 4","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.620199978351593,"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/T10126","display_name":"Logic, programming, and type systems","score":0.620199978351593,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.28130000829696655,"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":0.05299999937415123,"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/mathematical-proof","display_name":"Mathematical proof","score":0.7534999847412109},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7461000084877014},{"id":"https://openalex.org/keywords/g\u00f6dels-completeness-theorem","display_name":"G\u00f6del's completeness theorem","score":0.6134999990463257},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.490200012922287},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.4593000113964081},{"id":"https://openalex.org/keywords/first-order-logic","display_name":"First-order logic","score":0.4571000039577484},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.4124000072479248},{"id":"https://openalex.org/keywords/linear-logic","display_name":"Linear logic","score":0.40779998898506165},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.4043000042438507},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4027999937534332}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7534999847412109},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7461000084877014},{"id":"https://openalex.org/C200116569","wikidata":"https://www.wikidata.org/wiki/Q902052","display_name":"G\u00f6del's completeness theorem","level":2,"score":0.6134999990463257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5602999925613403},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.490200012922287},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.4593000113964081},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4586000144481659},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.4571000039577484},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.4124000072479248},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.40779998898506165},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4043000042438507},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4027999937534332},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.3971000015735626},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3603000044822693},{"id":"https://openalex.org/C178421362","wikidata":"https://www.wikidata.org/wiki/Q176786","display_name":"Intuitionistic logic","level":3,"score":0.34880000352859497},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.3434000015258789},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.3246999979019165},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.3192000091075897},{"id":"https://openalex.org/C171636804","wikidata":"https://www.wikidata.org/wiki/Q1149458","display_name":"Compactness theorem","level":4,"score":0.3124000132083893},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C191222856","wikidata":"https://www.wikidata.org/wiki/Q655328","display_name":"Well-formed formula","level":5,"score":0.3046000003814697},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.2827000021934509},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.2732999920845032},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26100000739097595},{"id":"https://openalex.org/C9672783","wikidata":"https://www.wikidata.org/wiki/Q65122115","display_name":"Game semantics","level":5,"score":0.25920000672340393},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-6(4:11)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:11)2010","pdf_url":"https://lmcs.episciences.org/1066/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1011.1625","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1011.1625","pdf_url":"https://arxiv.org/pdf/1011.1625","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:bd48c62b3d154002948d5cf63c5c62e1","is_oa":true,"landing_page_url":"https://doaj.org/article/bd48c62b3d154002948d5cf63c5c62e1","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 6, Issue 4 (2010)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-6(4:11)2010","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-6(4:11)2010","pdf_url":"https://lmcs.episciences.org/1066/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1008968966","display_name":"\u9ad8\u901f\u5ea6\u4e8c\u73fe\u8c61\u795e\u7d4c\u30a4\u30f3\u30d1\u30eb\u30b9\u8a08\u6e2c\u88c5\u7f6e\u306e\u8a66\u4f5c","funder_award_id":"70004","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G4070118497","display_name":"A Study for Supporting Integration of Knowledge across Interdisciplinary Fields using Domain Specific Languages","funder_award_id":"21700041","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2761783297.pdf","grobid_xml":"https://content.openalex.org/works/W2761783297.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1965630431","https://openalex.org/W1995251574","https://openalex.org/W2024189573","https://openalex.org/W2059515205","https://openalex.org/W2070324762","https://openalex.org/W2093561140","https://openalex.org/W2098086155","https://openalex.org/W2102706914","https://openalex.org/W4205415028"],"related_works":[],"abstract_inverted_index":{"Goedel's":[0,139],"completeness":[1,16,82,127],"theorem":[2,9,83],"is":[3,27,103,110],"concerned":[4,22],"with":[5,23,50,123,136],"provability,":[6],"while":[7],"Girard's":[8],"in":[10,18,59,86,128,141],"ludics":[11,49],"(as":[12],"well":[13],"as":[14],"full":[15,126],"theorems":[17],"game":[19,129],"semantics)":[20],"are":[21],"proofs.":[24],"Our":[25],"purpose":[26],"to":[28,61],"look":[29],"for":[30,84,90],"a":[31,38,63,71,81,104,111,133,146],"connection":[32],"between":[33],"these":[34],"two":[35],"disciplines.":[36],"Following":[37],"previous":[39],"work":[40],"[3],":[41],"we":[42],"consider":[43],"an":[44,159],"extension":[45],"of":[46,66,74,106,114,117,125,138,161],"the":[47,115],"original":[48],"contraction":[51],"and":[52,69,95,157],"universal":[53],"nondeterminism,":[54],"which":[55,119],"play":[56],"dual":[57],"roles,":[58],"order":[60],"capture":[62],"polarized":[64],"fragment":[65],"linear":[67],"logic":[68],"thus":[70],"constructive":[72],"variant":[73],"classical":[75],"propositional":[76],"logic.":[77],"We":[78],"then":[79],"prove":[80],"proofs":[85,124,137],"this":[87],"extended":[88],"setting:":[89],"any":[91,96],"behaviour":[92],"(formula)":[93],"A":[94,107,118],"design":[97],"(proof":[98],"attempt)":[99],"P,":[100],"either":[101],"P":[102],"proof":[105],"or":[108],"there":[109],"model":[112],"M":[113],"orthogonal":[116],"defeats":[120],"P.":[121],"Compared":[122],"semantics,":[130],"ours":[131],"exhibits":[132],"striking":[134],"similarity":[135],"completeness,":[140],"that":[142],"it":[143],"explicitly":[144],"constructs":[145],"countermodel":[147],"essentially":[148],"using":[149],"Koenig's":[150],"lemma,":[151],"proceeds":[152],"by":[153],"induction":[154],"on":[155],"formulas,":[156],"implies":[158],"analogue":[160],"Loewenheim-Skolem":[162],"theorem.":[163]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2017-10-20T00:00:00"}