Finite Partially‐Ordered Quantifiers
From MaRDI portal
Publication:5588598
DOI10.1002/malq.19700160802zbMath0193.29405OpenAlexW2083018613WikidataQ29037855 ScholiaQ29037855MaRDI QIDQ5588598
Publication date: 1970
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19700160802
Related Items
Boolean dependence logic and partially-ordered connectives, Henkin quantifiers and complete problems, Changing a Semantics: Opportunism or Courage?, Hintikka's independence-friendly logic meets Nelson's realizability, European Summer Meeting of the Association for Symbolic Logic, (Logic Colloquium '87), Granada, Spain, 1987, Independence-friendly logic and axiomatic set theory, On elementary logics for quantitative dependencies, Henkin and function quantifiers, On the semantics of the Henkin quantifier, Model-checking games for logics of imperfect information, Alternating (in)dependence-friendly logic, Cooperation in games and epistemic readings of independence-friendly sentences, COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES, 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, Generalized quantification as substructural 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, X Latin American Symposium on Mathematical Logic, Decidability problems in languages with Henkin quantifiers, Existential Graphs: What a Diagrammatic Logic of Cognition Might Look Like, Complexity of syntactical tree fragments of independence-friendly logic, Classical negation and game-theoretical semantics, DICHOTOMY RESULT FOR INDEPENDENCE-FRIENDLY PREFIXES OF GENERALIZED QUANTIFIERS, A remark on Henkin sentences and their contraries, On the formal semantics of IF-like logics, Independence-friendly logic without Henkin quantification, Dependency Concepts up to Equivalence., Team Logic and Second-Order Logic, On Dependence Logic, Hintikka and the functions of logic, New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems, Hintikka on the foundations of mathematics: IF logic and uniformity concepts
