Related papers: Generalized quantifiers in Dependence Logic
The extended modification of the Newton method is considered when the inverse of the derivative (of the operator F(x) in the equation F(x)=0) is replaced by an invertible bounded x-independent operator B. The continuity assumption is…
We consider the concept of generalized measure-theoretic entropy, where instead of the Shannon entropy function we consider an arbitrary concave function defined on the unit interval, vanishing in the origin. Under mild assumptions on this…
This paper establishes model-theoretic properties of $\mathrm{FOE}^{\infty}$, a variation of monadic first-order logic that features the generalised quantifier $\exists^\infty$ (`there are infinitely many'). We provide syntactically defined…
A finite formulation of quantum field theory based on a system of differential equations reminiscent of the Callan-Symanzik equations is discussed. This system of equations was previously formulated in the bare language. We rederive it in a…
The structure of counterterms in higher derivative quantum gravity is reexamined. Nontrivial dependence of charges on the gauge and parametrization is established. Explicit calculations of two-loop contributions are carried out with the…
We use results by Kirilin to show that in general relativity the nonleading terms in the energy-momentum tensor of a particle depends on the parameterization of the gravitational field. While the classical metric that is calculated from…
We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…
We suggest a dependence coefficient between a categorical variable and some general variable taking values in a metric space. We derive important theoretical properties and study the large sample behaviour of our suggested estimator.…
Bayesian networks provide a powerful tool for reasoning about probabilistic causation, used in many areas of science. They are, however, intrinsically classical. In particular, Bayesian networks naturally yield the Bell inequalities.…
Generalized Gibbs ensembles have been used as powerful tools to describe the steady state of integrable many-particle quantum systems after a sudden change of the Hamiltonian. Here we demonstrate numerically, that they can be used for a…
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential…
Ostrowski's theorem implies that $\log(x),\log(x+1),\ldots$ are algebraically independent over $\mathbb{C}(x)$. More generally, for a linear differential or difference equation, it is an important problem to find all algebraic dependencies…
Quantum field theory allows more general symmetries than groups and Lie algebras. For instance quantum groups, that is Hopf algebras, have been familiar to theoretical physicists for a while now. Nowdays many examples of symmetries of…
A generalized quantization principle is considered, which incorporates nontrivial commutation relations of the components of the variables of the quantized theory with the components of the corresponding canonical conjugated momenta…
The relationship between Lexical-Functional Grammar (LFG) {\em functional structures} (f-structures) for sentences and their semantic interpretations can be expressed directly in a fragment of linear logic in a way that correctly explains…
Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. Theyare a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional…
Term-forming operators (tfos), like iota- or epsilon-operator, are technical devices applied to build complex terms in formal languages. Although they are very useful in practice their theory is not well developed. In the paper we provide a…
A new approach to the quantization of constrained or otherwise reduced classical mechanical systems is proposed. On the classical side, the generalized symplectic reduction procedure of Mikami and Weinstein, as further extended by Xu in…
In earlier work, we proposed a logic that extends the Logic of General Awareness of Fagin and Halpern [1988] by allowing quantification over primitive propositions. This makes it possible to express the fact that an agent knows that there…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…