Fullness and Decidability in Continuous Propositional Logic

Fullness and Decidability in Continuous Propositional Logic

In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline">&l...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteur: Xuanzhi Ren
Formaat: Artikel
Taal:English
Gepubliceerd in: MDPI AG 2022-11-01
Reeks:Mathematics
Onderwerpen:
continuous propositional logic
full system of connectives
strong compactness
Craig interpolation
satisfiability
NP-complete
Online toegang:https://www.mdpi.com/2227-7390/10/23/4455

Internet

https://www.mdpi.com/2227-7390/10/23/4455

Gelijkaardige items