Model Theory and Proof Theory of Coalgebraic Predicate Logic

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for several natural classes of such logi...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science 2018, Vol.14, Issue 1
Main Authors: Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano, Lutz Schröder
Format: Article
Language:eng ; jpn
Subjects:
computer science - logic in computer science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completeness results for several natural classes of such logics. Moreover, we show that an entirely general completeness result is not possible. We study the expressive power of our language, both in comparison with coalgebraic hybrid logics and with existing first-order proposals for special classes of Set-coalgebras (apart from relational structures, also neighbourhood frames and topological spaces). Basic model-theoretic constructions and results, in particular ultraproducts, obtain for the two classes that allow completeness---and in some cases beyond that. Finally, we discuss a basic sequent system, for which we establish a syntactic cut-elimination result.
ISSN:1860-5974
DOI:10.23638/LMCS-14(1:22)2018