A Logic on Subobjects and Recognizability

@inproceedings{Bruggink2010ALO,
  title={A Logic on Subobjects and Recognizability},
  author={H. J. Sander Bruggink and Barbara K{\"o}nig},
  booktitle={IFIP TCS},
  year={2010}
}
  • H. J. Sander Bruggink, Barbara König
  • Published in IFIP TCS 2010
  • Computer Science
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    Graph Automata and Their Application to the Verification of Dynamic Systems

    VIEW 34 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Fuzzy graphs: algebraic structure and syntactic recognition

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Syntactic recognizability of graphs with fuzzy attributes

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES

    The monadic second-order logic of graphs, II: Infinite graphs of bounded width

    • Bruno Courcelle
    • Mathematics, Computer Science
    • Mathematical systems theory
    • 2005
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Graph automata

    VIEW 1 EXCERPT

    Graphsprachen für die Spezifikation von Invarianten bei verteilten und dynamischen Systemen

    • C. Blume
    • Master’s thesis, Universität Duisburg-Essen, Nov.
    • 2008
    VIEW 1 EXCERPT

    Logic, graphs, and algorithms

    • Martin Grohe
    • Mathematics, Computer Science
    • Logic and Automata
    • 2007
    VIEW 1 EXCERPT

    Recognizability of graph and pattern languages

    VIEW 1 EXCERPT

    Adhesive and quasiadhesive categories

    VIEW 1 EXCERPT