Pages that link to "Item:Q922523"

The following pages link to Definability with bounded number of bound variables (Q922523):

Displaying 25 items.

• On inflationary fix-point operators safety (Q266210) (← links)
• Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
• The \(k\)-variable property is stronger than H-dimension \(k\) (Q676186) (← links)
• On simplicity of formulas (Q757354) (← links)
• Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
• Finite \(H\)-dimension does not imply expressive completeness (Q1337512) (← links)
• How to define a linear order on finite models (Q1371431) (← links)
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability (Q1377625) (← links)
• Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
• Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
• Deciding the guarded fragments by resolution (Q1867216) (← links)
• Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
• Varieties (Q2074217) (← links)
• The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT (Q2251124) (← links)
• First-order logic with two variables and unary temporal logic (Q2506493) (← links)
• The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
• On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing (Q3090822) (← links)
• Almost Everywhere Equivalence of Logics in Finite Model Theory (Q3128483) (← links)
• (Q5009457) (← links)
• (Q5091278) (← links)
• Descriptive complexity of finite structures: Saving the quantifier rank (Q5718668) (← links)
• The axiom of elementary sets on the edge of Peircean expressibility (Q5718697) (← links)