Expressibility of Higher Order Logics
From MaRDI portal
Publication:4924534
DOI10.1016/S1571-0661(04)80850-8zbMath1264.03085OpenAlexW2092107489MaRDI QIDQ4924534
Lauri Hella, Jose Maria Turull Torres
Publication date: 6 June 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80850-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Computing queries with higher-order logics ⋮ Arity and alternation: a proper hierarchy in higher order logics ⋮ Expressibility of Higher Order Logics ⋮ The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
Cites Work
- Descriptive characterizations of computational complexity
- Computable queries for relational data bases
- On the expressive power of database queries with intermediate types
- The polynomial-time hierarchy
- Metafinite model theory
- Expressibility of Higher Order Logics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Expressibility of Higher Order Logics
