Variant quantifiers in L_(3)-valued first-order logic  

作　　者：Wei LI Yuefei SUI 

机构地区：[1]State Key Laboratory of Software Development Environment,Beihang University,Beijing 100083,China [2]Key Laboratory of Intelligent Information Processing,Institute of Computing Technology,Chinese Academy of Sciences,Beijing 100190,China [3]School of Computer Science and Technology,University of Chinese Academy of Sciences,Beijing 100049,China

出　　处：《Frontiers of Computer Science》2021年第5期151-159,共9页中国计算机科学前沿（英文版）

基　　金：the Open Fund of the State Key Laboratory of Software Development Environment(SKLSDE-2010KF-06);Beijing University of Aeronautics and Astronautics,and by the National Basic Research Program of China(973 Program)(2005CB321901).

摘　　要：Traditional first-order logic has four definitions for quantifiers,which are defined by universal and existential quantifiers.In L_(3)-valued(three-valued)first-order logic,there are eight kinds of definitions for quantifiers;and corresponding Gentzen deduction systems will be given and their soundness and completeness theorems will be proved.

关 键 词：L_(3)-valued(three-valued)first-order logic sequent QUANTIFIER soundness theorem completeness theorem 

分 类 号：O141[理学—数学]