Algebraic study of Sette's maximal paraconsistent logic

DOI10.1007/BF01058534zbMath0817.03004MaRDI QIDQ1344874

Alexej P. Pynko

Publication date: 22 February 1995

Published in: Studia Logica (Search for Journal in Brave)

zbMATH Keywords

completeness; paraconsistency; algebraic semantics; filters; abstract logic; abstract Sette logic; algebraizable deductive systems; paraconsistent deductive system; Sette algebras

Mathematics Subject Classification ID

03G25: Other algebras related to logic

03B22: Abstract deductive systems

03B53: Paraconsistent logics

Related Items

Functional Completeness and Axiomatizability within Belnap's Four-Valued Logic and its Expansions, Subprevarieties versus extensions. Application to the logic of paradox, Bochvar's three-valued logic and literal paralogics: Their lattice and functional equivalence, Definitional equivalence and algebraizability of generalized logical systems, Paraconsistency and Sette’s calculus P1, Twist-structures semantics for the logics of the hierarchy IⁿP^k

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic aspects of deduction theorems
• Equivalential logics. I
• Algebraic logic for classical conjunction and disjunction
• An algebraic approach to non-classical logics
• Matrix approach in methodology of sentential calculi
• Algebraizable logics
• A first approach to abstract modal logics
• The independence of connectives