Finite partially-ordered quantification
From MaRDI portal
Publication:5623654
DOI10.2307/2271440zbMath0219.02008OpenAlexW2164297607MaRDI QIDQ5623654
Publication date: 1971
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2271440
Related Items
Boolean dependence logic and partially-ordered connectives ⋮ Degrees of logics with Henkin quantifiers in poor vocabularies ⋮ Henkin quantifiers and complete problems ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Hintikka's independence-friendly logic meets Nelson's realizability ⋮ Truth and definite truth ⋮ Independence-friendly logic and axiomatic set theory ⋮ On elementary logics for quantitative dependencies ⋮ Henkin and function quantifiers ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ Descriptive characterizations of computational complexity ⋮ Model-checking games for logics of imperfect information ⋮ Alternating (in)dependence-friendly logic ⋮ COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES ⋮ An undecidable extension of Morley's theorem on the number of countable models ⋮ Equilibrium semantics of languages of imperfect information ⋮ Dependence of variables construed as an atomic formula ⋮ Expressing second-order sentences in intuitionistic dependence logic ⋮ Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information ⋮ 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 ⋮ Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications ⋮ X Latin American Symposium on Mathematical Logic ⋮ Partially-ordered (branching) generalized quantifiers: A general definition ⋮ Decidability problems in languages with Henkin quantifiers ⋮ Henkin quantifiers and the definability of truth ⋮ On the logic of informational independence and its applications ⋮ Classical negation and game-theoretical semantics ⋮ A remark on Henkin sentences and their contraries ⋮ On the formal semantics of IF-like logics ⋮ On the computational consequences of independence in propositional logic ⋮ Some applications of Henkin quantifiers ⋮ On definability in dependence logic ⋮ Dependency Concepts up to Equivalence. ⋮ IF-logic and truth-definition ⋮ Team Logic and Second-Order Logic ⋮ Partially ordered connectives and monadic monotone strict NP ⋮ Definability hierarchies of generalized quantifiers ⋮ On the first-order prefix hierarchy ⋮ On Dependence Logic ⋮ Hintikka and the functions of logic ⋮ Truth Definitions, Skolem Functions and Axiomatic Set Theory ⋮ A defense of branching quantification ⋮ Hintikka on the foundations of mathematics: IF logic and uniformity concepts
Cites Work
