scientific article; zbMATH DE number 3196255
From MaRDI portal
Publication:5732647
Cited in
(72)- Henkin quantifiers and complete problems
- Henkin and function quantifiers
- Descriptive characterizations of computational complexity
- Decidability problems in languages with Henkin quantifiers
- Game sentences and ultrapowers
- IF-logic and truth-definition
- Succinctness as a source of complexity in logical formalisms
- Towards automating duality
- Cooperation in games and epistemic readings of independence-friendly sentences
- Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
- Definability hierarchies of generalized quantifiers
- General models and entailment semantics for independence logic
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information
- Complexity results for modal dependence logic
- Dependences in strategy logic
- Complexity of syntactical tree fragments of independence-friendly logic
- The middle ground-ancestral logic
- Solving dependency quantified Boolean formulas using quantifier localization
- On elementary logics for quantitative dependencies
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF
- Hintikka memorial issue: introduction and remarks on Jaakko Hintikka's logical philosophy
- Hintikka and the functions of logic
- Dependence logic with generalized quantifiers: axiomatizations
- Boolean dependence logic and partially-ordered connectives
- The content of deduction
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
- On the computational consequences of independence in propositional logic
- On languages with non-homogeneous strings of quantifiers
- Axiomatizations of team logics
- Lifting QBF resolution calculi to DQBF
- Structural completeness in propositional logics of dependence
- Leon Henkin the reviewer
- Changing a Semantics: Opportunism or Courage?
- Skolem Theory and Generalized Quantifiers
- Model-checking games for logics of imperfect information
- All Quantifiers Versus the Quantifier All
- Axiomatizing first-order consequences in independence logic
- Complexity of two-variable dependence logic and IF-logic
- Imperfect information in logic and concurrent games
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- Complexity of fixed-size bit-vector logics
- The complexity class θp2: Recent results and applications in AI and modal logic
- Dependency Concepts up to Equivalence.
- Exploring the beta quadrant
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction
- Dependency as question entailment
- SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION
- scientific article; zbMATH DE number 7056228 (Why is no real title available?)
- Uniform definability in propositional dependence logic
- Good-for-Game QPTL: An Alternating Hodges Semantics
- Independence-friendly logic without Henkin quantification
- Truth and definite truth
- What languages have Tarski truth definitions?
- Computational complexity of the semantics of some natural language constructions
- A resolution proof system for dependency stochastic Boolean satisfiability
- Alternating (in)dependence-friendly logic
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
- An undecidable extension of Morley's theorem on the number of countable models
- An analysis of existential graphs. II: Beta
- Strongly first order, domain independent dependencies: the union-closed case
- Dependence of variables construed as an atomic formula
- The strategic balance of games in logic
- A new game theoretic semantics (GTS-2) for weak Kleene logics
- Team semantics and independence notions in quantum physics
- Bounded Henkin quantifiers and the exponential time hierarchy
- Objectual quantifier theory
- Strong (D)QBF dependency schemes via implication-free resolution paths
- Mathematical structures in natural language semantics: Zawadowski's contribution to linguistics
- From IF to BI. A tale of dependence and separation
- Independent set readings and generalized quantifiers
- Variable declarations in natural deduction
- On the formal semantics of IF-like logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5732647)