A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation (Q1590193)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1545483
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation |
scientific article; zbMATH DE number 1545483 |
Statements
A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation (English)
0 references
18 December 2001
0 references
The paraconsistent system CPQ-ZFC/F is defined, where CPQ can be regarded as the first-order logic obtained from classical logic by removing modus ponens. Then CPQ-ZFC/F is a paraconsistent version of classical ZFC minus the axiom of foundation. It is shown using strong nonfinitary methods that CPQ-ZFC/F has the same deductive powers as classical ZFC/F. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial.
0 references
paraconsistent logic
0 references
paraconsistent set theory
0 references
0.7673237323760986
0 references
