Concept

Many-sorted logic

Summary
Many-sorted logic can reflect formally our intention not to handle the universe as a homogeneous collection of objects, but to partition it in a way that is similar to types in typeful programming. Both functional and assertive "" in the language of the logic reflect this typeful partitioning of the universe, even on the syntax level: substitution and argument passing can be done only accordingly, respecting the "sorts". There are various ways to formalize the intention mentioned above; a many-sorted logic is any package of information which fulfils it. In most cases, the following are given:
  • a set of sorts, S
  • an appropriate generalization of the notion of signature to be able to handle the additional information that comes with the sorts. The domain of discourse of any structure of that signature is then fragmented into disjoint subsets, one for every sort.
Example When reasoning about biological organisms, it is useful to distinguish two sorts: \mathrm{plant}
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading