22
edits
Changes
Jump to navigation
Jump to search
Static Procedural Methods theorem (Barseghyan-2015) (view source)
Revision as of 02:09, 3 March 2017
, 02:09, 3 March 2017no edit summary
|Description=A '''procedural method''' is a method which presupposes a necessary truth about the world. 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.
{{PrintDiagramFile|diagram file=Static-procedural-methods.jpg}}
This theorem explains why all procedural methods are necessarily static. By definition all procedural methods don’t presuppose contingent propositions but only necessary ones. Thus, from a conjunction of: 1. the Method Rejection Theorem (derived in turn from the First Law for Methods and the Zeroth Law or Law of Compatibility), 2. the premise that no procedural method can be incompatible with any other methods, either procedural or substantive, and 3. the premise that procedural methods cannot be replaced by any other methods, it follows that all procedural methods are necessarily static.
|Resource=Barseghyan (2015)
}}
