The following pages link to Juha Kontinen (Q269505):
Displaying 50 items.
- A logical approach to context-specific independence (Q122510) (← links)
- On the finite and general implication problems of independence atoms and keys (Q269507) (← links)
- Dependence logic with a majority quantifier (Q302214) (← links)
- (Q388207) (redirect page) (← links)
- Axiomatizing first-order consequences in dependence logic (Q388209) (← links)
- (Q476183) (redirect page) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Extensions of MSO and the monadic counting hierarchy (Q617710) (← links)
- A remark on negation in dependence logic (Q628802) (← links)
- On definability in dependence logic (Q735407) (← links)
- Definability of second order generalized quantifiers (Q964457) (← links)
- A remark on collective quantification (Q1006495) (← links)
- Probabilistic team semantics (Q1647487) (← links)
- Polyteam semantics (Q1709702) (← links)
- Approximation and dependence via multiteam semantics (Q1783737) (← links)
- On the expressive power of TeamLTL and first-order team logic over hyperproperties (Q2148802) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Descriptive complexity of \#P functions: a new perspective (Q2220444) (← links)
- Facets of distribution identities in probabilistic team semantics (Q2296714) (← links)
- Logics for first-order team properties (Q2303604) (← links)
- Continuous team semantics (Q2327476) (← links)
- Dependence logic with generalized quantifiers: axiomatizations (Q2361348) (← links)
- Erratum to: ``On definability in dependence logic'' (Q2429991) (← links)
- A characterization of definability of second-order generalized quantifiers with applications to non-definability (Q2453584) (← links)
- A finite axiomatization of conditional independence and inclusion dependencies (Q2629853) (← links)
- On Second-Order Monadic Monoidal and Groupoidal Quantifiers (Q2786142) (← links)
- Approximation and Dependence via Multiteam Semantics (Q2807084) (← links)
- A Logical Approach to Context-Specific Independence (Q2820693) (← links)
- Dependence Logic with Generalized Quantifiers: Axiomatizations (Q2849428) (← links)
- Independence in Database Relations (Q2849431) (← links)
- A Fragment of Dependence Logic Capturing Polynomial Time (Q2878749) (← links)
- Dependence logic with a majority quantifier (Q2911629) (← links)
- Complexity of Propositional Independence and Inclusion Logic (Q2946342) (← links)
- Hierarchies in Dependence Logic (Q2946680) (← links)
- Hierarchies in independence logic (Q2958527) (← links)
- Characterizing Definability of Second-Order Generalized Quantifiers (Q3003360) (← links)
- Modal independence logic: (Q3133166) (← links)
- On Second-Order Monadic Groupoidal Quantifiers (Q3511462) (← links)
- Decidability of predicate logics with team semantics (Q4608623) (← links)
- Complexity of Propositional Logics in Team Semantic (Q4608724) (← links)
- (Q4636302) (← links)
- On the Interaction of Inclusion Dependencies with Independence Atoms (Q4645737) (← links)
- Characterizing quantifier extensions of dependence logic (Q4916562) (← links)
- (Q5013879) (← links)
- (Q5015279) (← links)
- Tractability Frontier of Data Complexity in Team Semantics (Q5056358) (← links)
- Polyteam semantics (Q5140328) (← links)
- Descriptive complexity of real computation and probabilistic independence logic (Q5145662) (← links)
- On Natural Deduction in Dependence Logic (Q5213573) (← links)
