Related papers: Invariance under permutations as a semantic motiva…
Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…
The connection between the theory of permutation orbifolds, covering surfaces and uniformization is investigated, and the higher genus partition functions of an arbitrary permutation orbifold are expressed in terms of those of the original…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
We review approaches to statistical inference based on randomization. Permutation tests are treated as an important special case. Under a certain group invariance property, referred to as the ``randomization hypothesis,'' randomization…
We introduce some notions of invariant elementary definability which extend the notions of first-order order-invariant definability, and, more generally, definability invariant with respect to arbitrary numerical relations. In particular,…
We consider perturbative quantum field theory in the causal framework. Gauge invariance is, in this framework, an identity involving chronological products of the interaction Lagrangian; it express the fact that the scattering matrix must…
In this paper, we deal with the notions of naturality from category theory and definablity from model theory and their interactions. In this regard, we present three results. First, we show, under some mild conditions, that naturality…
Diffeomorphism invariance is sometimes taken to be a criterion of background independence. This claim is commonly accompanied by a second, that the genuine physical magnitudes (the "observables") of background-independent theories and those…
We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.
We study a generalization of conditional probability for arbitrary ordered vector spaces. A related problem is that of assigning a numerical value to one vector relative to another. We characterize the groups for which these generalized…
In this paper, we study implications of the geometrical nature of space- time for some of the basic tenets of quantum mechanics. That is, we study two different implications of the principle of general covariance; first we quantize a…
Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…
We investigate the issue of coordinate redefinition invariance by carefully performing nonlinear transformations in the discretized quantum mechanical path integral. By resorting to hamiltonian path integral methods, we provide the first…
This article gives an overview of recent results on the relation between quantum field theory and motives, with an emphasis on two different approaches: a "bottom-up" approach based on the algebraic geometry of varieties associated to…
The statistical literature is known to be inconsistent in the use of the terms "permutation test" and "randomization test". Several authors succesfully argue that these terms should be used to refer to two distinct classes of tests and that…
Covariant-contravariant simulation and conformance simulation generalize plain simulation and try to capture the fact that it is not always the case that "the larger the number of behaviors, the better". We have previously studied their…
In Machine Learning, an accepted definition of fairness of a decision taken by a classifier is that it should not depend on protected features, such as gender. Unfortunately, when constraints exist between features, such dependencies can be…
We consider problems in which a system receives external \emph{perturbations} from time to time. For instance, the system can be a train network in which particular lines are repeatedly disrupted without warning, having an effect on…
We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…
This paper investigates modal type theories by using a new categorical semantics called change-of-base semantics. Change-of-base semantics is novel in that it is based on (possibly infinitely) iterated enrichment and interpretation of…