Static vs. Dynamic Methods
Are there any methods which are immune to change?
The question of whether or not methods are static or dynamic is a fundamental question in the scientonomic community. A method is said to be static when it is immune to change, and dynamic when it is not.
In the scientonomic context, this question was first formulated by Hakob Barseghyan in 2015. The question is currently accepted as a legitimate topic for discussion by Scientonomy community.
In Scientonomy, the accepted answers to the question can be summarized as follows:
- All substantive methods are necessarily dynamic. All procedural methods are necessarily static.
Contents
Scientonomic History
Acceptance Record of the Question
Community | Accepted From | Acceptance Indicators | Still Accepted | Accepted Until | Rejection Indicators |
---|---|---|---|---|---|
Scientonomy | 1 January 2016 | That is when the community accepted its first answers to this question, the Static Procedural Methods theorem (Barseghyan-2015) and Dynamic Substantive Methods theorem (Barseghyan-2015), which indicates that the question is itself considered legitimate. | Yes |
All Direct Answers
Theory | Formulation | Formulated In |
---|---|---|
Dynamic Substantive Methods theorem (Barseghyan-2015) | All substantive methods are necessarily dynamic. | 2015 |
Static Procedural Methods theorem (Barseghyan-2015) | All procedural methods are necessarily static. | 2015 |
If a direct answer to this question is missing, please click here to add it.
Accepted Direct Answers
Community | Theory | Formulation | Accepted From | Accepted Until |
---|---|---|---|---|
Scientonomy | Static Procedural Methods theorem (Barseghyan-2015) | All procedural methods are necessarily static. | 1 January 2016 | |
Scientonomy | Dynamic Substantive Methods theorem (Barseghyan-2015) | All substantive methods are necessarily dynamic. | 1 January 2016 |
Suggested Modifications
Current View
In Scientonomy, the accepted answers to the question are Dynamic Substantive Methods theorem (Barseghyan-2015) and Static Procedural Methods theorem (Barseghyan-2015).
Dynamic Substantive Methods theorem (Barseghyan-2015) states: "All substantive methods are necessarily dynamic."
A substantive method is one that presupposes at least one contingent proposition; one that depends on the state of something in the external world. According to our understanding of contingent propositions, all such propositions are fallible. As such, any substantive method will necessarily presuppose at least one contingent proposition, and is therefore fallible. Thus, by the synchronism of method rejection theorem, the rejection of a theory can result in the rejection of a method, rendering all substantive methods dynamic.
Static Procedural Methods theorem (Barseghyan-2015) states: "All procedural methods are necessarily static."
A procedural method is a method which doesn't presuppose any contingent propositions; it can only presuppose necessary truths such as those of mathematics or logic. Given the nature of necessary truths, it is impossible for one such truth to contradict another necessary truth since it must be true in all possible worlds. Therefore, it follows from the Method Rejection theorem that, since there can be no elements at odds with a necessary truth, any procedural method is, in principle, static.
Related Topics
This question is a subquestion of Mechanism of Method Rejection.