Paraconsistent First-Order Logic with restricted modus ponens rule and infinite hierarchy levels of contradiction LP^#_ω. Axiomatical system HST^#_ω, as paraconsistent generalization of Hrbacek set theory HST

2008/05/10 by Jaykov Foukzon, Foukzon, Jaykov
Computer Science · Mathematics · Psychology · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Philosophy and Theoretical Science #math.LO

paper · pdf · doi:10.48550/arxiv.0805.1481

127 pages

openalex publication_date 2008/05/10 · arxiv created 2022/02/15 · arxiv updated 2022/02/16 · openalex created_date 2022/09/06 · openalex updated_date 2026/07/28

Abstract

In this paper paraconsistent first-order logic LP^#_ω with restricted modus ponens rule and infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^#_ω is discussed.Axiomatical system HST^#_ω as paraconsistent generalization of Hrbacek set theory HST is considered.

Related

• A classical-logic view on a paraconsistent logic
• Paraconsistent second order arithmetic Z^#₂ based on the paraconsistent logic LP^# with infinite hierarchy levels of contradiction. Berry's and Richard's inconsistent numbers within Z^#₂
• A Paraconsistent Higher Order Logic
• Leibniz's law and its paraconsistent models
• Paraconsistent and Paracomplete Zermelo-Fraenkel Set Theory