scientific article; zbMATH DE number 3196255
From MaRDI portal
Publication:5732647
zbMath0121.25308MaRDI QIDQ5732647
Publication date: 1961
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (67)
Dependence logic with generalized quantifiers: axiomatizations ⋮ Boolean dependence logic and partially-ordered connectives ⋮ From IF to BI. A tale of dependence and separation ⋮ Henkin quantifiers and complete problems ⋮ Towards automating duality ⋮ The content of deduction ⋮ The complexity class θp2: Recent results and applications in AI and modal logic ⋮ Leon Henkin the Reviewer ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Axiomatizations of team logics ⋮ Independent set readings and generalized quantifiers ⋮ Solving dependency quantified Boolean formulas using quantifier localization ⋮ Structural completeness in propositional logics of dependence ⋮ Variable declarations in natural deduction ⋮ Truth and definite truth ⋮ What languages have Tarski truth definitions? ⋮ Computational complexity of the semantics of some natural language constructions ⋮ On elementary logics for quantitative dependencies ⋮ Henkin and function quantifiers ⋮ Descriptive characterizations of computational complexity ⋮ Model-checking games for logics of imperfect information ⋮ A resolution proof system for dependency stochastic Boolean satisfiability ⋮ Alternating (in)dependence-friendly logic ⋮ Cooperation in games and epistemic readings of independence-friendly sentences ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ An undecidable extension of Morley's theorem on the number of countable models ⋮ Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic ⋮ An analysis of existential graphs. II: Beta ⋮ Strongly first order, domain independent dependencies: the union-closed case ⋮ Skolem Theory and Generalized Quantifiers ⋮ Dependence of variables construed as an atomic formula ⋮ General models and entailment semantics for independence logic ⋮ Henkin quantifiers and Boolean formulae: a certification perspective of DQBF ⋮ All Quantifiers Versus the Quantifier All ⋮ Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information ⋮ Complexity results for modal dependence logic ⋮ Axiomatizing first-order consequences in independence logic ⋮ Complexity of two-variable dependence logic and IF-logic ⋮ Transition semantics: the dynamics of dependence logic ⋮ Complexity of fixed-size bit-vector logics ⋮ Dependences in strategy logic ⋮ Exploring the beta quadrant ⋮ Partial-order Boolean games: informational independence in a logic-based model of strategic interaction ⋮ Decidability problems in languages with Henkin quantifiers ⋮ Complexity of syntactical tree fragments of independence-friendly logic ⋮ Imperfect Information in Logic and Concurrent Games ⋮ UNIFORM DEFINABILITY IN PROPOSITIONAL DEPENDENCE LOGIC ⋮ Game sentences and ultrapowers ⋮ On the formal semantics of IF-like logics ⋮ Negation and partial axiomatizations of dependence and independence logic revisited ⋮ On the computational consequences of independence in propositional logic ⋮ Independence-friendly logic without Henkin quantification ⋮ Dependency as Question Entailment ⋮ Dependency Concepts up to Equivalence. ⋮ The middle ground-ancestral logic ⋮ Unnamed Item ⋮ Lifting QBF Resolution Calculi to DQBF ⋮ IF-logic and truth-definition ⋮ On languages with non-homogeneous strings of quantifiers ⋮ Definability hierarchies of generalized quantifiers ⋮ Reinterpreting dependency schemes: soundness meets incompleteness in DQBF ⋮ SOME OBSERVATIONS ABOUT GENERALIZED QUANTIFIERS IN LOGICS OF IMPERFECT INFORMATION ⋮ Hintikka memorial issue: introduction and remarks on Jaakko Hintikka's logical philosophy ⋮ Hintikka and the functions of logic ⋮ Succinctness as a source of complexity in logical formalisms ⋮ The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1 ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics
This page was built for publication:
