Pages that link to "Item:Q3797174"
From MaRDI portal
The following pages link to Second-order and Inductive Definability on Finite Structures (Q3797174):
Displaying 22 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- An analysis of fixed-point queries on binary trees (Q1183571) (← 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)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- First-order spectra with one binary predicate (Q1350533) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- The closure of monadic NP (Q1577017) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Arity and alternation in second-order logic (Q1919768) (← links)
- European Summer Meeting of the Association for Symbolic Logic, (Logic Colloquium '87), Granada, Spain, 1987 (Q3476783) (← links)
- Reachability is harder for directed than for undirected finite graphs (Q3489984) (← links)
- Second-Order Algebraic Theories (Q3586098) (← links)
- Second Order Definability Via enumerations (Q3982254) (← links)
- (Q4249025) (← links)
- Graph Connectivity, Monadic NP and built-in relations of moderate degree (Q4645196) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- Reconstructing structures with the strong small index property up to bi-definability (Q5226517) (← links)
