scientific article; zbMATH DE number 1162796
This thesis contains five chapters which are about evolving algebras and its meta-logic. The reader is introduced in the realm of evolving algebras in Chapter 2. This chapter contains an overview about the use of evolving algebras and justifies the study carried out in this thesis. Moreover, a tutorial introduction is given to the subject. In the introduction, an example is given of a simple evolving algebra that specifies a stack based string reverse algorithm. This sample evolving algebra will be used throughout the different chapters of the thesis as running example. In Chapters 3 and 4 the meta-logic is treated. This logic, called \(E\)-logic, is classically two-valued. It deviates from classical logic in three respects. Firstly, it allows for empty domains; secondly, terms can be non-denoting; and finally, it has a more general notion of substitution which can produce, what we call, extended function symbols and extended terms. It appears that this logic is suitable to reason about evolving algebras. Our version of \(E\)-logic is derived from the logic with existence predicate introduced by D. Scott. We provided this logic with a Fitch-style deduction system. Moreover, we proved soundness and completeness of this logic in the version with extended function symbols and extended terms. We also defined a number of model theoretic operators, which we have used in Chapter 5 to define the operational semantics of evolving algebras, and we proved some results about them. Chapter 5 deals with the syntax and semantics of evolving algebras. The syntax is partly based on the syntax of \(E\)-logic. Most effort of this chapter has been put into the formalization of the semantics of evolving algebras. Before we could do that properly, we had to define the notion of a consistent evolving algebra. The operational semantics has been defined using the ideas of structured operational semantics pioneered by G. Plotkin. Evolving algebras employ a kind of fine-grained parallelism, which poses the problem of how to formalize the effect of parallel actions. In the semantics, we propose, we solved this problem by reducing the effect of a set of parallel actions to the effects of a corresponding series of actions. Since a semantics is worthless without justification, we analyzed it and proved quite a number of adequacy results about it. These involve renaming bound variables, normal forms, isomorphisms, soundness and completeness. Proving adequacy results for a semantics is useful, since sometimes one is forced to redefine the semantics for reasons of unexpected failures. Chapter 6 brings together logic and computation. In this chapter, we introduce a Hoare calculus, also called axiomatic semantics, for evolving algebras.
- Many-sorted and single-sorted algebras
- scientific article; zbMATH DE number 8772
- Some nuances of many-sorted universal algebra: a review
- scientific article; zbMATH DE number 3918620
- scientific article; zbMATH DE number 868103
- Evolution algebras and their applications
- On evolution algebras
- On the Algebraization of Many-Sorted Logics
- On a class of evolution algebras
- Evolution algebras of arbitrary dimension and their decompositions
- scientific article; zbMATH DE number 5999715 (Why is no real title available?)
- scientific article; zbMATH DE number 490759 (Why is no real title available?)
- scientific article; zbMATH DE number 515735 (Why is no real title available?)
- Evolving Algebras 1993: Lipari Guide
- scientific article; zbMATH DE number 868103 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394353)