HackerPapers

arXiv:1701.05408cs.LO

Ologisms

Ruggero Pagnan

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We introduce ologisms. They generate from ologs by extending their logical expressivity, from the possibility of considering constraints of equational nature only to the possibility of considering constraints of syllogistic nature, in addition. This is obtained by taking advantage of the peculiar features of an original diagrammatic logical calculus for the syllogistic, that make it well-behaved with respect to the design of ologs.

arXiv comments
Journal reference
Logical Methods in Computer Science, Volume 14, Issue 3 (August 31, 2018) lmcs:3669
DOI
doi:10.23638/LMCS-14(3:12)2018
Subjects
cs.LOLogic in Computer Science

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Jan 2017 to Jan 2017. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.