The Complexity of Defining a Relation on a Finite Graph

Mathematical Logic Quarterly 33 (3):277-288 (1987)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Relation algebras of every dimension.Roger D. Maddux - 1992 - Journal of Symbolic Logic 57 (4):1213-1229.
Representation operators and computation.Brendan Kitts - 1999 - Minds and Machines 9 (2):223-240.
A geometric zero-one law.Robert H. Gilman, Yuri Gurevich & Alexei Miasnikov - 2009 - Journal of Symbolic Logic 74 (3):929-938.
Infinite Versions of Some Problems from Finite Complexity Theory.Jeffry L. Hirst & Steffen Lempp - 1996 - Notre Dame Journal of Formal Logic 37 (4):545-553.
Handlungsgraphen.Hans Lenk - 1976 - Grazer Philosophische Studien 2 (1):159-172.
The structure of intrinsic complexity of learning.Sanjay Jain & Arun Sharma - 1997 - Journal of Symbolic Logic 62 (4):1187-1201.

Analytics

Added to PP
2013-12-01

Downloads
18 (#833,026)

6 months
6 (#520,776)

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

Model Theory.Gebhard Fuhrken - 1976 - Journal of Symbolic Logic 41 (3):697-699.

Add more references