In first-order predicate calculus “logic” (formal system) depends on the choice of an axiomatic system. However equally expressible first-order predicate logic can be done without axioms. I construct an expressive first-order predicate logic without axioms in which only implications can be proved. Then I consider its philosophical and theological implications. We have the same rules…… Continue reading Absolute Logic – logic without axioms
How western civilization ended with a “buffer overflow” error.
Lemme model what happens if somebody finds an efficient NP-complete algorithm. In layman terms an efficient NP-complete algorithm is: an algorithm that reaches any given decision accomplishment if what “to accomplish” is exactly (mathematically) described and is accomplishable (e.g. accordingly laws of physics). [That’s is oversimplified and inexact.] So, the first thing is that somebody…… Continue reading Modelling the global war in the case if an efficient NP-complete algorithm is published