Litak, Tadeusz and Pattinson, Dirk and Sano, Katsuhiko and Schröder, Lutz - Model Theory and Proof Theory of Coalgebraic Predicate Logic

lmcs:4390 - Logical Methods in Computer Science, March 20, 2018, Volume 14, Issue 1
Model Theory and Proof Theory of Coalgebraic Predicate Logic

Authors: Litak, Tadeusz and Pattinson, Dirk and Sano, Katsuhiko and Schröder, Lutz

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.


Source : oai:arXiv.org:1701.03773
DOI : 10.23638/LMCS-14(1:22)2018
Volume: Volume 14, Issue 1
Published on: March 20, 2018
Submitted on: January 16, 2017
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 301 times.
This article's PDF has been downloaded 166 times.