Results 11 to 20 of about 84,544 (73)
Algebraizable Weak Logics [PDF]
, 2023 We extend the standard framework of abstract algebraic logic to the setting of logics which are not closed under uniform substitution. We introduce the notion of weak logics as consequence relations closed under limited forms of substitutions and we give
Nakov, Georgi +1 more
core
Non-deterministic algebraization of logics by swap structures
, 2021 Multialgebras (or hyperalgebras or non-deterministic algebras) have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing ...
Golzio, Ana Claudia +2 more
core +1 more source
Spatial Logics for Bigraphs [PDF]
, 2005 Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections.
Conforti, G., Macedonio, D., Sassone, V.
core +2 more sources
Modal Logics are Coalgebraic [PDF]
, 2008 Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts.
Pattinson, Dirk +4 more
core +2 more sources
Modular Games for Coalgebraic Fixed Point Logics [PDF]
, 2008 We build on existing work on finitary modular coalgebraic logics [3,4], which we extend with general fixed points, including CTL- and PDL-like fixed points, and modular evaluation games.
Sadrzadeh, Mehrnoosh, Cirstea, Corina
core +2 more sources
Modular Construction of Modal Logics
, 2004 We present a modular approach to defining logics for a wide variety of state-based systems. We use coalgebras to model the behaviour of systems, and modal logics to specify behavioural properties of systems.
Pattinson, Dirk, Cirstea, Corina
core +2 more sources
Maximal traces and path-based coalgebraic temporal logics [PDF]
, 2011 This paper gives a general coalgebraic account of temporal logics whose semantics involves a notion of computation path. Examples of such logics include the logic CTL* for transition systems and the logic PCTL for probabilistic transition systems.
Cirstea, Corina, Corina Cîrstea
core +1 more source
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics [PDF]
, 2010 This paper gives a general coalgebraic account of the notions of possibly infinite trace and possibly infinite execution in state-based, dynamical systems, by extending the generic theory of finite traces and executions developed by Hasuo and coauthors ...
Cirstea, Corina, Corina Cîrstea
core +2 more sources
Institutional logics, blended and suspended [PDF]
, 2014 This paper examines how a new institution, a code of conduct, arises and develops over time. It shows how the process of debate airs competing logics, questions and fails to question assumptions taken for granted, and yet achieves a large degree of ...
Nordberg, Donald
core +2 more sources
Model checking linear coalgebraic temporal logics: an automata-theoretic approach [PDF]
, 2011 We extend the theory of maximal traces of pointed non-deterministic coalgebras by providing an automata-based characterisation of the set of maximal traces for finite such coalgebras.
Cirstea, Corina, Corina Cîrstea
core +1 more source