Abstract
The paper discusses a possible way of justifying the existence of a multiplicity of cryptomorphic axiomatic theories. It is argued that what renders this multiplicity inevitable are the applications of the theory. They give rise to difficulties whose solution necessitates the application of different conceptual tools. The paper is organized as follows: (§1) introduces the concept of cryptomorphism and the canonic example for the phenomenon: matroid theory; (§2) discusses five cryptomorphic approaches to the definition of rationality in the framework of decision theory: through utility functions, weak orders, choice operators, layered permutations, and pop-stack sortability; (§3) shows that each of these different approaches can serve as a basis for the introduction of a different modification of the original theory. This establishes the heuristic value of cryptomorphic approaches in the domain of decision theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
