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

Research output: Contribution to journalJournal articleResearchpeer-review


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 (North-Holland Studies in Logic 1965) 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 (finite type theory) and it should be possible to modify these to our needs.
Original languageEnglish
JournalJournal of Applied Non-Classical Logics
Issue number1
Pages (from-to)45-58
Publication statusPublished - 2005
Externally publishedYes


Dive into the research topics of 'Supra-logic: using transfinite type theory with type variables for paraconsistency'. Together they form a unique fingerprint.

Cite this