%0 Conference Paper %1 MossakowskiEtAl07c %A Mossakowski, Till %A Goguen, Joseph %A Diaconescu, Razvan %A Tarlecki, Andrzej %B Logica Universalis %D 2007 %E Beziau, Jean-Yves %I Birkhäuser %K imported %N second edition %P 111-133 %T What is a Logic? (revised version) %U http://dx.doi.org/10.1007/978-3-7643-8354-1_7 %X This paper builds on the theory of institutions, a version of abstract model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual. A natural equivalence relation on institutions is defined such that its equivalence classes are logics. Several invariants are defined for this equivalence, including a Lindenbaum algebra construction, its generalization to a Lindenbaum category construction that includes proofs, and model cardinality spectra; these are used in some examples to show logics inequivalent. Generalizations of familiar results from first order to arbitrary logics are also discussed, including Craig interpolation and Beth definability.

@inproceedings{MossakowskiEtAl07c, abstract = {This paper builds on the theory of institutions, a version of abstract model theory that emerged in computer science studies of software specification and semantics. To handle proof theory, our institutions use an extension of traditional categorical logic with sets of sentences as objects instead of single sentences, and with morphisms representing proofs as usual. A natural equivalence relation on institutions is defined such that its equivalence classes are logics. Several invariants are defined for this equivalence, including a Lindenbaum algebra construction, its generalization to a Lindenbaum category construction that includes proofs, and model cardinality spectra; these are used in some examples to show logics inequivalent. Generalizations of familiar results from first order to arbitrary logics are also discussed, including Craig interpolation and Beth definability.}, added-at = {2016-08-05T15:59:03.000+0200}, author = {Mossakowski, Till and Goguen, Joseph and Diaconescu, Razvan and Tarlecki, Andrzej}, biburl = {https://www.bibsonomy.org/bibtex/221a8e4bdb5d6495f2b72c243a2e489c5/tillmo}, booktitle = {Logica Universalis}, editor = {Beziau, Jean-Yves}, interhash = {1121edfc09f69175fcc25143b8f802fb}, intrahash = {21a8e4bdb5d6495f2b72c243a2e489c5}, keywords = {imported}, number = {second edition}, pages = {111-133}, pdfurl = {http://www.informatik.uni-bremen.de/~till/papers/07-nel.pdf}, publisher = {Birkh{\"a}user}, status = {Reviewed}, timestamp = {2016-08-05T15:59:03.000+0200}, title = {What is a Logic? (revised version)}, url = {http://dx.doi.org/10.1007/978-3-7643-8354-1_7}, year = 2007 }