Related papers: Generalized quantifiers in Dependence Logic
The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…
We consider a logic with truth values in the unit interval and which uses aggregation functions instead of quantifiers, and we describe a general approach to asymptotic elimination of aggregation functions and, indirectly, of asymptotic…
A generalization of the Heisenberg algebra has been recently constructed. This generalized algebra has a characteristic function which depends on one of its generators. When this function is linear, $qJ_0+s$, it is possible to construct a…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
We give a new elementary proof of the main theorem of [Fef12]: Quantifiers implicitly definable in pure second-order logic equipped with Henkin semantics implies are (explicitly) definable in first-order logic.
We prove general de Finetti type theorems for classical and free independence. The de Finetti type theorems work for all non-easy quantum groups, which generalize a recent work of Banica, Curran and Speicher. We determine maximal…
We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…
Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…
We study descriptive complexity of counting complexity classes in the range from #P to #$\cdot$NP. A corollary of Fagin's characterization of NP by existential second-order logic is that #P can be logically described as the class of…
This paper proposes a way to compute the meanings associated with sentences with generic noun phrases corresponding to the generalized quantifier most. We call these generics specimens and they resemble stereotypes or prototypes in lexical…
We study a version of the generalized (h, {\phi})-entropies, introduced by Salicr\'u et al, for a wide family of probabilistic models that includes quantum and classical statistical theories as particular cases. We extend previous works by…
We introduce a family of relativistic non-rigid non-inertial frames as a gauge fixing of the description of N positive energy particles in the framework of parametrized Minkowski theories. Then we define a multi-temporal quantization scheme…
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
In the present work the role that a generalized uncertainty principle could play in the quantization of the electromagnetic field is analyzed. It will be shown that we may speak of a Fock space, a result that implies that the concept of…
Large complexity classes, like the exponential time hierarchy, received little attention in terms of finding complete problems. In this work a generalization of propositional logic is investigated which fills this gap with the introduction…
Let $\mathrm{R}$ be a real closed field. Given a closed and bounded semi-algebraic set $A \subset \mathrm{R}^n$ and semi-algebraic continuous functions $f,g:A \rightarrow \mathrm{R}$, such that $f^{-1}(0) \subset g^{-1}(0)$, there exist $N$…
Intuitionistic dependence logic was introduced by Abramsky and Vaananen (2009) as a variant of dependence logic under a general construction of Hodges' (trump) team semantics. It was proven that there is a translation from intuitionistic…
We introduce an atomic formula intuitively saying that given variables are independent from given other variables if a third set of variables is kept constant. We contrast this with dependence logic. We show that our independence atom gives…