Minimal structures for modal tableaux: Some examples | Zendy

Luís Fariñas del Cerro | Zendy; Olivier Gasquet | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Minimal structures for modal tableaux: Some examples

Author(s) -

Luís Fariñas del Cerro,

Olivier Gasquet

Publication year - 2004

Publication title -

logic and logical philosophy

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.416

H-Index - 10

eISSN - 2300-9802

pISSN - 1425-3305

DOI - 10.12775/llp.2000.007

Subject(s) - confluence , modal , semantics (computer science) , computer science , tree (set theory) , mathematics , kripke semantics , modal logic , combinatorics , discrete mathematics , algebra over a field , pure mathematics , programming language , chemistry , polymer chemistry

In this paper we present some examples of decision procedures based on tableau calculus for some mono- and multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted directed acyclic graphs.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research