Skip to main navigation Skip to search Skip to main content

Monotonicity and nonmonotonicity in L3-valued propositional logic

  • Wei Li
  • , Yuefei Sui*
  • *Corresponding author for this work
  • CAS - Institute of Computing Technology
  • University of Chinese Academy of Sciences

Research output: Contribution to journalArticlepeer-review

Abstract

A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L3-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed.

Original languageEnglish
Article number164315
JournalFrontiers of Computer Science
Volume16
Issue number4
DOIs
StatePublished - Aug 2022

Keywords

  • gentzen deduction system
  • monotonicity
  • multisequent
  • nonmonotonicity
  • sequent

Fingerprint

Dive into the research topics of 'Monotonicity and nonmonotonicity in L3-valued propositional logic'. Together they form a unique fingerprint.

Cite this