Model Theory and Proof Theory of Coalgebraic Predicate Logic

Litak T, Pattinson D, Sano K, Schröder L (2018)


Publication Language: English

Publication Status: Published

Publication Type: Journal article, Original article

Publication year: 2018

Journal

Publisher: LOGICAL METHODS COMPUTER SCIENCE E V

Book Volume: 14

Journal Issue: 1

DOI: 10.23638/LMCS-14(1:22)2018

Open Access Link: https://doi.org/10.23638/LMCS-14(1:22)2018

Abstract

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.

Authors with CRIS profile

Related research project(s)

Involved external institutions

How to cite

APA:

Litak, T., Pattinson, D., Sano, K., & Schröder, L. (2018). Model Theory and Proof Theory of Coalgebraic Predicate Logic. Logical Methods in Computer Science, 14(1). https://dx.doi.org/10.23638/LMCS-14(1:22)2018

MLA:

Litak, Tadeusz, et al. "Model Theory and Proof Theory of Coalgebraic Predicate Logic." Logical Methods in Computer Science 14.1 (2018).

BibTeX: Download