The following pages link to Monadic generalized spectra (Q4078009):
Displaying 49 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- A logical approach to locality in pictures languages (Q295631) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- Existential MSO over two successors is strictly weaker than over linear orders (Q837190) (← links)
- First-order spectra with one variable (Q909462) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Datalog extensions for database queries and updates (Q1176285) (← links)
- The functional dimension of inductive definitions (Q1193414) (← links)
- Infinitary logics and 0-1 laws (Q1193591) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- The fine spectrum of a variety (Q1229740) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- First-order spectra with one binary predicate (Q1350533) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- A probabilistic view of Datalog parallelization (Q1389447) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- Probabilities of First-Order Sentences about Unary Functions (Q3041164) (← links)
- Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
- Reachability is harder for directed than for undirected finite graphs (Q3489984) (← links)
- Complexity classes and theories of finite models (Q3942945) (← links)
- A Conjecture Concerning the Spectrum of a Sentence (Q4304096) (← links)
- Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic (Q4333462) (← links)
- Comparing the Power of Games on Graphs (Q4366126) (← links)
- Computing on structures (Q4630296) (← links)
- Graph Connectivity, Monadic NP and built-in relations of moderate degree (Q4645196) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- On sets of relations definable by addition (Q4739895) (← links)
- The dimension of the negation of transitive closure (Q4842619) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees (Q4917997) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- (Q5216300) (← links)
- First order quantifiers in monadic second order logic (Q5311712) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC (Q5880428) (← links)
- Nonstandard methods for finite structures (Q6096330) (← links)
- Hybrid planning for challenging construction problems: an answer set programming approach (Q6161492) (← links)
