Realism about quantum theory naturally leads to realism about the quantum state of the universe. It leaves open whether it is a pure state represented by a wave function, or an impure one represented by a density matrix. I characterize and elaborate on Density Matrix Realism, the thesis that the universal quantum state is objective but can be impure. To clarify the thesis, I compare it with Wave Function Realism, explain the conditions under which they are empirically equivalent, (...) consider two generalizations of Density Matrix Realism, and answer some frequently asked questions. I end by highlighting an implication for scientific realism. (shrink)

If the density matrix is treated as an objective description of individual systems, it may become possible to attribute the same objective significance to statistical mechanical properties, such as entropy or temperature, as to properties such as mass or energy. It is shown that the de Broglie--Bohm interpretation of quantum theory can be consistently applied to density matrices as a description of individual systems. The resultant trajectories are examined for the case of the delayed choice interferometer, for which (...) Bell [Int. J. Quantum chem. 155--159, (1980)] appears to suggest that such an interpretation is not possible. Bell’s argument is shown to be based upon a different understanding of the density matrix to that proposed here. (shrink)

The partial ordering of Medvedev reducibility restricted to the family of Π0 1 classes is shown to be dense. For two disjoint computably enumerable sets, the class of separating sets is an important example of a Π0 1 class, which we call a ``c.e. separating class''. We show that there are no non-trivial meets for c.e. separating classes, but that the density theorem holds in the sublattice generated by the c.e. separating classes.

The following strong form of density of definable types is introduced for theoriesTadmitting a fibered dimension functiond: given a modelMofTand a definable setX⊆Mn, there is a definable typepinX, definable over a code forXand of the samed-dimension asX. Both o-minimal theories and the theory of closed ordered differential fields are shown to have this property. As an application, we derive a new proof of elimination of imaginaries for CODF.

We study connections between classical asymptotic density, computability and computable enumerability. In an earlier paper, the second two authors proved that there is a computably enumerable set A of density 1 with no computable subset of density 1. In the current paper, we extend this result in three different ways: The degrees of such sets A are precisely the nonlow c.e. degrees. There is a c.e. set A of density 1 with no computable subset of nonzero (...) density. There is a c.e. set A of density 1 such that every subset of A of density 1 is of high degree. We also study the extent to which c.e. sets A can be approximated by their computable subsets B in the sense that A\B has small density. There is a very close connection between the computational complexity of a set and the arithmetical complexity of its density and we characterize the lower densities, upper densities and densities of both computable and computably enumerable sets. We also study the notion of "computable at density r" where r is a real in the unit interval. Finally, we study connections between density and classical smallness notions such as immunity, hyperimmunity, and cohesiveness. (shrink)

We classify the asymptotic densities of the sets according to their level in the Ershov hierarchy. In particular, it is shown that for, a real is the density of an n‐c.e. set if and only if it is a difference of left‐ reals. Further, we show that the densities of the ω‐c.e. sets coincide with the densities of the sets, and there are ω‐c.e. sets whose density is not the density of an n‐c.e. set for any.

In noun phrase coordinate constructions, there is a strong tendency for the syntactic structure of the second conjunct to match that of the first; the second conjunct in such constructions is therefore low in syntactic information. The theory of uniform information density predicts that low-information syntactic constructions will be counterbalanced by high information in other aspects of that part of the sentence, and high-information constructions will be counterbalanced by other low-information components. Three predictions follow: lexical probabilities will be lower (...) in second conjuncts than first conjuncts; lexical probabilities will be lower in matching second conjuncts than nonmatching ones; and syntactic repetition should be especially common for low-frequency NP expansions. Corpus analysis provides support for all three of these predictions. (shrink)

In this paper we prove that the preordering $\lesssim $ of provable implication over any recursively enumerable theory $T$ containing a modicum of arithmetic is uniformly dense. This means that we can find a recursive extensional density function $F$ for $\lesssim $. A recursive function $F$ is a density function if it computes, for $A$ and $B$ with $A\lnsim B$, an element $C$ such that $A\lnsim C\lnsim B$. The function is extensional if it preserves $T$-provable equivalence. Secondly, we (...) prove a general result that implies that, for extensions of elementary arithmetic, the ordering $\lesssim $ restricted to $\Sigma_{n}$-sentences is uniformly dense. In the last section we provide historical notes and background material. (shrink)

Abstract.The partial ordering of Medvedev reducibility restricted to the family of Π01 classes is shown to be dense. For two disjoint computably enumerable sets, the class of separating sets is an important example of a Π01 class, which we call a ``c.e. separating class''. We show that there are no non-trivial meets for c.e. separating classes, but that the density theorem holds in the sublattice generated by the c.e. separating classes.

This paper proposes a formalization of the class of sentences quantified by most, which is also interpreted as proportion of or majority of depending on the domain of discourse. We consider sentences of the form “Most A are B”, where A and B are plural nouns and the interpretations of A and B are infinite subsets of \. There are two widely used semantics for Most A are B: \ > C \) and \ > \dfrac{C}{2} \), where C denotes (...) the cardinality of a given finite set X. Although is more descriptive than, it also produces a considerable amount of insensitivity for certain sets. Since the quantifier most has a solid cardinal behaviour under the interpretation majority and has a slightly more statistical behaviour under the interpretation proportional of, we consider an alternative approach in deciding quantity-related statements regarding infinite sets. For this we introduce a new semantics using natural density for sentences in which interpretations of their nouns are infinite subsets of \, along with a list of the axiomatization of the concept of natural density. In other words, we take the standard definition of the semantics of most but define it as applying to finite approximations of infinite sets computed to the limit. (shrink)

We present a population density and moment-based description of the stochastic dynamics of domain $${\text{Ca}}^{2+}$$ -mediated inactivation of L-type $${\text{Ca}}^{2+}$$ channels. Our approach accounts for the effect of heterogeneity of local $${\text{Ca}}^{2+}$$ signals on whole cell $${\text{Ca}}^{2+}$$ currents; however, in contrast with prior work, e.g., Sherman et al. :985–995, 1990), we do not assume that $${\text{Ca}}^{2+}$$ domain formation and collapse are fast compared to channel gating. We demonstrate the population density and moment-based modeling approaches using a 12-state Markov (...) chain model of an L-type $${\text{Ca}}^{2+}$$ channel introduced by Greenstein and Winslow :2918–2945, 2002). Simulated whole cell voltage clamp responses yield an inactivation function for the whole cell $${\text{Ca}}^{2+}$$ current that agrees with the traditional approach when domain dynamics are fast. We analyze the voltage-dependence of $${\text{Ca}}^{2+}$$ inactivation that may occur via slow heterogeneous domain [ $${\text{Ca}}^{2+}$$ ]. Next, we find that when channel permeability is held constant, $${\text{Ca}}^{2+}$$ -mediated inactivation of L-type channels increases as the domain time constant increases, because a slow domain collapse rate leads to increased mean domain [ $${\text{Ca}}^{2+}$$ ] near open channels; conversely, when the maximum domain [ $${\text{Ca}}^{2+}$$ ] is held constant, inactivation decreases as the domain time constant increases. Comparison of simulation results using population densities and moment equations confirms the computational efficiency of the moment-based approach, and enables the validation of two distinct methods of truncating and closing the open system of moment equations. In general, a slow domain time constant requires higher order moment truncation for agreement between moment-based and population density simulations. (shrink)

We clarify different definitions of the density matrix by proposing the use of different names, the full density matrix for a single-closed quantum system, the compressed density matrix for the averaged single molecule state from an ensemble of molecules, and the reduced density matrix for a part of an entangled quantum system, respectively. We show that ensembles with the same compressed density matrix can be physically distinguished by observing fluctuations of various observables. This is in (...) contrast to a general belief that ensembles with the same compressed density matrix are identical. Explicit expression for the fluctuation of an observable in a specified ensemble is given. We have discussed the nature of nuclear magnetic resonance quantum computing. We show that the conclusion that there is no quantum entanglement in the current nuclear magnetic resonance quantum computing experiment is based on the unjustified belief that ensembles having the same compressed density matrix are identical physically. Related issues in quantum communication are also discussed. (shrink)

It is well known that density matrices can be used in quantum mechanics to represent the information available to an observer about either a system with a random wave function (“statistical mixture”) or a system that is entangled with another system (“reduced density matrix”). We point out another role, previously unnoticed in the literature, that a density matrix can play: it can be the “conditional density matrix,” conditional on the configuration of the environment. A precise definition (...) can be given in the context of Bohmian mechanics, whereas orthodox quantum mechanics is too vague to allow a sharp definition, except perhaps in special cases. In contrast to statistical and reduced density matrices, forming the conditional density matrix involves no averaging. In Bohmian mechanics with spin, the conditional density matrix replaces the notion of conditional wave function, as the object with the same dynamical significance as the wave function of a Bohmian system. (shrink)

The core structures of d 111 ¢ screw dislocations in bcc metals are studied using density functional theory in the local-density approximation. For Mo and Fe, direct calculations of the core structures show the cores to be symmetric with respect to 180° rotations around an axis perpendicular to the dislocation line. The magnetic moment in the Fe core is shown to be reduced relative to the bulk value. Calculations of n surfaces and the elastic constants B , C (...) ' and c 44 are reported for Fe and all group VB and VIB metals. Using a criterion suggested by Vitek and Duesbery the calculations point to symmetric core structures for all the studied metals. (shrink)

We prove several theorems about the cardinal $\mathfrak{g}$ associated with groupwise density. With respect to a natural ordering of families of nond-ecreasing maps fromω toω, all families of size $< \mathfrak{g}$ are below all unbounded families. With respect to a natural ordering of filters onω, all filters generated by $< \mathfrak{g}$ sets are below all non-feeble filters. If $\mathfrak{u}< \mathfrak{g}$ then $\mathfrak{b}< \mathfrak{u}$ and $\mathfrak{g} = \mathfrak{d} = \mathfrak{c}$ . (The definitions of these cardinals are recalled in the introduction.) (...) Finally, some consequences deduced from $\mathfrak{u}< \mathfrak{g}$ by Laflamme are shown to be equivalent to $\mathfrak{u}< \mathfrak{g}$. (shrink)

We study the relationship between the cofinality $c(Sym(\omega))$ of the infinite symmetric group and the cardinal invariants $\frak{u}$ and $\frak{g}$ . In particular, we prove the following two results. Theorem 0.1 It is consistent with ZFC that there exists a simple $P_{\omega_{1}}$ -point and that $c(Sym(\omega)) = \omega_{2} = 2^{\omega}$ . Theorem 0.2 If there exist both a simple $P_{\omega_{1}}$ -point and a $P_{\omega_{2}}$ -point, then $c(Sym(\omega)) = \omega_{1}$.

Two of the most difficult problems in the foundations of physics are (1) what gives rise to the arrow of time and (2) what the ontology of quantum mechanics is. They are difficult because the fundamental dynamical laws of physics do not privilege an arrow of time, and the quantum-mechanical wave function describes a high-dimensional reality that is radically different from our ordinary experiences. -/- In this paper, I characterize and elaborate on the ``Wentaculus” theory, a new approach to time’s (...) arrow in a quantum universe that offers a unified solution to both problems. Central to the Wentaculus are (i) Density Matrix Realism, the idea that the quantum state of the universe is objective but can be impure, and (ii) the Initial Projection Hypothesis, a new law of nature that selects a unique initial quantum state. On the Wentaculus, the quantum state of the universe is sufficiently simple to be a law, and the arrow of time can be traced back to an exact boundary condition. It removes the intrinsic vagueness of the Past Hypothesis, eliminates the Statistical Postulate, provides a higher degree of theoretical unity, and contains a natural realization of “strong determinism." I end by responding to four recent objections. In a companion paper, I elaborate on Density Matrix Realism. (shrink)

The main result of this paper is an improvement of the upper bound on the cardinal invariant $cov^*(L_0)$ that was discovered in [11]. Here $L_0$ is the ideal of subsets of the set of natural numbers that have asymptotic density zero. This improved upper bound is also dualized to get a better lower bound on the cardinal $non^*(L_0)$. En route some variations on the splitting number are introduced and several relationships between these variants are proved.

We review the early works which were precursors of the Conceptual Density Functional Theory. Starting from Thomas–Fermi approximation and from the exact formulation of Density Functional Theory by Hohenberg and Kohn’s theorem, we will introduce electronegativity and the theory of hard and soft acids and bases. We will also present a general introduction to the Fukui functions, and their relation with nucleophilicity and electrophilicity, with an emphasis towards the importance of these concepts for chemical reactivity.

A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a picture of an external reality. The new formalism, developed first for the single-particle case, has the advantage of generalizing immediately to quantum field theory and to the description of relativistic phenomena such as particle creation and annihilation.

There are many computational problems which are generally “easy” to solve but have certain rare examples which are much more difficult to solve. One approach to studying these problems is to ignore the difficult edge cases. Asymptotic computability is one of the formal tools that uses this approach to study these problems. Asymptotically computable sets can be thought of as almost computable sets, however every set is computationally equivalent to an almost computable set. Intrinsic density was introduced as a (...) way to get around this unsettling fact, and which will be our main focus.Of particular interest for the first half of this dissertation are the intrinsically small sets, the sets of intrinsic density $0$. While the bulk of the existing work concerning intrinsic density was focused on these sets, there were still many questions left unanswered. The first half of this dissertation answers some of these questions. We proved some useful closure properties for the intrinsically small sets and applied them to prove separations for the intrinsic variants of asymptotic computability. We also completely separated hyperimmunity and intrinsic smallness in the Turing degrees and resolved some open questions regarding the relativization of intrinsic density.For the second half of this dissertation, we turned our attention to the study of intermediate intrinsic density. We developed a calculus using noncomputable coding operations to construct examples of sets with intermediate intrinsic density. For almost all $r\in $, this construction yielded the first known example of a set with intrinsic density r which cannot compute a set random with respect to the r-Bernoulli measure. Motivated by the fact that intrinsic density coincides with the notion of injection stochasticity, we applied these techniques to study the structure of the more well-known notion of MWC-stochasticity.prepared by Justin Miller.E-mail: [email protected]: https://curate.nd.edu/show/6t053f4938w. (shrink)

Concerning Post's problem for Kleene degrees and its relativization, Hrbacek showed in [1] and [2] that if V = L, then Kleene degrees of coanalytic sets are dense, and then for all K ⊆ωω, there are N1 sets which are Kleene semirecursive in K and not Kleene recursive in each other and K. But the density of Kleene semirecursive in K Kleene degrees is not obtained from these theorems. In this note, we extend these theorems by showing that if (...) V = L, then for all K ⊆ ωω, Kleene semirecursive in K Kleene degrees are dense above K. (shrink)

We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.

We show that for any ω-r.e. degree d and n-r.e. degree b with d

Mathematical Logic in Philosophy of Mathematics

Direct download (3 more)  

 

Export citation  

 

Bookmark   1 citation  

We construct a G δ set G ⊆ ω ω ×2 ω with null vertical sections such that each perfect set P ⊆2 ω meets almost all vertical sections of G in the following sense: we can define from P subsets S of ω of density zero such that whenever the section determined by x ∈ ω ω does not meet P , then x ∈ S for all but finitely many i . This generalizes theorems of Mokobodzki and (...) Brendle et al. 185–199). (shrink)

The presence of agriculture is diminishing in today’s society: it provides only a small percentage of jobs, and the number of visible farms that can provide exposure to agricultural processes is continuously decreasing. We hypothesize that the direct involvement with farm activities or interaction with farmers and visual appreciation of agricultural processes of all kinds, influences rural inhabitants’ relationship to agriculture. We assume that the latter plays a role in how far inhabitants are attached to their place, and more specifically, (...) perceive rural place. In this paper, we aim to initiate a discussion on this complex social relationship and suggest a model to capture fine interactions between relationship to agriculture and rural place attachment. We examine the direct and indirect effects from the density of resident farmers on these interactions. We set up a model using data from empirical research in Germany conducted in 2016. We surveyed rural inhabitants and interviewed farmers in villages purposefully sampled based on high and low density of resident farmers. To reveal underlying relationships among the latent constructs and more directly measurable indicators, as well as the indirect effect of farm presence on place attachment through its effect on forming perceptions about agriculture, we operationalized our analysis using a structural equation model. Besides a good model fit, our initial results indicate that rural inhabitants form stronger relationship to agriculture when the density of resident farmers is higher. Further, farm presence and attachment to rural place are positively related, but needs to be better captured. (shrink)

The derivation of the expression for the density matrix of scattered particles in terms of that of the incident ones, taking different impact parameters into account, shows that under well-specified and realistic conditions, the final density matrix is of the same kind as the initial one. Thus the final mixed state after a collision can be used directly as the initial mixed state in a subsequent collision. Contrary to a recent claim by Band and Park, there are no (...) “fundamental difficulties with quantum mechanical collision theory.”. (shrink)

This paper is an attempt to count the proportion of tautologies of some intermediate logics among all formulas. Our interest concentrates especially on Medvedev’s logic and its fragment over language with one propositional variable.

We define a new type of “shatter function” for set systems that satisfies a Sauer–Shelah type dichotomy, but whose polynomial-growth case is governed by Shelah’s two-rank instead of VC dimension. We identify the least exponent bounding the rate of growth of the shatter function, the quantity analogous to VC density, with Shelah’s $\omega $ -rank.

Nelson Goodman’s theory of symbol systems expounded in his Languages of Art has been frequently criticized on many counts. Yet it exerts a strong influence and is treated as one of the major twentieth-century theories on the subject.While many of Goodman’s controversial theses are criticized, the technical notions he used to formulate them seem to have been treated as neutral tools. One such technical notion is that of the density of symbol systems. This serves to distinguish linguistic symbols from (...) pictorial representations and is a crucial part of Goodman’s explanation of what constitutes aesthetic experience. Thus its significance for Goodman’s theory is fundamental.The aim of this paper is a detailed, logical analysis of this notion. It turns out that Goodman’s definition is highly problematic and cannot be applied to symbol systems in the way Goodman envisaged. To conclude, Goodman’s theory is problematic not just because of its controversial theses but also because of logical problems with the technical notions used at its very core. Hence the controversial claims are not simply contestable, but inaccurately expressed. (shrink)

Analyzing the effective content of the Lebesgue density theorem played a crucial role in some recent developments in algorithmic randomness, namely, the solutions of the ML-covering and ML-cupping problems. Two new classes of reals emerged from this inquiry: thepositive density pointswith respect toeffectively closed sets of reals, and a proper subclass, thedensity-one points. Bienvenu, Hölzl, Miller, and Nies have shown that the Martin-Löf random positive density points are exactly the ones that do not compute the halting problem. (...) Treating this theorem as our starting point, we present several new results that shed light on how density, randomness, and computational strength interact. (shrink)

We show that there exist uncountably many pairwise nonisomorphic density-like ideals on $\omega $ which are not generalized density ideals. In addition, they are nonpathological. This answers a question posed by Borodulin-Nadzieja et al. in [this Journal, vol. 80, pp. 1268–1289]. Lastly, we provide sufficient conditions for a density-like ideal to be necessarily a generalized density ideal.

This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we give a way of producing lower bounds on $\mathrm {VC}_{\mathrm {ind}}$-density and use it to compute the exact $\mathrm {VC}_{\mathrm {ind}}$-density of polynomial inequalities and a variety of geometric set families. The main technical tool used is the notion of a maximum set system, which we juxtapose to indiscernibles. In the second (...) part of the paper we give a maximum set system analogue to Shelah’s characterization of stability using indiscernible sequences. (shrink)

The notion of measurement plays a central role in human cognition. We measure people’s height, the weight of physical objects, the length of stretches of time, or the size of various collections of individuals. Measurements of height, weight, and the like are commonly thought of as mappings between objects and dense scales, while measurements of collections of individuals, as implemented for instance in counting, are assumed to involve discrete scales. It is also commonly assumed that natural language makes use of (...) both types of scales and subsequently distinguishes between two types of measurements. This paper argues against the latter assumption. It argues that natural language semantics treats all measurements uniformly as mappings from objects (individuals or collections of individuals) to dense scales, hence the Universal Density of Measurement (UDM). If the arguments are successful, there are a variety of consequences for semantics and pragmatics, and more generally for the place of the linguistic system within an overall architecture of cognition. (shrink)

We study the Vapnik–Chervonenkis density of definable families in certain stable first-order theories. In particular, we obtain uniform bounds on the VC density of definable families in finite $\mathrm {U}$-rank theories without the finite cover property, and we characterize those abelian groups for which there exist uniform bounds on the VC density of definable families.