Pages that link to "Item:Q1173404"

The following pages link to Upper and lower bounds for first order expressibility (Q1173404):

Displaying 40 items.

• Fragments of first-order logic over infinite words (Q537914) (← links)
• The expressiveness of a family of finite set languages (Q672126) (← links)
• The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• On simplicity of formulas (Q757354) (← links)
• Asymptotic probabilities of extension properties and random \(l\)-colourable structures (Q764265) (← links)
• Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
• Definability with bounded number of bound variables (Q922523) (← links)
• When is arithmetic possible? (Q922533) (← links)
• Isomorphisms and 1-L reductions (Q1107310) (← links)
• Properties that characterize LOGCFL (Q1176109) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
• An extension of fixpoint logic with a symmetry-based choice construct (Q1271477) (← links)
• Reflective relational machines (Q1271557) (← links)
• A restricted second order logic for finite structures (Q1271559) (← links)
• On the power of built-in relations in certain classes of program schemes (Q1277684) (← links)
• Logical and schematic characterization of complexity classes (Q1323362) (← links)
• Canonization for two variables and puzzles on the square (Q1361251) (← links)
• Reachability and the power of local ordering (Q1367543) (← links)
• How to define a linear order on finite models (Q1371431) (← links)
• A query language for NC (Q1376409) (← links)
• The Kolmogorov expressive power of Boolean query languages (Q1389450) (← links)
• Path constraints in semistructured databases (Q1591150) (← links)
• Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
• Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
• How many variables are needed to express an existential positive query? (Q2322719) (← links)
• Monadic second-order properties of very sparse random graphs (Q2404656) (← links)
• Large finite structures with few \(L^k\)-types (Q2506492) (← links)
• On the relative expressiveness of description logics and predicate logics (Q2674209) (← links)
• On the Unusual Effectiveness of Logic in Computer Science (Q2736585) (← links)
• Number of variables is equivalent to space (Q2758055) (← links)
• An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models (Q2866740) (← links)
• An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers (Q2947176) (← links)
• Pebble Games over Ordered Structural Abstractions (Q2988831) (← links)
• (Q5091278) (← links)
• A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
• The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)
• Arboreal categories and equi-resource homomorphism preservation theorems (Q6131200) (← links)