6 research outputs found

    Robinson consistency in many-sorted hybrid first-order logics

    Get PDF
    In this paper we prove a Robinson consistency theorem for a class of many-sorted hybrid logics as a consequence of an Omitting Types Theorem. An important corollary of this result is an interpolation theorem

    Specification and Verification of Invariant Properties of Transition Systems

    Get PDF

    Constructor-based Logics

    No full text
    Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized asinstitutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions.

    Constructor-based Logics

    No full text
    Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized asinstitutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions.

    Constructor-based logics

    No full text
    Abstract: Many computer science applications concern properties that are true for a restricted class of models. In this paper, a couple of constructor-based institutions are presented. These institutions are defined on top of some base institutions, roughly speaking, by enhancing the syntax with constructor symbols and restricting the semantics to models with elements that are reachable by constructors. The proof rules for the constructor-based Horn logics, formalized as institutions, are defined in this paper, and a proof of completeness is provided in the abstract framework of institutions
    corecore