Variant quantifiers in L3-valued first-order logic

Wei Li; Yuefei Sui

doi:10.1007/s11704-020-7399-7

Variant quantifiers in L₃-valued first-order logic

Wei Li
, Yuefei Sui^*

^*Corresponding author for this work

School of Computer Science and Engineering

CAS - Institute of Computing Technology
University of Chinese Academy of Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

Traditional first-order logic has four definitions for quantifiers, which are defined by universal and existential quantifiers. In L₃-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.

Original language	English
Article number	155403
Journal	Frontiers of Computer Science
Volume	15
Issue number	5
DOIs	https://doi.org/10.1007/s11704-020-7399-7
State	Published - Oct 2021

Keywords

L-valued (three-valued) first-order logic
completeness theorem
quantifier
sequent
soundness theorem

Access to Document

10.1007/s11704-020-7399-7

Cite this

@article{7a1340e612b7444f8376d065feddad93,

title = "Variant quantifiers in L3-valued first-order logic",

abstract = "Traditional first-order logic has four definitions for quantifiers, which are defined by universal and existential quantifiers. In L3-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.",

keywords = "L-valued (three-valued) first-order logic, completeness theorem, quantifier, sequent, soundness theorem",

author = "Wei Li and Yuefei Sui",

note = "Publisher Copyright: {\textcopyright} 2020, Higher Education Press.",

year = "2021",

month = oct,

doi = "10.1007/s11704-020-7399-7",

language = "英语",

volume = "15",

journal = "Frontiers of Computer Science",

issn = "2095-2228",

publisher = "Higher Education Press Limited Company",

number = "5",

}

TY - JOUR

T1 - Variant quantifiers in L3-valued first-order logic

AU - Li, Wei

AU - Sui, Yuefei

PY - 2021/10

Y1 - 2021/10

N2 - Traditional first-order logic has four definitions for quantifiers, which are defined by universal and existential quantifiers. In L3-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.

AB - Traditional first-order logic has four definitions for quantifiers, which are defined by universal and existential quantifiers. In L3-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.

KW - L-valued (three-valued) first-order logic

KW - completeness theorem

KW - quantifier

KW - sequent

KW - soundness theorem

UR - https://www.scopus.com/pages/publications/85106887621

U2 - 10.1007/s11704-020-7399-7

DO - 10.1007/s11704-020-7399-7

M3 - 文章

AN - SCOPUS:85106887621

SN - 2095-2228

VL - 15

JO - Frontiers of Computer Science

JF - Frontiers of Computer Science

IS - 5

M1 - 155403

ER -

Variant quantifiers in L₃-valued first-order logic

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this