I have decided in writing the draft of my manuscript that the primary project will be the development of the preliminary logical languages and theories which have proceeded the development of mine. The preliminaries will be by no means comprehensive. In fact, my objective is to present minimalistic languages and models representing philosophical views on reasoning and physics while covering the major methods and theories. Notably the standard model of particle physics as given by quantum mechanics and quantum field theories together with the cosmological model based in general relativity and blackhole thermodynamics. Classical and non-classical metamathematics will be represented by computing theory and analytical calculus.

For this purpose, I have chosen to comparatively study Lq, L2q, Basic Logic, Minimalistic Logic, LK, and Natural Deduction. LK or an extension of it will be used for formalizing my proof of the impossibility of a non-contradictory theory of everything. Lq will be used for heuristicly hypothesizing the properties of an empty or paraempty logical language. Lnq, Basic Logic, Minimalistic Logic will be included mostly for reference and comparison of classically consistent object languages and paraconsistent object languages with truth-preserving consistent metalanguages.

This will likely be sufficient logical machinery to establish the inadmissibility of finitistic contradiction tolerant proofs in systems like Peano arithmetic. It is hoped that critical analysis of Lq and its computable extensions will suggest the form of finitistic contradiction tolerant proofs. If such a thing in some sense exists then a dual proof of possibility for contradictory theories of everything might be deducible in some way. Furthermore, the development of such kinds of proof might suffice for direct proofs of consistency.

For this purpose, I have chosen to comparatively study Lq, L2q, Basic Logic, Minimalistic Logic, LK, and Natural Deduction. LK or an extension of it will be used for formalizing my proof of the impossibility of a non-contradictory theory of everything. Lq will be used for heuristicly hypothesizing the properties of an empty or paraempty logical language. Lnq, Basic Logic, Minimalistic Logic will be included mostly for reference and comparison of classically consistent object languages and paraconsistent object languages with truth-preserving consistent metalanguages.

This will likely be sufficient logical machinery to establish the inadmissibility of finitistic contradiction tolerant proofs in systems like Peano arithmetic. It is hoped that critical analysis of Lq and its computable extensions will suggest the form of finitistic contradiction tolerant proofs. If such a thing in some sense exists then a dual proof of possibility for contradictory theories of everything might be deducible in some way. Furthermore, the development of such kinds of proof might suffice for direct proofs of consistency.