Skip navigation
Skip navigation

Coalgebraic Predicate Logic: Equipollence Results and Proof Theory

Likak, Tadeusz; Pattinson, Dirk; Sano, Katsuhiko

Description

The recently introduced Coalgebraic Predicate Logic (CPL) provides a general first-order syntax together with extra modal-like operators that are interpreted in a coalgebraic setting. The universality of the coalgebraic approach allows us to instantiate the framework to a wide variety of situations, including probabilistic logic, coalition logic or the logic of neighbourhood frames. The last case generalises a logical setup proposed by C.C. Chang in early 1970's. We provide further evidence of...[Show more]

CollectionsANU Research Publications
Date published: 2013
Type: Journal article
URI: http://hdl.handle.net/1885/66119
Source: Lecture Notes in Computer Science (LNCS)
DOI: 10.1007/978-3-642-36976-6_16

Download

File Description SizeFormat Image
01_Likak_Coalgebraic_Predicate_Logic:_2013.pdf3.01 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator