Abstract
We introduce a simple logic that allows to quantify over the subobjects of a categorical object. We subsequently show that, for the category of graphs, this logic is equally expressive as second-order monadic graph logic (msogl). Furthermore we show that for the more general setting of hereditary pushout categories, a class of categories closely related to adhesive categories, we can recover Courcelle’s result that every msogl-expressible property is recognizable. This is done by giving an inductive translation of formulas of our logic into so-called automaton functors which accept recognizable languages of cospans.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Blume, C.: Graphsprachen für die Spezifikation von Invarianten bei verteilten und dynamischen Systemen. Master’s thesis, Universität Duisburg-Essen (November 2008)
Blume, C., Sander Bruggink, H.J., König, B.: Recognizable graph languages for checking invariants. In: Proc. of GT-VMT ’10 (Workshop on Graph Transformation and Visual Modeling Techniques), Electronic Communications of the EASST (2010)
Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403–418. Springer, Heidelberg (2000)
Bozapalidis, S., Kalampakas, A.: Recognizability of graph and pattern languages. Acta Informatica 42(8/9), 553–581 (2006)
Bozapalidis, S., Kalampakas, A.: Graph automata. Theoretical Computer Science 393, 147–165 (2008)
Bruggink, H.J.S., König, B.: On the recognizability of arrow and graph languages. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 336–350. Springer, Heidelberg (2008)
Courcelle, B.: The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, ch. 5, Foundations, vol. 1, World Scientific, Singapore (1997)
Courcelle, B., Durand, I.: Verifying monadic second order graph properties with tree automata. In: European Lisp Symposium (May 2010)
Geser, A., Hofbauer, D., Waldmann, J.: Match-bounded string rewriting systems. Applicable Algebra in Engineering, Communication and Computing 15(3-4), 149–171 (2004)
Griffing, G.: Composition-representative subsets. Theory and Applications of Categories 11(19), 420–437 (2003)
Grohe, M.: Logic, graphs and algorithms. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata – History and Perspectives. Amsterdam University Press (2007)
Heindel, T.: A category theoretical approach to the concurrent semantics of rewriting. PhD thesis, Universität Duisburg–Essen (September 2009), http://www.ti.inf.uni-due.de/people/heindel/diss.pdf
Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundation of Mathematics, vol. 141. Elsevier, Amsterdam (1999)
Lack, S., Sobociński, P.: Adhesive and quasiadhesive categories. RAIRO – Theoretical Informatics and Applications 39(3) (2005)
Pitts, A.M.: Categorical logic. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science V. Oxford University Press, Oxford (2001)
Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP
About this paper
Cite this paper
Bruggink, H.J.S., König, B. (2010). A Logic on Subobjects and Recognizability. In: Calude, C.S., Sassone, V. (eds) Theoretical Computer Science. TCS 2010. IFIP Advances in Information and Communication Technology, vol 323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15240-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-15240-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15239-9
Online ISBN: 978-3-642-15240-5
eBook Packages: Computer ScienceComputer Science (R0)