Sort Theory — Mappings

  • A. F. Parker-Rhodes
Part of the Synthese Library book series (SYLI, volume 150)


Having in the last chapter explained the basic concepts of Sort theory, and proved a few mostly rather trivial theorems, I now return to consider the questions raised in Chapter III, namely how to construct valid representations of Sorts. Obviously, any such representation will be some kind of mapping; equally obviously, the concept of a ‘mapping’ is likely to appear in Sort theory, if at all, in a more or less distorted form. In this chapter, I shall try to show that the necessary logical properties which attach to the main types of mappings in Set theory do apply also to certain mappings between Sorts, and that by their means we can apply the ideas of Chapter III to Sorts. The mathematical procedures required will be explained and applied in the course of Chapters VI and VII.


Chapter Versus Quadrivalent Functor Sharp Element Reidel Publishing Company Perfect Sort 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© D. Reidel Publishing Company, Dordrecht, Holland 1981

Authors and Affiliations

  • A. F. Parker-Rhodes

There are no affiliations available

Personalised recommendations