Search

The paper presents two approaches to model System-of-Systems on lative logic point of view. Lative logic is a general framework to construct building blocks of logic using Category Theory as its metalanguage. This approach reveals avenues to describe System-of-Systems themselves, and to model information and processes they posess, using some reasonable modelling languages in a computational manner, thus, touching foundations of computational science. After presenting some preliminary notes, the paper explains the main steps to construct lative logics, and then give two approaches to System-of-System modelling. Finally, the paper presents a survey to some applications. [ABSTRACT FROM AUTHOR]

In this paper we will show how purely categorical constructions of terms are advantageous when investigating situations concerning uncertainty; more specifically where uncertainty comes from and how uncertainty is integrated when dealing with terms over selected signatures. There are basically two ways of invoking uncertainty for terms. On one hand, we may proceed by building composed monads where uncertainty is provided by some suitable monad composed with the traditional term monad. On the other hand, we can provide a strictly formal basis for term monads being created over categories themselves carrying uncertainty. This is the distinction between ‘computing with fuzzy’ and ‘fuzzy computing’ and the fundamental question raised by these constructions is where uncertainty resides in language constructions for logic. This paper also shows how the notion of signature often needs to be expanded to levels of signatures, in particular when dealing with type constructors. Such levels allow us to strictly delineate, e.g., primitive operations, type terms, and value level terms. Levels of signature will in this paper be exemplified by the construction of the signature of simply typed lambda calculus. [ABSTRACT FROM AUTHOR]