Pages that link to "Item:Q1123616"

The following pages link to Descriptive characterizations of computational complexity (Q1123616):

Displaying 20 items.

• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• Reflective relational machines (Q1271557) (← links)
• How to define a linear order on finite models (Q1371431) (← links)
• A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
• Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
• Descriptive complexity of deterministic polylogarithmic time (Q2303589) (← links)
• Computing queries with higher-order logics (Q2369013) (← links)
• Descriptional complexity and operations -- two non-classical cases (Q2400987) (← links)
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
• On the Computational Complexity of Small Descriptions (Q4277541) (← links)
• On the expressiveness of frame satisfiability and fragments of second-order logic (Q4391423) (← links)
• Computing on structures (Q4630296) (← links)
• Computable Queries for Object Oriented Databases (Q4916216) (← links)
• Expressibility of Higher Order Logics (Q4924534) (← links)
• (Q4945215) (← links)
• A computational model for generic graph functions (Q5096281) (← links)
• The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy (Q5179012) (← links)
• How Hard Is Positive Quantification? (Q5278190) (← links)
• Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207) (← links)