Arrow Research search
Back to Highlights

Highlights 2013

Presentation-invariant definability

Conference Abstract Highlights presentation Logic in Computer Science ยท Theoretical Computer Science

Abstract

We extend the notion of invariant elementary definability to a variety of different graph representations, including those that strictly extend the power of first-order logic with an arbitrary linear order.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Highlights of Logic, Games and Automata
Archive span
2013-2025
Indexed papers
1236
Paper id
345514790758225906
v2026.09.13