BIROn - Birkbeck Institutional Research Online

    Axiomatizability of algebras of binary relations

    Mikulas, Szabolcs (2001) Axiomatizability of algebras of binary relations. In: Lowe, B. and Piwinger, B. and Rasch, T. (eds.) Classical and New Paradigms of Computation and their Complexity Hierarchies: Papers of the conference "Foundations of the Formal Sciences III". Trends in Logic 23. Springer, pp. 187-205. ISBN 9789048167180.

    Full text not available from this repository.

    Abstract

    Book synopsis: The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies. This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 13 Jul 2021 14:53
    Last Modified: 13 Jul 2021 14:53
    URI: https://eprints.bbk.ac.uk/id/eprint/45080

    Statistics

    Downloads
    Activity Overview
    0Downloads
    19Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item