Finite partially-ordered quantification
From MaRDI portal
Cites work
Cited in
(45)- Partially ordered connectives and monadic monotone strict NP
- Henkin quantifiers and complete problems
- Henkin and function quantifiers
- Descriptive characterizations of computational complexity
- Decidability problems in languages with Henkin quantifiers
- On the logic of informational independence and its applications
- Some applications of Henkin quantifiers
- IF-logic and truth-definition
- A defense of branching quantification
- Hintikka's independence-friendly logic meets Nelson's realizability
- Definability hierarchies of generalized quantifiers
- Degrees of logics with Henkin quantifiers in poor vocabularies
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
- Expressing second-order sentences in intuitionistic dependence logic
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information
- On elementary logics for quantitative dependencies
- Classical negation and game-theoretical semantics
- Hintikka and the functions of logic
- Boolean dependence logic and partially-ordered connectives
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
- On the computational consequences of independence in propositional logic
- Hintikka on the foundations of mathematics: IF logic and uniformity concepts
- On the first-order prefix hierarchy
- Changing a Semantics: Opportunism or Courage?
- Model-checking games for logics of imperfect information
- Truth Definitions, Skolem Functions and Axiomatic Set Theory
- Complexity of two-variable dependence logic and IF-logic
- X Latin American Symposium on Mathematical Logic
- Dependency Concepts up to Equivalence.
- On dependence logic
- A remark on Henkin sentences and their contraries
- Team Logic and Second-Order Logic
- Henkin quantifiers and the definability of truth
- Truth and definite truth
- Independence-friendly logic and axiomatic set theory
- 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
- Compactness in team semantics
- Partially-ordered (branching) generalized quantifiers: A general definition
- Bounded Henkin quantifiers and the exponential time hierarchy
- On definability in dependence logic
- On the formal semantics of IF-like logics
This page was built for publication: Finite partially-ordered quantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5623654)
