On interpretation of inconsistent theories
The paraconsistent predicate calculus Cont, proposed by the author [Avtom. Telemekh. 1983, No.6, 113-124 (1983; Zbl 0532.03007); ibid. No.7, 908-914 (1983; Zbl 0532.03008)], is considered as a base for formal theories of first order. This calculus is as close as possible to the classical one, but the principle ``everything follows from an inconsistency is excluded. A three-valued semantics is proposed for theories based on Cont, and the basic metatheorems (of completeness, compactness, etc.) are proved. Relations of such theories to corresponding classical theories are established. In particular it is proved that a theory based on Cont is inconsistent iff a corresponding classical theory is inconsistent. The semantics of the equality in the frame of Cont is considered. It is proved that the pure predicate calculus Cont and Cont with equality are undecidable.
- Consistent theories in inconsistent logics
- scientific article; zbMATH DE number 3974958
- Asymmetric Interpretations for Bounded Theories
- Inconsistency and Incompleteness, Revisited
- Inquiry, refutations and the inconsistent
- On the Acceptability of Incompatible Arguments
- Paraconsistency: Towards a tentative interpretation
- scientific article; zbMATH DE number 4139718
- scientific article; zbMATH DE number 3663099 (Why is no real title available?)
- scientific article; zbMATH DE number 3719121 (Why is no real title available?)
- scientific article; zbMATH DE number 3625335 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- scientific article; zbMATH DE number 3304881 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- scientific article; zbMATH DE number 3095478 (Why is no real title available?)
- Propositional calculus for contradictory deductive systems
- Proving contradictions in formal theories. I
- Proving contradictions in formal theories. II
- The value of the four values
- Generalized correspondence analysis for three-valued logics
- Doubts for Dawid's non-empirical theory assessment
- Combining classical logic, paraconsistency and relevance
- Distance-based paraconsistent logics
- A semantics for reasoning consistently in the presence of inconsistency
- K3, Ł3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you
- Exactly true and non-falsity logics meeting infectious ones
- Normalisation for some quite interesting many-valued logics
- Three-valued paraconsistent propositional logics
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- Rules of explosion and excluded middle: constructing a unified single-succedent Gentzen-style framework for classical, paradefinite, paraconsistent, and paracomplete logics
- Computer-aided searching for a tabular many-valued discussive logic -- matrices
- Proving contradictions in formal theories. I
- Proving contradictions in formal theories. II
- A non-deterministic view on non-classical negations
This page was built for publication: On interpretation of inconsistent theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123189)