Skip to main content
Article thumbnail
Location of Repository

A perspective on Lindström quantifiers and oracles.

By I. A. Stewart

Abstract

This paper presents a perspective on the relationship between Lindström quantifiers in model theory and oracle computations in complexity theory. We do not study this relationship here in full generality (indeed, there is much more work to do in order to obtain a full appreciation), but instead we examine what amounts to a thread of research in this topic running from the motivating results, concerning logical characterizations of nondeterministic polynomial-time, to the consideration of Lindström quantifiers as oracles, and through to the study of some naturally arising questions (and subsequent answers). Our presentation follows the chronological progress of the thread and highlights some important techniques and results at the interface between finite model theory and computational complexity theory

Topics: Finite model theory, Descriptive complexity, Lindström quantifiers, Oracles.
Publisher: Springer
Year: 1999
DOI identifier: 10.1007/3-540-46583-9_3
OAI identifier: oai:dro.dur.ac.uk.OAI2:7028
Journal:

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.