Arrow Research search
Back to CSL

CSL 2009

Fixed-Point Definability and Polynomial Time

Invited Paper Invited Talks Logic in Computer Science ยท Theoretical Computer Science

Abstract

Abstract My talk will be a survey of recent results about the quest for a logic capturing polynomial time.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Annual Conference on Computer Science Logic
Archive span
1988-2026
Indexed papers
1413
Paper id
14088968313930