Descriptive complexity of modularity problems on graphs

Bulletin of the Section of Logic 34 (2):61-75 (2005)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

19th workshop on logic, language, information and computation (wollic 2012).Luke Ong, Carlos Areces, Santiago Figueira & Ruy de Queiroz - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Cycles in Nielsen's Graphs.Anna Bien - 2010 - Bulletin of the Section of Logic 39 (1/2):57-64.
On some games played on finite graphs.Bakhadyr Khoussainov - 2002 - Bulletin of the Section of Logic 31 (2):71-79.
Descriptive Complexity.Steven Lindell - 2001 - Bulletin of Symbolic Logic 7 (4):525-527.
On the degree of matrix complexity of Johansson's minimal logic.Jacek Hawranek - 1984 - Bulletin of the Section of Logic 13 (1):50-52.
G. Birkhoff's theorems for regular varieties.Ewa Graczynska - 1997 - Bulletin of the Section of Logic 26 (4).
Time complexity of a proof–search procedure for k4.Toshimasa Matsumoto - 2003 - Bulletin of the Section of Logic 32 (4):201-211.

Analytics

Added to PP
2013-10-30

Downloads
40 (#550,858)

6 months
4 (#1,232,791)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references