The following pages link to (Q3446107):
Displaying 50 items.
- Propositional union closed team logics (Q2131275) (← links)
- Doubly strongly first order dependencies (Q2148777) (← links)
- On the expressive power of TeamLTL and first-order team logic over hyperproperties (Q2148802) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Data-informed knowledge and strategies (Q2152494) (← links)
- Coherence in inquisitive first-order logic (Q2159932) (← links)
- Separation logic and logics with team semantics (Q2172820) (← links)
- Unifying hidden-variable problems from quantum mechanics by logics of dependence and independence (Q2172822) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- On the Presburger fragment of logics with multiteam semantics (Q2172824) (← links)
- On definability of team relations with \(k\)-invariant atoms (Q2172825) (← links)
- On intermediate inquisitive and dependence logics: an algebraic study (Q2172827) (← links)
- Embedding causal team languages into predicate logic (Q2172831) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- Questions and dependency in intuitionistic logic (Q2176408) (← links)
- On the complexity of linear temporal logic with team semantics (Q2193280) (← links)
- A simple logic of functional dependence (Q2240545) (← links)
- Generalized quantifiers in dependence logic (Q2255198) (← links)
- The expressive power of \(k\)-ary exclusion logic (Q2273014) (← links)
- Characterising modal definability of team-based logics via the universal modality (Q2273015) (← links)
- Negation and partial axiomatizations of dependence and independence logic revisited (Q2273016) (← links)
- Explicating logical independence (Q2301324) (← links)
- Hintikka and the functions of logic (Q2334655) (← links)
- A logic with revocable and refinable strategies (Q2346411) (← links)
- Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- A logic for arguing about probabilities in measure teams (Q2402954) (← links)
- Semantic games with chance moves revisited: from IF logic to partial logic (Q2441754) (← links)
- The grammar of quantification and the fine structure of interpretation contexts (Q2443334) (← links)
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies (Q2453581) (← links)
- A finite axiomatization of conditional independence and inclusion dependencies (Q2629853) (← links)
- Axiomatizations of team logics (Q2636536) (← links)
- Positive logics (Q2700818) (← links)
- Ockham’s Razor in Probability Logic (Q2805815) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- A Logical Approach to Context-Specific Independence (Q2820693) (← links)
- A Multi-type Calculus for Inquisitive Logic (Q2820696) (← links)
- The Expressive Power of k-ary Exclusion Logic (Q2820708) (← links)
- Characterizing Relative Frame Definability in Team Semantics via the Universal Modality (Q2820709) (← links)
- Information Flow Under Budget Constraints (Q2835882) (← links)
- Complexity of Model Checking for Modal Dependence Logic (Q2891371) (← links)
- Relative computability and uniform continuity of relations (Q2930869) (← links)
- Complexity of Propositional Independence and Inclusion Logic (Q2946342) (← links)
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict (Q2946343) (← links)
- Forcing, Multiverse and Realism (Q3295824) (← links)
- Dynamic Logics of Imperfect Information: From Teams and Games to Transitions (Q3299581) (← links)
- Beyond Knowing That: A New Generation of Epistemic Logics (Q3299590) (← links)
- (Q3384064) (← links)
- (Q3384878) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
