Formally Deriving the Third Newton’s Law from a Pair of Nontrivial Assumptions in a Formal Axiomatic Theory “Sigma-V”

The article is devoted to hitherto never undertaken applying an almost unknown logically formalized axiomatic epistemology-and-axiology system called “Sigma-V” to the Third Newton’s Law of mechanics. The author has continued investigating the extraordinary (paradigm-breaking) hypothesis of formal-axiological interpreting Newton’s mathematical principles of natural philosophy and, thus, has arrived to discrete mathematical modeling a system of formal axiology of nature by extracting and systematical studying its proper algebraic aspect. Along with the proper algebraic machinery, the axiomatic (hypothetic-deductive) method is exploited in this investigation systematically. The research results are the followings. 1) The Third Newton’s Law of mechanics has been modeled by a formal-axiological equation of two-valued algebraic system of metaphysics as formal axiology. (Precise defining the algebraic system is provided.) The formal-axiological equation has been established (and examined) in this algebraic system by accurate computing compositions of relevant evaluation-functions. Precise tabular definitions of the evaluation-functions are given. 2) The wonderful formula representing the Third Newton’s Law (in the relevant physical interpretation of the formal theory Sigma-V) has been derived logically in Sigma-V from the presumption of a-priori-ness of knowledge. A precise axiomatic definition of the nontrivial notion “a-priori-ness of knowledge” is given. The formal derivation is implemented in strict accordance with the rigor standard of D. Hilbert’s formalism;hence, checking the formal derivation submitted in this article is not a difficult task. With respect to proper theoretical physics, the formal inference is a nontrivial scientific novelty which has not been discussed and published elsewhere yet.

Two New Strategies for Developing Loop Invariants and Their Applications

The loop invariants take a very important role in the design,proof and derivation of the algorithmic program.We point out the limitations of the traditional standard strategy for developing loop invariants, and propose two new strategies for proving the existing algorithmic program and developing new ones. The strategies use recurrence as vehicle and integrate some effective methods of designing algorithms, e.g.Dynamic Programming,Greedy and Divide Conquer,into the recurrence relation of problem solving sequence.This lets us get straightforward an approach for solving a variety of complicated prob- lems,and makes the standard proof and formal derivation of their algorithmic programs possible.We show the method and advantages of applying the strategies with several typical nontrivial examples.