Monadic generalized spectra

Cited in

(51)

Graph connectivity, monadic NP and built-in relations of moderate degree
The quantifier structure of sentences that characterize nondeterministic time complexity
On the definability of properties of finite graphs
The fine spectrum of a variety
GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC
Infinitary logics and 0-1 laws
Generalized implicit definitions on finite structures
The closure of monadic NP
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Finite-model theory -- A personal perspective
On sets of relations definable by addition
Tree-width and the monadic quantifier hierarchy.
Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
One unary function says less than two in existential second order logic
The complexity of graph connectivity
Hybrid planning for challenging construction problems: an answer set programming approach
A probabilistic view of Datalog parallelization
Descriptive complexity for counting complexity classes
Infinitary logic for computer science
Comparing the power of monadic NP games
A logical approach to locality in pictures languages
Fifty years of the spectrum problem: survey and new results
Datalog extensions for database queries and updates
Bounds in the propagation of selection into logic programs
A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\)
On winning strategies in Ehrenfeucht-Fraïssé games
First-order spectra with one variable
A Conjecture Concerning the Spectrum of a Sentence
Generalized quantifiers and pebble games on finite structures
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
Partially ordered connectives and monadic monotone strict NP
Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic
Structure and complexity of relational queries
The dimension of the negation of transitive closure
On winning Ehrenfeucht games and monadic NP
Comparing the succinctness of monadic query languages over finite trees
First order quantifiers in monadic second order logic
Existential MSO over two successors is strictly weaker than over linear orders
On spectra of sentences of monadic second order logic with counting
The functional dimension of inductive definitions
First-order spectra with one binary predicate
Nonstandard methods for finite structures
Computing on structures
The monadic quantifier alternation hierarchy over grids and graphs
Comparing the Power of Games on Graphs
Probabilities of First-Order Sentences about Unary Functions
Monadic partition logics and finite automata
Complexity classes and theories of finite models
Almost Everywhere Equivalence of Logics in Finite Model Theory
Can datalog be approximated?
Reachability is harder for directed than for undirected finite graphs

This page was built for publication: Monadic generalized spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4078009)