Pages that link to "Item:Q5623654"
From MaRDI portal
The following pages link to Finite partially-ordered quantification (Q5623654):
Displaying 45 items.
- Hintikka on the foundations of mathematics: IF logic and uniformity concepts (Q253125) (← links)
- Model-checking games for logics of imperfect information (Q391101) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- A remark on Henkin sentences and their contraries (Q558741) (← links)
- Truth and definite truth (Q598266) (← links)
- Independence-friendly logic and axiomatic set theory (Q598297) (← links)
- Equilibrium semantics of languages of imperfect information (Q636301) (← links)
- Dependence of variables construed as an atomic formula (Q636322) (← links)
- Partially-ordered (branching) generalized quantifiers: A general definition (Q676181) (← links)
- On definability in dependence logic (Q735407) (← links)
- On the formal semantics of IF-like logics (Q980942) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Henkin and function quantifiers (Q1121872) (← links)
- Descriptive characterizations of computational complexity (Q1123616) (← links)
- Decidability problems in languages with Henkin quantifiers (Q1198829) (← links)
- On the logic of informational independence and its applications (Q1208148) (← links)
- Some applications of Henkin quantifiers (Q1233865) (← links)
- IF-logic and truth-definition (Q1267079) (← links)
- A defense of branching quantification (Q1313374) (← links)
- Hintikka's independence-friendly logic meets Nelson's realizability (Q1653658) (← links)
- Definability hierarchies of generalized quantifiers (Q1824614) (← links)
- Degrees of logics with Henkin quantifiers in poor vocabularies (Q1882566) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- Expressing second-order sentences in intuitionistic dependence logic (Q1956373) (← links)
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Classical negation and game-theoretical semantics (Q2258540) (← links)
- Hintikka and the functions of logic (Q2334655) (← links)
- Boolean dependence logic and partially-ordered connectives (Q2361349) (← links)
- Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies (Q2453581) (← links)
- On the computational consequences of independence in propositional logic (Q2500830) (← links)
- On the first-order prefix hierarchy (Q2565987) (← links)
- Linear Programming Tools for Analyzing Strategic Games of Independence-Friendly Logic and Applications (Q3299589) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- Truth Definitions, Skolem Functions and Axiomatic Set Theory (Q4227856) (← links)
- X Latin American Symposium on Mathematical Logic (Q4897043) (← links)
- Dependency Concepts up to Equivalence. (Q5079749) (← links)
- On Dependence Logic (Q5249667) (← links)
- Team Logic and Second-Order Logic (Q5902156) (← links)
- Henkin quantifiers and the definability of truth (Q5928923) (← links)
- Alternating (in)dependence-friendly logic (Q6076360) (← links)
- COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES (Q6103455) (← links)
- An undecidable extension of Morley's theorem on the number of countable models (Q6109096) (← links)
- Compactness in team semantics (Q6589156) (← links)
