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)

We investigate the underexplored question of when speakers make use of the omission phenomenon verb phrase ellipsis (VPE) in English given that the full form is also available to them. We base the interpretation of our results on the well-established information-theoretic Uniform Information Density (UID) hypothesis: Speakers tend to distribute processing effort uniformly across utterances and avoid regions of low information by omitting redundant material through, e.g., VPE. We investigate the length of the omittable VP (...) and its predictability in context as sources of redundancy which lead to larger or deeper regions of low information and an increased pressure to use ellipsis. We use both naturalness rating and self-paced reading studies in order to link naturalness patterns to potential processing difficulties. For the length effects our rating and reading results support a UID account. Surprisingly, we do not find an effect of the context on the naturalness and the processing of VPE. We suggest that our manipulation might have been too weak or not effective to evidence such an effect. (shrink)

Language research has come to rely heavily on large‐scale, web‐based datasets. These datasets can present significant methodological challenges, requiring researchers to make a number of decisions about how they are collected, represented, and analyzed. These decisions often concern long‐standing challenges in corpus‐based language research, including determining what counts as a word, deciding which words should be analyzed, and matching sets of words across languages. We illustrate these challenges by revisiting “Word lengths are optimized for efficient communication” (Piantadosi, Tily, & Gibson, (...) 2011), which found that word lengths in 11 languages are more strongly correlated with their average predictability (or average information content) than their frequency. Using what we argue to be best practices for large‐scale corpus analyses, we find significantly attenuated support for this result and demonstrate that a stronger relationship obtains between word frequency and length for a majority of the languages in the sample. We consider the implications of the results for language research more broadly and provide several recommendations to researchers regarding best practices. (shrink)

Making consent work for its primary purposes has been, and will be, a challenge. Millum and Bromwich have done an excellent job of considering the manifold obligations of informed consent, with the...

Cognitive Science, Volume 46, Issue 6, June 2022.

Rational accounts of language use such as the uniform information density hypothesis, which asserts that speakers distribute information uniformly across their utterances, and the rational speech act (RSA) model, which suggests that speakers optimize the formulation of their message by reasoning about what the comprehender would understand, have been hypothesized to account for a wide range of language use phenomena. We here specifically focus on the production of discourse connectives. While there is some prior work indicating (...) that discourse connective production may be governed by RSA, that work uses a strongly gamified experimental setting. In this study, we aim to explore whether speakers reason about the interpretation of their conversational partner also in more realistic settings. We thereby systematically vary the task setup to tease apart effects of task instructions and effects of the speaker explicitly seeing the interpretation alternatives for the listener. Our results show that the RSA-predicted effect of connective choice based on reasoning about the listener is only found in the original setting where explicit interpretation alternatives of the listener are available for the speaker. The effect disappears when the speaker has to reason about listener interpretations. We furthermore find that rational effects are amplified by the gamified task setting, indicating that meta-reasoning about the specific task may play an important role and potentially limit the generalizability of the found effects to more naturalistic every-day language use. (shrink)

Let ℋ be a finite-dimensional complex Hilbert space and D the set of density matrices on ℋ, i.e., the positive operators with trace 1. Our goal in this note is to identify a probability measure u on D that can be regarded as the uniform distribution over D. We propose a measure on D, argue that it can be so regarded, discuss its properties, and compute the joint distribution of the eigenvalues of a random density matrix distributed (...) according to this measure. (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)

The brain is a very complex structure. Over the past several decades, many studies have aimed to understand how various non-uniform variables relate to each other. The current study compared the whole-brain network organization and global spatial distribution of cell densities in the monkey brain. Wide comparisons between 27 graph theoretical measures and cell densities revealed that only participation coefficients (PCs) significantly correlated with cell densities. Interestingly, PCs did not show a significant correlation with spatial coordinates. Furthermore, the significance (...) of the correlation between cell densities and spatial coordinates disappeared only with the removal of the visual module, while the significance of the correlation between cell densities and PCs disappeared with the removal of any one module. Taken together, these results suggested the presence of a combinatorial effect of modular architectures in the network organization related to the non-uniformity of cell densities additional to the spatially monotonic change. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of (...) uniform substitution. First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models (...) with infinitely many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitu- tion core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational (...) models with infinitely many agents, PAL-Kω , as well as standard extensions thereof, e.g., PAL-Tω , PAL-S4ω, and PAL-S5ω. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

Answering a question raised by Shavrukov and Visser :569–582, 2014), we show that the lattice of \-sentences ) over any computable enumerable consistent extension T of \ is uniformly dense. We also show that for every \ and \ refer to the known hierarchies of arithmetical formulas introduced by Burr for intuitionistic arithmetic) the lattices of \-sentences over any c.e. consistent extension T of the intuitionistic version of Robinson Arithmetic \ are uniformly dense. As an immediate consequence of the proof, (...) all these lattices are also locally universal. (shrink)

In this paper, we analyze and calculate the crowd density in a tourist area utilizing video surveillance dynamic information analysis and divide the crowd counting and density estimation task into three stages. In this paper, novel scale perception module and inverse scale perception module are designed to further facilitate the mining of multiscale information by the counting model; the main function of the third stage is to generate the population distribution density map, which mainly consists (...) of three columns of void convolution with different void rates and generates the final population distribution density map using the feature maps of different branch regressions. Also, the algorithm uses jump connections between the top convolution and the bottom void convolution layers to reduce the risk of network gradient disappearance and gradient explosion and optimizes the network parameters using an intermediate supervision strategy. The hierarchical density estimator uses a hierarchical strategy to mine semantic features and multiscale information in a coarse-to-fine manner, and this is used to solve the problem of scale variation and perspective distortion. Also, considering that the background noise affects the quality of the generated density map, the soft attention mechanism is integrated into the model to stretch the distance between the foreground and background to further improve the quality of the density map. Also, inspired by multitask learning, this paper embeds an auxiliary count classifier in the count model to perform the count classification auxiliary task and to increase the model’s ability to express semantic information. Numerous experimental results demonstrate the effectiveness and feasibility of the proposed algorithm in solving the problems of scale variation and perspective distortion. (shrink)

This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both logically and (...) probabilistically. The statistical relevance of one function in determining another is put forward as a way of defining the value of information: The statistical relevance of a function F to a function G is the absolute value of the change in one's information about the value of G afforded by specifying the value of F. This theory provides normative justifications for conclusions projected by analogy from one case to another, and for generalization from an instance to a rule. The soundness of such conclusions, in either the logical or the probabilistic case, can be identified with the extent to which the corresponding criteria (determination and uniformity) actually hold for the features being related. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in (...) the study of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

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 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.

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)

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)

Our paper addresses the following question: Is there a general characterization, for all predicates P that take both declarative and interrogative complements , of the meaning of the P-interrogative clause construction in terms of the meaning of the P-declarative clause construction? On our account, if P is a responsive predicate and Q a question embedded under P, then the meaning of ‘P + Q’ is, informally, “to be in the relation expressed by P to some potential complete answer to Q”. (...) We show that this rule allows us to derive veridical and non-veridical readings of embedded questions, depending on whether the embedding verb is veridical or not, and provide novel empirical evidence supporting the generalization. We then enrich our basic proposal to account for the presuppositions induced by the embedding verbs, as well as for the generation of intermediate exhaustive readings of embedded questions. (shrink)

In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal logics is introduced and applied to show that the logics E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {E}$$\end{document}, M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {M}$$\end{document}, MC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MC}$$\end{document}, EN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {EN}$$\end{document}, MN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MN}$$\end{document} have (...) that property. In particular, these logics have uniform interpolation. Although for some of them the latter is known, the fact that they have uniform Lyndon interpolation is new. Also, the proof-theoretic proofs of these facts are new, as well as the constructive way to explicitly compute the interpolants that they provide. It is also shown that the non-normal modal logics EC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {EC}$$\end{document} and ECN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {ECN}$$\end{document} do not have Craig interpolation, and whence no uniform interpolation. (shrink)

We prove a nonstandard density result. It asserts that if a particular formula is true for functions in a set K of linear continuous functions between Banach spaces E and D, then it remains valid for functions that are limits, in the uniform convergence topology on a given class ℳ of subsets of E, of nets of vectors in K. We then apply this result to various class ℳ and setsK in the context of E-valued Bochner integrable functions (...) defined on a finite measure space. (shrink)

We prove uniformly computable versions of the Implicit Function Theorem in its differentiable and non-differentiable forms. We show that the resulting operators are not computable if information about some of the partial derivatives of the implicitly defining function is omitted. Finally, as a corollary, we obtain a uniformly computable Inverse Function Theorem, first proven by M. Ziegler.

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.

The theory of inner functions plays an important role in the study of bounded analytic functions. Inner functions are also useful in applied mathematics. Two foundational results in this theory are Frostman's Theorem and the Factorization Theorem. We prove a uniformly computable version of Frostman's Theorem. We then show that the Factorization Theorem is not uniformly computably true. We then show that for an inner function u with infinitely many zeros, the Blaschke sum of u provides the exact amount of (...) information necessary to compute the factorization of u. Along the way, we prove some uniform computability results for Blaschke products; these results play a key role in the analysis of factorization. We also give some computability results concerning zeros and singularities of analytic functions. We use Type-Two Effectivity as our foundation. (shrink)

The concept of time-coarsened density matrix for open systems has frequently featured in equilibrium and non-equilibrium statistical mechanics, without being probed as to the detailed consequences of the time averaging procedure. In this work we introduce and prove the need for a selective and non-uniform time-sampling, whose form depends on the properties of the bath. It is also applicable when an open microscopic sub-system is coupled to another finite system. By use of a time-periodic minimal coupling model between (...) these two systems, we present detailed quantitative consequences of time coarsening, which include initial state independence of equilibration, deviations from long term averages, their environment size dependence and the approach to classicality, as measured by a Leggett–Garg type inequality. An interacting multiple qubit model affords comparison between the time integrating procedure and the more conventional environment tracing method. (shrink)

We study the uniform computational content of different versions of the Baire category theorem in the Weihrauch lattice. The Baire category theorem can be seen as a pigeonhole principle that states that a complete metric space cannot be decomposed into countably many nowhere dense pieces. The Baire category theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we distinguish two different logical versions (...) of the theorem, where one can be seen as the contrapositive form of the other one. The first version aims to find an uncovered point in the space, given a sequence of nowhere dense closed sets. The second version aims to find the index of a closed set that is somewhere dense, given a sequence of closed sets that cover the space. Even though the two statements behind these versions are equivalent to each other in classical logic, they are not equivalent in intuitionistic logic, and likewise, they exhibit different computational behavior in the Weihrauch lattice. Besides this logical distinction, we also consider different ways in which the sequence of closed sets is “given.” Essentially, we can distinguish between positive and negative information on closed sets. We discuss all four resulting versions of the Baire category theorem. Somewhat surprisingly, it turns out that the difference in providing the input information can also be expressed with the jump operation. Finally, we also relate the Baire category theorem to notions of genericity and computably comeager sets. (shrink)

We prove a nonstandard density result. It asserts that if a particular formula is true for functions in a set K of linear continuous functions between Banach spaces E and D, then it remains valid for functions that are limits, in the uniform convergence topology on a given class ℳ︁ of subsets of E, of nets of vectors in K. We then apply this result to various class ℳ︁ and setsK in the context of E‐valued Bochner integrable functions (...) defined on a finite measure space. (shrink)

We present an informational view of classical propositional logic that stems from a kind of informational semantics whereby the meaning of a logical operator is specified solely in terms of the information that is actually possessed by an agent. In this view the inferential power of logical agents is naturally bounded by their limited capability of manipulating “virtual information”, namely information that is not implicitly contained in the data. Although this informational semantics cannot be expressed by any (...) finitely-valued matrix, it can be expressed by a non-deterministic 3-valued matrix that was first introduced by W.V.O. Quine, but ignored by the logical community. Within the general framework presented in [21] we provide an in-depth discussion of this informational semantics and a detailed analysis of a specific infinite hierarchy of tractable approximations to classical propositional logic that is based on it. This hierarchy can be used to model the inferential power of resource-bounded agents and admits of a uniform proof-theoretical characterization that is half-way between a classical version of Natural Deduction and the method of semantic tableaux. (shrink)

We consider probabilistic theories in which the most elementary system, a two-dimensional system, contains one bit of information. The bit is assumed to be contained in any complete set of mutually complementary measurements. The requirement of invariance of the information under a continuous change of the set of mutually complementary measurements uniquely singles out a measure of information, which is quadratic in probabilities. The assumption which gives the same scaling of the number of degrees of freedom with (...) the dimension as in quantum theory follows essentially from the assumption that all physical states of a higher dimensional system are those and only those from which one can post-select physical states of two-dimensional systems. The requirement that no more than one bit of information (as quantified by the quadratic measure) is contained in all possible post-selected two-dimensional systems is equivalent to the positivity of density operator in quantum theory. (shrink)

This paper explores the possibility of a standard legal language (e.g. English) for a principled evolution of law in line with technological development. In doing so, reference is made to blockchain networks and smart contracts to emphasise the discontinuity with the liberal legal tradition when it comes to decentralisation and binary code language. Methodologically, the argument is built on the underlying relation between law, semiotics and new forms of media adding to natural language; namely: code and symbols. In what follows, (...) I will concentrate on the study of factors that explain why such approach can be fruitful for the future of law and innovation. I have three reasons for selecting this topic. The first is a more pragmatic reason, based on my current research of law as a linguistic phenomenon. Secondly, the topic does also touch the matter on binary code language, rivalrous to legal alphabetic language. Lastly, the study aims at emphasizing the pivotal role of the jurist as an interpreter in a changing society accommodating diverging realms of reality. The study is structured as follows. Firstly, a quick exam of the traits of blockchain networks would provide the contextual link to establish the arguments in support of the need of a standard legal language. Secondly, a comparison between liberal legal institutions and theory of semiotics is set to perceive their functioning and ascertain their limits in the light of todays unprecedented changes. Thirdly, a summary on blockchain networks’ legal features would constitute the thrust behind the idea of a uniform legal language. Methodologically, the argument does also establish some relations with classical laws of physics and philosophy of media. Its aim is to demonstrate how the suggested legal interpretation and semiotic-based approach can contribute to overcome existing stumbling blocks including, but not limited to, the lack of cooperation at the international level as well as the gap in State norms when it comes to innovation. In this sense, the proposed strategies do not intend to replace current advances in the legal thought. In contrast, it seeks to harmonise their results providing a methodical approach that can concur to inform a new technique to address new controversial issues. In practice, the proposed method regarding the adoption of a uniform legal language would lower transactive costs in terms of normative coordination in the matter of international cooperation and in the definition of applicable law among different legal systems. Alternatively, it might contribute to the convergence of legal systems and/or their underlying concepts. Differently put, article’s contribution can be envisaged in fostering juridical consistency with regards to different forms of languages’ coexistence. (shrink)

Advance health care directives and informed consent remain the cornerstones of patients' right to self-determination regarding medical care and preferences at the end-of-life. However, the effectiveness and clinical applicability of advance health care directives to decision-making on the use of life support systems at the end-of-life is questionable. The Uniform Anatomical Gift Act (UAGA) has been revised in 2006 to permit the use of life support systems at or near death for the purpose of maximizing procurement opportunities of organs (...) medically suitable for transplantation. Some states have enacted the Revised UAGA (2006) and a few of those have included amendments while attempting to preserve the uniformity of the revised Act. Other states have introduced the Revised UAGA (2006) for legislation and remaining states are likely to follow soon. (shrink)

Political decision-makers in the European Union are currently discussing the introduction of a mandatory uniform labelling scheme for meat and milk that provides information on husbandry systems similar to the already existent labelling scheme in the EU egg market. The objective of this paper was to assess whether such information is relevant to consumers when buying meat and milk. The paper was based on a systematic synthesis of 53 scientific journal articles on empirical consumer studies. The review (...) revealed that consumers perceived the aspects of outdoor access, stocking density and floor type as important factors influencing animal welfare. On average, consumers not only had a positive attitude towards more animal welfare-friendly husbandry systems with outdoor access and space allowance but were also willing to pay a price premium for products from such systems. All studies on consumer segmentation identified at least one consumer segment that placed great importance on animal welfare-friendly husbandry systems. Interestingly, many studies identified one or more other segments who still had a significant preference for animal welfare-friendly products even though other product attributes were more important to them. Based on the findings, the paper presents conclusions regarding the labelling of husbandry systems for meat and milk. (shrink)

In this chapter, it is suggested that our epistemic access to metaphysical modality generally involves rationalist, a priori elements. However, these a priori elements are much more subtle than ‘traditional’ modal rationalism assumes. In fact, some might even question the ‘apriority’ of these elements, but I should stress that I consider a priori and a posteriori elements especially in our modal inquiry to be so deeply intertwined that it is not easy to tell them apart. Supposed metaphysically necessary identity statements (...) involving natural kind terms are a good example: the fact that empirical input is crucial in establishing their necessity has clouded the role and content of the a priori input, as I have previously argued. For instance, the supposed metaphysically necessary identity statement involving water and its microstructure can only be established with the help of a controversial a priori principle concerning the determination of chemical properties by microstructure. The Kripke-Putnam framework of modal epistemology fails precisely because it is unclear whether the required a priori element is present. My positive proposal builds on E. J. Lowe’s work. Lowe holds that our knowledge of metaphysical modality is based on our knowledge of essence. Lowe’s account strives to offer a uniform picture of modal epistemology: essence is the basis of all our modal knowledge. This is the basis of Lowe’s modal rationalism. I believe that Lowe’s proposal is on the right lines in the case of abstract objects, but I doubt that it can be successfully applied to the case of natural kinds. Accordingly, the case of natural kinds will be my main focus and I will suggest that modal rationalism, at least as it is traditionally understood, falls short of explaining modal knowledge concerning natural kinds. Yet, I think that Lowe has identified something of crucial importance for modal epistemology, namely the essentialist, a priori elements present in our modal inquiry. The upshot is that rather than moving all the way from modal rationalism to modal empiricism, a type of hybrid approach, ‘empirically-informed modal rationalism ’, can be developed. (shrink)

Research programs regularly compete to achieve the same goal, such as the discovery of the structure of DNA or the construction of a TEA laser. The more the competing programs share information, the faster the goal is likely to be reached, to society’s benefit. But the “priority rule”-the scientific norm according to which the first program to reach the goal in question must receive all the credit for the achievement-provides a powerful disincentive for programs to share information. How, (...) then, is the clash between social and individual interest resolved in scientific practice? This chapter investigates what Robert Merton called science’s “communist” norm, which mandates universal sharing of knowledge, and uses mathematical models of discovery to argue that a communist regime may be on the whole advantageous and fair to all parties, and so might be implemented by a social contract that all scientists would be willing to sign. (shrink)

The paper provides an axiological analysis of the concepts of respect for information and of information dignity from the vantage point provided by Information Ethics and the conceptual paradigm of object-oriented analysis (OOA). The general perspective adopted is that of an ontocentric approach to the philosophy of information ethics, according to which the latter is an expansion of environmental ethics towards a less biologically biased concept of a ‘centre of ethical worth’. The paper attempts to answer (...) the following question: what is the lowest possible common set of attributes which characterises something as intrinsically valuable and an object of respect, and without which something would rightly be considered intrinsically worthless or even positively unworthy and therefore rightly disrespectable in itself? The thesis developed and defended in the paper is that the minimal condition of possibility of an object’s least intrinsic worthiness can be identified with its abstract nature as an information entity. Thus, all entities, interpreted as clusters of information, have a minimal moral worth qua information objects (i.e. qua information), that deserves to be respected. The principles elaborated in the course of the analysis are those of ‘reflective respect’ (A’s respect towards all members of A’s class motivated by A’s respect towards A not qua individual, but qua instantiation of a class of entities), ‘ontic uniformity’ (A’s recognition of A’s membership to the class of information entities) and ‘ontic solidarity’ (A’s recognition of any information entity’s dignity). (shrink)

The article investigates the sceptical challenge from an informationtheoretic perspective. Its main goal is to articulate and defend the view that either informational scepticism is radical, but then it is epistemologically innocuous because redundant; or it is moderate, but then epistemologically beneficial because useful. In order to pursue this cooptation strategy, the article is divided into seven sections. Section 1 sets up the problem. Section 2 introduces Borei numbers as a convenient way to refer uniformly to (the data that individuate) (...) different possible worlds. Section 3 adopts the Hamming distance between Borei numbers as a metric to calculate the distance between possible worlds. In Sects. 4 and 5, radical and moderate informational scepticism are analysed using Borei numbers and Hamming distances, and shown to be either harmless (extreme form) or actually fruitful (moderate form). Section 6 further clarifies the approach by replying to some potential objections. In the conclusion, the Peircean nature of the overall approach is briefly discussed. (shrink)