Elementary Properties of the Finite Ranks
From MaRDI portal
Publication:4210837
DOI10.1002/malq.19980440306zbMath0904.03019OpenAlexW2127575428WikidataQ58215744 ScholiaQ58215744MaRDI QIDQ4210837
Scott Weinstein, Kees Doets, Steven Lindell, Anuj Dawar
Publication date: 27 September 1998
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19980440306
first-order definabilitydescriptive complexity theoryfinite rankfinite directed graphsfinite initial segments of the cumulative hierarchy of pure sets
Complexity of computation (including implicit computational complexity) (03D15) Model theory of finite structures (03C13)
Related Items (4)
Ehrenfeucht-Fraïssé games in finite set theory ⋮ The descriptive complexity approach to LOGCFL ⋮ A constant-space sequential model of computation for first-order logic ⋮ Relatives of the Russell Paradox
This page was built for publication: Elementary Properties of the Finite Ranks