Mechanizing a Particularly Expressive Many Sorted Logic
Abstract
A particularly expressive many sorted logic is presented along with an outline of an implementation. The logic allows functions and predicates to be sorted polymorphically and the sortspace to be partially ordered. It is shown that truth values may sometimes be inferred solely on the basis of sort information.
Cite
Text
Cohn. "Mechanizing a Particularly Expressive Many Sorted Logic." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Cohn. "Mechanizing a Particularly Expressive Many Sorted Logic." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/cohn1979ijcai-mechanizing/)BibTeX
@inproceedings{cohn1979ijcai-mechanizing,
title = {{Mechanizing a Particularly Expressive Many Sorted Logic}},
author = {Cohn, Anthony G.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {162-164},
url = {https://mlanthology.org/ijcai/1979/cohn1979ijcai-mechanizing/}
}