A spectrum hierarchy
From MaRDI portal
Publication:4068694
DOI10.1002/malq.19750210117zbMath0311.02020OpenAlexW2044122859MaRDI QIDQ4068694
Publication date: 1975
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19750210117
Related Items
Universal quantifiers and time complexity of random access machines ⋮ On the Ehrenfeucht-Fraïssé game in theoretical computer science ⋮ Arithmetical definability and computational complexity ⋮ A logical approach to locality in pictures languages ⋮ First-order spectra with one binary predicate ⋮ Arity and alternation: a proper hierarchy in higher order logics ⋮ Graph properties checkable in linear time in the number of vertices ⋮ A Conjecture Concerning the Spectrum of a Sentence ⋮ Rudimentary Languages and Second‐Order Logic ⋮ Fifty years of the spectrum problem: survey and new results ⋮ Finite-model theory -- A personal perspective ⋮ On the Encoding of Relations by Graphs ⋮ The ultra-weak Ash conjecture and some particular cases ⋮ First-order definability on finite structures ⋮ Unnamed Item ⋮ Investigation of binary spectra by explicit polynomial transformations of graphs ⋮ Existential second-order logic and modal logic with quantified accessibility relations
