The monadic second-order logic of graphs IV: Definability properties of equational graphs

Annals of Pure and Applied Logic 49 (3):193 (1990)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(90)90027-y

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Graph structure and monadic second-order logic: a language-theoretic approach.B. Courcelle - 2012 - New York: Cambridge University Press. Edited by Joost Engelfriet.
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second‐Order Logic.Iain A. Stewart - 1997 - Mathematical Logic Quarterly 43 (1):1-21.
The monadic second-order logic of graphs VIII: Orientations.Bruno Courcelle - 1995 - Annals of Pure and Applied Logic 72 (2):103-143.
Random graphs in the monadic theory of order.Shmuel Lifsches & Saharon Shelah - 1999 - Archive for Mathematical Logic 38 (4-5):273-312.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
Circle graphs and monadic second-order logic.Bruno Courcelle - 2008 - Journal of Applied Logic 6 (3):416-442.
The monadic second-order logic of graphs XV: On a conjecture by D. Seese.Bruno Courcelle - 2006 - Journal of Applied Logic 4 (1):79-114.
Towards a characterization of order-invariant queries over tame graphs.Michael A. Benedikt & Luc Segoufin - 2009 - Journal of Symbolic Logic 74 (1):168-186.
A note on definability in equational logic.George Weaver - 1994 - History and Philosophy of Logic 15 (2):189-199.
Erdős graphs resolve fine's canonicity problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
Characterizing Definability of Second-Order Generalized Quantifiers.Juha Kontinen & Jakub Szymanik - 2011 - In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Two cardinal properties of homogeneous graphs.Gregory Cherlin & Simon Thomas - 2002 - Journal of Symbolic Logic 67 (1):217-220.
Monadic Bounded Algebras.Galym Akishev & Robert Goldblatt - 2010 - Studia Logica 96 (1):1 - 40.

Analytics

Added to PP
2014-01-16

Downloads
6 (#1,434,892)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Simple monadic theories and partition width.Achim Blumensath - 2011 - Mathematical Logic Quarterly 57 (4):409-431.

Add more citations

References found in this work

Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
Weakly Definable Relations and Special Automata.Michael O. Rabin - 1975 - Journal of Symbolic Logic 40 (4):622-623.

Add more references