scientific article; zbMATH DE number 4118333
From MaRDI portal
Publication:4732440
zbMath0683.03004MaRDI QIDQ4732440
Gabriel Sandu, Jaakko Hintikka
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
game-theoretical semanticsbranching quantifiersgames with imperfect informationinformational independencelogical analysis of natural language
Philosophical and critical aspects of logic and foundations (03A05) Logic of natural languages (03B65)
Related Items (74)
Boolean dependence logic and partially-ordered connectives ⋮ Dependence logic with a majority quantifier ⋮ A double team semantics for generalized quantifiers ⋮ Game Theoretical Semantics for Paraconsistent Logics ⋮ Axiomatizations of team logics ⋮ Doubly strongly first order dependencies ⋮ Structural completeness in propositional logics of dependence ⋮ Hintikka's independence-friendly logic meets Nelson's realizability ⋮ Truth and definite truth ⋮ On definability of team relations with \(k\)-invariant atoms ⋮ Unnamed Item ⋮ Model-checking games for logics of imperfect information ⋮ The expressive power of modal logic with inclusion atoms ⋮ Game theoretical semantics for some non-classical logics ⋮ Alternating (in)dependence-friendly logic ⋮ Cooperation in games and epistemic readings of independence-friendly sentences ⋮ Upwards closed dependencies in team semantics ⋮ Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Equilibrium semantics of languages of imperfect information ⋮ General models and entailment semantics for independence logic ⋮ Henkin quantifiers and Boolean formulae: a certification perspective of DQBF ⋮ Unnamed Item ⋮ Expressing second-order sentences in intuitionistic dependence logic ⋮ Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information ⋮ Epistemic operators in dependence logic ⋮ Expressivity of imperfect information logics without identity ⋮ Complexity results for modal dependence logic ⋮ Editorial introduction to the special issue: Dependence and independence in logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Axiomatizing first-order consequences in independence logic ⋮ Complexity of two-variable dependence logic and IF-logic ⋮ Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies ⋮ Transition semantics: the dynamics of dependence logic ⋮ Short Overview of the Development of Hintikka’s Work in Logic ⋮ Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications ⋮ Beyond Knowing That: A New Generation of Epistemic Logics ⋮ Modeling Monty Hall in If Logic ⋮ Dependences in strategy logic ⋮ Propositional team logics ⋮ A logical analysis of Monty Hall and Sleeping Beauty ⋮ Henkin quantifiers and the definability of truth ⋮ On non-deterministic quantification ⋮ Complexity of syntactical tree fragments of independence-friendly logic ⋮ On the logic of informational independence and its applications ⋮ UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC ⋮ IF modal logic and classical negation ⋮ The expressive power of \(k\)-ary exclusion logic ⋮ Characterising modal definability of team-based logics via the universal modality ⋮ Finite information logic ⋮ Approximation and dependence via multiteam semantics ⋮ CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES ⋮ Safe dependency atoms and possibility operators in team semantics ⋮ Independence-friendly logic without Henkin quantification ⋮ Team semantics for interventionist counterfactuals: observations vs. interventions ⋮ LOGICS FOR PROPOSITIONAL DETERMINACY AND INDEPENDENCE ⋮ Pruning external minimality checking for answer set programs using semantic dependencies ⋮ Expressivity and Complexity of Dependence Logic ⋮ Remarks on Compositionality ⋮ Supervenience, Dependence, Disjunction ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Dependency Concepts up to Equivalence. ⋮ Unnamed Item ⋮ IF-logic and truth-definition ⋮ The Expressive Power of k-ary Exclusion Logic ⋮ Equivalence Criteria for Compositional IF Modal Logics ⋮ Reasoning about arbitrary natural numbers from a Carnapian perspective ⋮ SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION ⋮ The fallacies of the new theory of reference ⋮ Hybrid logic meets IF modal logic ⋮ On Dependence Logic ⋮ Hintikka on the foundations of mathematics: IF logic and uniformity concepts ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics
This page was built for publication: