Monadic generalized spectra

Cited in

(55)

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

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)