22
edits
Changes
Jump to navigation
Jump to search
Static Procedural Methods theorem (Barseghyan-2015) (view source)
Revision as of 02:22, 3 March 2017
, 02:22, 3 March 2017no edit summary
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.
Can a procedural method be replaced by another procedural method? No, because procedural methods only presuppose necessary truths and by definition they cannot be incompatible with each other, as they hold in all possible worlds. Therefore, no procedural method can be incompatible with or replace another procedural method. Example: newly accepted mathematical theorem.
Can a procedural method be replaced by a substantive method? No, because substantive methods, by definition, presuppose at least some contingent proposition while procedural methods only necessary ones, which are compatible with any truth, whether contingent or necessary, already accepted into the mosaic. Therefore, no substantive method can be incompatible with or replace any procedural method. Example: deductive inference.
|Resource=Barseghyan (2015)
}}
