Bisimulations between generalized Veltman models and Veltman models | Zendy

Vuković Mladen | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Bisimulations between generalized Veltman models and Veltman models

Author(s) -

Vuković Mladen

Publication year - 2008

Publication title -

mathematical logic quarterly

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.473

H-Index - 28

eISSN - 1521-3870

pISSN - 0942-5616

DOI - 10.1002/malq.200710050

Subject(s) - interpretability , mathematics , semantics (computer science) , algebra over a field , pure mathematics , extension (predicate logic) , artificial intelligence , computer science , programming language

Interpretability logic is an extension of provability logic. Veltman models and generalized Veltman models are two semantics for interpretability logic. We consider a connection between Veltman semantics and generalized Veltman semantics. We prove that for a complete image‐finite generalized Veltman model W there is a Veltman model W ′ that is bisimular to W . (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research