Coalgebraic Predicate Logic: Equipollence Results and Proof Theory
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]
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (LNCS)|
|01_Likak_Coalgebraic_Predicate_Logic:_2013.pdf||3.01 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.