Pages that link to "Item:Q1088983"

The following pages link to Henkin quantifiers and complete problems (Q1088983):

Displaying 33 items.

• Model-checking games for logics of imperfect information (Q391101) (← links)
• Equilibrium semantics of languages of imperfect information (Q636301) (← links)
• Monadic partition logics and finite automata (Q671644) (← links)
• Functional interpretations of linear and intuitionistic logic (Q964504) (← links)
• Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
• Henkin and function quantifiers (Q1121872) (← links)
• Descriptive characterizations of computational complexity (Q1123616) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• IF-logic and truth-definition (Q1267079) (← links)
• Partially interpreted relations and partially interpreted quantifiers (Q1277330) (← links)
• Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
• A logical analysis of Monty Hall and Sleeping Beauty (Q1756594) (← links)
• Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
• Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
• Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
• Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315) (← links)
• On the computational consequences of independence in propositional logic (Q2500830) (← links)
• Inductive definitions over finite structures (Q2639057) (← links)
• A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
• Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
• The Computational Complexity of Quantified Reciprocals (Q3623832) (← links)
• Relativized logspace and generalized quantifiers over finite ordered structures (Q4358054) (← links)
• 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 (Q4432544) (← links)
• The complexity class θp2: Recent results and applications in AI and modal logic (Q5055917) (← links)
• Dependency Concepts up to Equivalence. (Q5079749) (← links)
• DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS (Q5177884) (← links)
• Games for Inclusion Logic and Fixed-Point Logic (Q5213642) (← links)
• Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
• 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 (Q5421032) (← links)
• Generalized quantification as substructural logic (Q5687328) (← links)
• Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
• Alternating (in)dependence-friendly logic (Q6076360) (← links)