Pages that link to "Item:Q1893734"

The following pages link to Infinitary logic and inductive definability over finite structures (Q1893734):

Displaying 47 items.

• On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
• Recursive definitions and fixed-points on well-founded structures (Q654910) (← links)
• Computing with infinitary logic (Q672337) (← links)
• The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
• Languages PQL and FO+LFP remain equivalent even in the absence of order (Q677720) (← links)
• The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• A restricted second order logic for finite structures (Q1271559) (← links)
• Normalizable linear orders and generic computations in finite models (Q1306793) (← links)
• Canonization for two variables and puzzles on the square (Q1361251) (← 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)
• Querying spatial databases via topological invariants (Q1591156) (← links)
• Lindenbaum and pair extension lemma in infinitary logics (Q1799275) (← links)
• Logical hierarchies in PTIME (Q1817218) (← links)
• Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
• Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
• Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
• A new hierarchy of infinitary logics in abstract algebraic logic (Q2363502) (← links)
• Infinity and verifiability in Carnap's inductive logic (Q2446679) (← links)
• Large finite structures with few \(L^k\)-types (Q2506492) (← links)
• An infinitary system for the least fixed-point logic restricted to finite models (Q2866740) (← links)
• (Q3984864) (← links)
• Finite Variable Logics in Descriptive Complexity Theory (Q4254565) (← links)
• (Q4263867) (← links)
• (Q4335229) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• (Q4395613) (← links)
• Stability theory, permutations of indiscernibles, and embedded finite models (Q4505906) (← links)
• On fixed-point logic with counting (Q4508261) (← links)
• RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
• Computing on structures (Q4630296) (← links)
• Implicit definability and infinitary logic in finite model theory (Q4645216) (← links)
• (Q4695118) (← links)
• The expressive power of fixed-point logic with counting (Q4879905) (← links)
• Infinitary logic for computer science (Q5204339) (← links)
• Computer Science Logic (Q5311269) (← links)
• The Relational Polynomial-Time Hierarchy and Second-Order Logic (Q5504578) (← links)
• WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE? (Q5884253) (← links)
• On the expressibility and the computability of untyped queries (Q5936000) (← links)
• Relation algebras from cylindric algebras. I (Q5956889) (← links)
• Preservation theorems in finite model theory (Q6064296) (← links)
• A query language for NC (extended abstract) (Q6064297) (← links)
• First order logic, fixed point logic and linear order (Q6560167) (← links)
• Game comonads \& generalised quantifiers (Q6597958) (← links)
• Constraint satisfaction, graph isomorphism, and the pebbling comonad (Q6612794) (← links)