The following pages link to (Q5732647):
Displaying 50 items.
- Structural completeness in propositional logics of dependence (Q334998) (← links)
- Model-checking games for logics of imperfect information (Q391101) (← links)
- Axiomatizing first-order consequences in independence logic (Q466449) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Transition semantics: the dynamics of dependence logic (Q484952) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Exploring the beta quadrant (Q513919) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Truth and definite truth (Q598266) (← links)
- What languages have Tarski truth definitions? (Q598271) (← links)
- Computational complexity of the semantics of some natural language constructions (Q598312) (← links)
- Dependence of variables construed as an atomic formula (Q636322) (← links)
- From IF to BI. A tale of dependence and separation (Q833040) (← links)
- Independent set readings and generalized quantifiers (Q848211) (← links)
- Variable declarations in natural deduction (Q861825) (← links)
- On the formal semantics of IF-like logics (Q980942) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Henkin and function quantifiers (Q1121872) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Decidability problems in languages with Henkin quantifiers (Q1198829) (← links)
- Game sentences and ultrapowers (Q1210353) (← links)
- IF-logic and truth-definition (Q1267079) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Towards automating duality (Q1343394) (← links)
- Cooperation in games and epistemic readings of independence-friendly sentences (Q1689283) (← links)
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic (Q1693039) (← links)
- Definability hierarchies of generalized quantifiers (Q1824614) (← links)
- General models and entailment semantics for independence logic (Q1949170) (← links)
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
- Complexity results for modal dependence logic (Q1956378) (← links)
- Dependences in strategy logic (Q1987514) (← links)
- Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
- The middle ground-ancestral logic (Q2053352) (← links)
- Solving dependency quantified Boolean formulas using quantifier localization (Q2148900) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Negation and partial axiomatizations of dependence and independence logic revisited (Q2273016) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Hintikka memorial issue: introduction and remarks on Jaakko Hintikka's logical philosophy (Q2334648) (← links)
- Hintikka and the functions of logic (Q2334655) (← links)
- Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- The content of deduction (Q2377192) (← links)
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- On languages with non-homogeneous strings of quantifiers (Q2539410) (← links)
- Axiomatizations of team logics (Q2636536) (← links)
- Lifting QBF Resolution Calculi to DQBF (Q2818035) (← links)
- Leon Henkin the Reviewer (Q3454809) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- Skolem Theory and Generalized Quantifiers (Q3511466) (← links)
