The following pages link to (Q3077957):
Displayed 47 items.
- Hintikka on the foundations of mathematics: IF logic and uniformity concepts (Q253125) (← links)
- A cirquent calculus system with clustering and ranking (Q301368) (← links)
- A double team semantics for generalized quantifiers (Q302243) (← links)
- IF logic, definitions and the vicious circle principle (Q427230) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Transition semantics: the dynamics of dependence logic (Q484952) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Propositional team logics (Q526967) (← links)
- Upwards closed dependencies in team semantics (Q897651) (← links)
- Hintikka's independence-friendly logic meets Nelson's realizability (Q1653658) (← links)
- Cooperation in games and epistemic readings of independence-friendly sentences (Q1689283) (← links)
- A logical analysis of Monty Hall and Sleeping Beauty (Q1756594) (← links)
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
- Expressivity of imperfect information logics without identity (Q1956377) (← links)
- About effective versions of game theoretical semantics for first-order logic (Q2003259) (← links)
- Complexity of syntactical tree fragments of independence-friendly logic (Q2003922) (← links)
- IF modal logic and classical negation (Q2016064) (← links)
- Randomized semantic games for fuzzy logics (Q2035339) (← links)
- Team semantics for interventionist counterfactuals: observations vs. interventions (Q2037298) (← links)
- From semantic games to provability: the case of Gödel logic (Q2118973) (← links)
- Doubly strongly first order dependencies (Q2148777) (← links)
- From truth degree comparison games to sequents-of-relations calculi for Gödel logic (Q2169133) (← links)
- A simple logic of functional dependence (Q2240545) (← links)
- A logic with revocable and refinable strategies (Q2346411) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- Positive logics (Q2700818) (← links)
- Ockham’s Razor in Probability Logic (Q2805815) (← links)
- On Semantic Games for Łukasiewicz Logic (Q3299579) (← links)
- Dynamic Logics of Imperfect Information: From Teams and Games to Transitions (Q3299581) (← links)
- Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
- Modeling Monty Hall in If Logic (Q3299843) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- Game Theoretical Semantics for Paraconsistent Logics (Q3457682) (← links)
- Game theoretical semantics for some non-classical logics (Q4586163) (← links)
- Imperfect Information in Logic and Concurrent Games (Q4922070) (← links)
- ON EXISTENTIAL DECLARATIONS OF INDEPENDENCE IN IF LOGIC (Q4928773) (← links)
- (Q5020523) (← links)
- Connecting Sequent Calculi with Lorenzen-Style Dialogue Games (Q5024728) (← links)
- DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS (Q5177884) (← links)
- CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES (Q5195061) (← links)
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION (Q5241230) (← links)
- On Dependence Logic (Q5249667) (← links)
- An Alternative Analysis of Signaling Games (Q5249682) (← links)
- Good-for-Game QPTL: An Alternating Hodges Semantics (Q5875946) (← links)
- Independence-friendly logic without Henkin quantification (Q5918342) (← links)
- Diversity, dependence and independence (Q5918485) (← links)
- Alternating (in)dependence-friendly logic (Q6076360) (← links)