Towards concept analysis in categories: limit inferior as algebra, limit superior as coalgebra

From MaRDI portal
Publication:5275348

DOI10.4230/LIPICS.CALCO.2015.130zbMATH Open1366.68156arXiv1505.01098OpenAlexW2963614601MaRDI QIDQ5275348FDOQ5275348

Dusko Pavlovic, Toshiki Kataoka

Publication date: 11 July 2017

Abstract: While computer programs and logical theories begin by declaring the concepts of interest, be it as data types or as predicates, network computation does not allow such global declarations, and requires *concept mining* and *concept analysis* to extract shared semantics for different network nodes. Powerful semantic analysis systems have been the drivers of nearly all paradigm shifts on the web. In categorical terms, most of them can be described as bicompletions of enriched matrices, generalizing the Dedekind-MacNeille-style completions from posets to suitably enriched categories. Yet it has been well known for more than 40 years that ordinary categories themselves in general do not permit such completions. Armed with this new semantical view of Dedekind-MacNeille completions, and of matrix bicompletions, we take another look at this ancient mystery. It turns out that simple categorical versions of the *limit superior* and *limit inferior* operations characterize a general notion of Dedekind-MacNeille completion, that seems to be appropriate for ordinary categories, and boils down to the more familiar enriched versions when the limits inferior and superior coincide. This explains away the apparent gap among the completions of ordinary categories, and broadens the path towards categorical concept mining and analysis, opened in previous work.


Full work available at URL: https://arxiv.org/abs/1505.01098











This page was built for publication: Towards concept analysis in categories: limit inferior as algebra, limit superior as coalgebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275348)