Descriptive Complexity

Bulletin of Symbolic Logic 7 (4):525-527 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2687799

Links

PhilArchive



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

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

Logics which capture complexity classes over the reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
Descriptive complexity theories.Joerg Flum - 2003 - Theoria 18 (1):47-58.
Finite Model Theory.Heinz-Dieter Ebbinghaus & Jörg Flum - 2005 - Springer.
Descriptive Complexity Theories.Joerg Flum - 2010 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 18 (1):47-58.
Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
Descriptive Complexity.Neil Immerman - 1998 - Springer Verlag.
Logics Which Capture Complexity Classes Over the Reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
Succinctness as a source of complexity in logical formalisms.Georg Gottlob, Nicola Leone & Helmut Veith - 1999 - Annals of Pure and Applied Logic 97 (1-3):231-260.
Comparing the power of games on graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.
Capturing Relativized Complexity Classes with Lindström Quantifiers.Janos Makowsky - 1995 - Vienna Circle Institute Yearbook 3:133-140.
Complexity and sustainability.Jennifer Wells - 2013 - New York: Routledge.
Scales of minimal complexity in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${K(\mathbb{R})}$$\end{document}. [REVIEW]Daniel W. Cunningham - 2012 - Archive for Mathematical Logic 51 (3-4):319-351.
Simply complexity: a clear guide to complexity theory.Neil F. Johnson - 2007 - Oxford: Oneworld. Edited by Neil F. Johnson.
Capturing Relativized Complexity Classes without Order.Anuj Dawar, Georg Gottlob & Lauri Hella - 1998 - Mathematical Logic Quarterly 44 (1):109-122.

Analytics

Added to PP
2013-11-21

Downloads
13 (#1,036,661)

6 months
7 (#430,521)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
On a Question of Krajewski's.Fedor Pakhomov & Albert Visser - 2019 - Journal of Symbolic Logic 84 (1):343-358.

View all 14 citations / Add more citations

References found in this work

No references found.

Add more references