{"id":"https://openalex.org/W2031598858","doi":"https://doi.org/10.1080/11663081.1999.10510958","title":"Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions","display_name":"Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2031598858","doi":"https://doi.org/10.1080/11663081.1999.10510958","mag":"2031598858"},"language":"en","primary_location":{"id":"doi:10.1080/11663081.1999.10510958","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.1999.10510958","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","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/A5064703709","display_name":"Alexej P. Pynko","orcid":"https://orcid.org/0000-0002-3478-9850"},"institutions":[{"id":"https://openalex.org/I149851306","display_name":"National Academy of Sciences of Ukraine","ror":"https://ror.org/00je4t102","country_code":"UA","type":"funder","lineage":["https://openalex.org/I149851306"]}],"countries":["UA"],"is_corresponding":true,"raw_author_name":"Alexej P. Pynko","raw_affiliation_strings":["Department of Digital Automata Theory , V. M. Glushkov Institute of Cybernetics National Academy of Sciences of Ukraine , Academik Glushkov prosp. 40, Kiev , 252022 , Ukraine E-mail: pynko@d105.icyb.kiev.ua"],"affiliations":[{"raw_affiliation_string":"Department of Digital Automata Theory , V. M. Glushkov Institute of Cybernetics National Academy of Sciences of Ukraine , Academik Glushkov prosp. 40, Kiev , 252022 , Ukraine E-mail: pynko@d105.icyb.kiev.ua","institution_ids":["https://openalex.org/I149851306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064703709"],"corresponding_institution_ids":["https://openalex.org/I149851306"],"apc_list":null,"apc_paid":null,"fwci":3.5683,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.92695907,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"1","first_page":"61","last_page":"105"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9998000264167786,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9952999949455261,"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/negation","display_name":"Negation","score":0.7929939031600952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7467728853225708},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7370646595954895},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43950796127319336},{"id":"https://openalex.org/keywords/negation-as-failure","display_name":"Negation as failure","score":0.43633773922920227},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4126424789428711},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4040790796279907},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.39774101972579956},{"id":"https://openalex.org/keywords/calculus","display_name":"Calculus (dental)","score":0.38302338123321533},{"id":"https://openalex.org/keywords/autoepistemic-logic","display_name":"Autoepistemic logic","score":0.23019108176231384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1818903386592865},{"id":"https://openalex.org/keywords/multimodal-logic","display_name":"Multimodal logic","score":0.1428338885307312},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11628136038780212},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.06637191772460938},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.056065917015075684},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.051318347454071045}],"concepts":[{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.7929939031600952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7467728853225708},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7370646595954895},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43950796127319336},{"id":"https://openalex.org/C194146651","wikidata":"https://www.wikidata.org/wiki/Q2119400","display_name":"Negation as failure","level":5,"score":0.43633773922920227},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4126424789428711},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4040790796279907},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.39774101972579956},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.38302338123321533},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.23019108176231384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1818903386592865},{"id":"https://openalex.org/C203659156","wikidata":"https://www.wikidata.org/wiki/Q6934805","display_name":"Multimodal logic","level":3,"score":0.1428338885307312},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11628136038780212},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.06637191772460938},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.056065917015075684},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.051318347454071045},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/11663081.1999.10510958","is_oa":false,"landing_page_url":"https://doi.org/10.1080/11663081.1999.10510958","pdf_url":null,"source":{"id":"https://openalex.org/S93822064","display_name":"Journal of Applied Non-Classical Logics","issn_l":"1166-3081","issn":["1166-3081","1958-5780"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Applied Non-Classical Logics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W136232721","https://openalex.org/W1483568252","https://openalex.org/W1998548029","https://openalex.org/W2051471664","https://openalex.org/W2052185876","https://openalex.org/W2093713825","https://openalex.org/W2551720480","https://openalex.org/W4213165878","https://openalex.org/W4253864570"],"related_works":["https://openalex.org/W1596105581","https://openalex.org/W4214701509","https://openalex.org/W4212824748","https://openalex.org/W2077585551","https://openalex.org/W1605488371","https://openalex.org/W3104092934","https://openalex.org/W286008560","https://openalex.org/W3197254143","https://openalex.org/W2139420949","https://openalex.org/W4206538313"],"abstract_inverted_index":{"ABSTRACT":[0],"In":[1],"this":[2],"paper":[3],"we":[4,58,97,115],"study":[5],"12":[6,89],"four-valued":[7,15,46,55,139],"logics":[8,90,124],"arisen":[9],"from":[10],"Belnap's":[11],"truth":[12],"and/or":[13],"knowledge":[14],"lattices,":[16],"with":[17,48],"or":[18,24,26,72],"without":[19],"constants,":[20],"by":[21,63,87],"adding":[22],"one":[23],"both":[25],"none":[27],"of":[28,43,82,102,110,122,130],"two":[29,131],"new":[30],"non-regular":[31,65],"operations\u2014classical":[32],"negation":[33,71],"and":[34],"natural":[35,73,119],"implication.":[36],"We":[37],"prove":[38,59,93],"that":[39,60,127],"the":[40,44,53,83,88,123,136],"secondary":[41],"connectives":[42],"bilattice":[45,49],"logic":[47],"constants":[50],"are":[51],"exactly":[52],"regular":[54],"operations.":[56],"Moreover,":[57],"its":[61],"expansion":[62],"any":[64],"connective":[66],"(such":[67],"as,":[68],"e.g.,":[69],"classical":[70],"implication)":[74],"is":[75],"strictly":[76],"functionally":[77],"complete.":[78],"Further,":[79],"finding":[80],"axiomatizations":[81,101,121],"quasi":[84],"varieties":[85],"generated":[86],"involved":[91],"(that":[92],"to":[94],"be":[95],"varieties),":[96],"find":[98,117],"naturell":[99],"equational":[100],"these":[103],"logics.":[104],"Finally,":[105],"applying":[106],"Pynko's":[107,132],"general":[108],"theory":[109],"algebraizable":[111],"sequential":[112,133],"consequence":[113],"operations,":[114],"also":[116],"equivalent":[118],"sequentiell":[120],"under":[125],"consideration":[126],"expand":[128],"either":[129],"calculi":[134],"for":[135],"constant-free":[137],"truth-lattice":[138],"logic.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}