We introduce a novel variant of BSS machines called Separate Branching BSS machines (S- BSS in short) and develop a Fagin-type logical characterisation for languages decidable in …
We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the …
M Hannula, J Virtema - Annals of Pure and Applied Logic, 2022 - Elsevier
Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of …
We examine doxastically inspired variants and extensions of Dependence Logic which arise from the consideration of announcement operators and non-functional dependence atoms …
M Sevenster, G Sandu - Annals of Pure and Applied Logic, 2010 - Elsevier
In this paper, we introduce a new approach to independent quantifiers, as originally introduced in Informational independence as a semantic phenomenon by Hintikka and …
The properties of the ∀^ 1 quantifier defined by Kontinen and Väänänen in 13 are studied, and its definition is generalized to that of a family of quantifiers ∀^ n. Furthermore, some …
M Hannula, M Hirvonen, J Kontinen… - … Conference on Logics …, 2023 - Springer
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic …
F Barbero - The Review of Symbolic Logic, 2013 - cambridge.org
We analyze the behaviour of declarations of independence between existential quantifiers in quantifier prefixes of Independence-Friendly (IF) sentences; we give a syntactical criterion …
M Hirvonen - International Symposium on Foundations of Information …, 2024 - Springer
We consider probabilistic independence and unary variants of marginal identity and marginal distribution equivalence over finite probability distributions. Two variables x and y …