1. Johan van Benthem, Jan van Eijck & Vera Stebletsova, Modal Logic, Transition Systems and Processes.
    Transition systems can be viewed either as process diagrams or as Kripke structures. The rst perspective is that of process theory, the second that of modal logic. This paper shows how various formalisms of modal logic can be brought to bear on processes. Notions of bisimulation can not only be motivated by operations on transition systems, but they can also be suggested by investigations of modal formalisms. To show that the equational view of processes from process algebra is closely related (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Vera Stebletsova & Yde Venema (2001). Undecidable Theories of Lyndon Algebras. Journal of Symbolic Logic 66 (1):207-224.
    With each projective geometry we can associate a Lyndon algebra. Such an algebra always satisfies Tarski's axioms for relation algebras and Lyndon algebras thus form an interesting connection between the fields of projective geometry and algebraic logic. In this paper we prove that if G is a class of projective geometries which contains an infinite projective geometry of dimension at least three, then the class L(G) of Lyndon algebras associated with projective geometries in G has an undecidable equational theory. In (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  3. Vera Stebletsova (2000). Weakly Associative Relation Algebras with Polyadic Composition Operations. Studia Logica 66 (2):297-323.
    In this paper we introduced various classes of weakly associative relation algebras with polyadic composition operations. Among them is the class RWA of representable weakly associative relation algebras with polyadic composition operations. Algebras of this class are relativized representable relation algebras augmented with an infinite set of operations of increasing arity which are generalizations of the binary relative composition. We show that RWA is a canonical variety whose equational theory is decidable.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation