Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

AIML
2008

favoriteEmaildiscussreport

211views Logical Reasoning» more AIML 2008»

Proof systems for the coalgebraic cover modality

13 years 6 months ago

Proof systems for the coalgebraic cover modality

Download www.aiml.net

abstract. We investigate an alternative presentation of classical and positive modal logic where the coalgebraic cover modality is taken as primitive. For each logic, we present a sound and complete Hilbert-style axiomatization. Moreover, we give a two-sided sound and complete sequent calculus for the negation-free language, and for the language with negation we provide a one-sided sequent calculus which is sound, complete and cut-free.

Marta Bílková, Alessandra Palmigiano

Real-time Traffic

AIML 2008 | Complete Sequent Calculus | Logical Reasoning | Positive Modal Logic | Sequent Calculus |

claim paper

Related Content

» A Finite Model Construction for Coalgebraic Modal Logic

» Named Models in Coalgebraic Hybrid Logic

» Automata for Coalgebras An Approach Using Predicate Liftings

» Strong Completeness of Coalgebraic Modal Logics

» Functorial Coalgebraic Logic The Case of Manysorted Varieties

» Modular Construction of Modal Logics

» PSPACE Bounds for Rank1 Modal Logics

» The craft of model making PSPACE bounds for noniterative modal logics

» Termination for Hybrid Tableaus

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	AIML
Authors	Marta Bílková, Alessandra Palmigiano, Yde Venema

Comments (0)