Pages that link to "Item:Q1173404"
From MaRDI portal
The following pages link to Upper and lower bounds for first order expressibility (Q1173404):
Displaying 15 items.
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering (Q5044764) (← links)
- (Q5091278) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Infinitary logic for computer science (Q5204339) (← links)
- The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)
- GAMES AND CARDINALITIES IN INQUISITIVE FIRST-ORDER LOGIC (Q5880428) (← links)
- Metafinite model theory (Q6064289) (← links)
- Preservation theorems in finite model theory (Q6064296) (← links)
- Arboreal categories and equi-resource homomorphism preservation theorems (Q6131200) (← links)
- Count-free Weisfeiler-Leman and group isomorphism (Q6545240) (← links)
- First order logic, fixed point logic and linear order (Q6560167) (← links)
- The pebble-relation comonad in finite model theory (Q6563056) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
- The pebble-relation comonad in finite model theory (Q6649442) (← links)
