Supra-logic: using transfinite type theory with type variables for paraconsistency

Journal of Applied Non-Classical Logics 15 (1):45-58 (2005)
  Copy   BIBTEX


We define the paraconsistent supra-logic Pσ by a type-shift from the booleans o of propositional logic Po to the supra-booleans σ of the propositional type logic P obtained as the propositional fragment of the transfinite type theory Q defined by Peter Andrews as a classical foundation of mathematics. The supra-logic is in a sense a propositional logic only, but since there is an infinite number of supra-booleans and arithmetical operations are available for this and other types, virtually anything can be specified. The supra-logic is a generalization of Lukasiewicz's three-valued logic, with the intermediate value duplicated many times and ordered such that none of the copies of this value imply other ones, but it differs from Lukasiewicz's many-valued logics as well as from logics based on bilattices. There are several automated theorem provers for classical higher order logic and it should be possible to modify these to our needs.



    Upload a copy of this work     Papers currently archived: 74,389

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

183 (#68,013)

6 months
1 (#415,900)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations