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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,865

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

Monadic second-order properties of very sparse random graphs.L. B. Ostrovsky & M. E. Zhukovskii - 2017 - Annals of Pure and Applied Logic 168 (11):2087-2101.
Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false.S. N. Popova & M. E. Zhukovskii - 2019 - Annals of Pure and Applied Logic 170 (4):505-514.
The monadic second-order logic of graphs VIII: Orientations.Bruno Courcelle - 1995 - Annals of Pure and Applied Logic 72 (2):103-143.
Circle graphs and monadic second-order logic.Bruno Courcelle - 2008 - Journal of Applied Logic 6 (3):416-442.
The structure of the models of decidable monadic theories of graphs.D. Seese - 1991 - Annals of Pure and Applied Logic 53 (2):169-195.
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.
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.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.

Analytics

Added to PP
2014-01-16

Downloads
10 (#1,467,566)

6 months
2 (#1,686,184)

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