The logical theory of branching space-times, which provides a relativistic framework for studying objective indeterminism, remains mostly disconnected from discussions of space-time theories in philosophy of physics. Earman has criticized the branching approach and suggested “pruning some branches from branching space-time.” This article identifies the different—order-theoretic versus topological—perspective of both discussions as a reason for certain misunderstandings and tries to remove them. Most important, we give a novel, topological criterion of modal consistency that usefully generalizes an earlier criterion, and we (...) introduce a differential-geometrical version of branching space-times as a non-Hausdorff (generalized) manifold. (shrink)

A classic result in the foundations of Yang-Mills theory, due to J. W. Barrett ["Holonomy and Path Structures in General Relativity and Yang-Mills Theory." Int. J. Th. Phys. 30, ], establishes that given a "generalized" holonomy map from the space of piece-wise smooth, closed curves based at some point of a manifold to a Lie group, there exists a principal bundle with that group as structure group and a principal connection on that bundle such that the holonomy map corresponds (...) to the holonomies of that connection. Barrett also provided one sense in which this "recovery theorem" yields a unique bundle, up to isomorphism. Here we show that something stronger is true: with an appropriate definition of isomorphism between generalized holonomy maps, there is an equivalence of categories between the category whose objects are generalized holonomy maps on a smooth, connected manifold and whose arrows are holonomy isomorphisms, and the category whose objects are principal connections on principal bundles over a smooth, connected manifold. This result clarifies, and somewhat improves upon, the sense of "unique recovery" in Barrett's theorems; it also makes precise a sense in which there is no loss of structure involved in moving from a principal bundle formulation of Yang-Mills theory to a holonomy, or "loop", formulation. (shrink)

Jeff Paris proves a generalized Dutch Book theorem. If a belief state is not a generalized probability then one faces ‘sure loss’ books of bets. In Williams I showed that Joyce’s accuracy-domination theorem applies to the same set of generalized probabilities. What is the relationship between these two results? This note shows that both results are easy corollaries of the core result that Paris appeals to in proving his dutch book theorem. We see that every point of (...) accuracy-domination defines a dutch book, but we only have a partial converse. (shrink)

First-order logic is known to have a severely limited expressive power on finite structures. As a result, several different extensions have been investigated, including fragments of second-order logic, fixpoint logic, and the infinitary logic L∞ωω in which every formula has only a finite number of variables. In this paper, we study generalized quantifiers in the realm of finite structures and combine them with the infinitary logic L∞ωω to obtain the logics L∞ωω, where Q = {Qi: iε I} is a (...) family of generalized quantifiers on finite structures. Using the logics L∞ωω, we can express polynomial-time properties that are not definable in L∞ωω, such as “there is an even number of x” and “there exists at least n/2 x” , without going to second-order logic. We show that equivalence of finite structures relative to L∞ωω can be characterized in terms of certain pebble games that are a variant of the Ehrenfeucht—Fraïssé games. We combine this game-theoretic characterization with sophisticated combinatorial tools from Ramsey theory, such as van der Waerden's Theorem and Folkman's Theorem, in order to investigate the scope and limits of generalized quantifiers in finite model theory. We obtain sharp lower bounds for expressibility in the logics L∞ωω and discover an intrinsic difference between adding finitely many simple unary generalized quantifiers to L∞ωω adding infinitely many. In particular, we show that if Qis a finite sequence of simple unary generalized quantifiers, then the equicardinality, or Härtig, quantifier is not definable in L∞ωω. We also show that the query “does the equivalence relation E have an even number of equivalence classes” is not definable in the extension L∞ωω of L∞ωω by the Härtig quantifier I and any finite sequence Q of simple unary generalized quantifiers. (shrink)

Here P is the density operator of the system under consideration, and σ ± and σ 3 are the usual Pauli matrices, acting on atom i whose states are |1 > or |0 >, representing, respectively, the atom being in an excited state or in the ground state. B and C are appropriate decay constants and s has been called the pumping parameter [1]. It varies from s = 0 for pure damping to s = 1 for full laser action. (...) To solve the corresponding quantum master equations, three approaches have been taken: First, one focuses on the case of one atom. Second, one truncates eq. (1) and derives semi-classical models. Third, one employs numerical simulation methods such as the quantum trajectory method. While the latter method is very popular, it should be noted that the numerical complexity of the problem increases exponentially with the number of atoms, and so numerical methods soon become unfeasible. (shrink)

In this paper I propose a set-theoretical interpretation of the logical square of opposition, in the perspective opened by generalized quantifier theory. Generalized quantifiers allow us to account for the semantics of quantificational Noun Phrases, and of other natural language expressions, in a coherent and uniform way. I suggest that in the analysis of the meaning of Noun Phrases and Determiners the square of opposition may help representing some semantic features responsible to different logical properties of these expressions. (...) I will conclude with some consideration on scope interactions between quantifiers. (shrink)

This paper sheds light on the relationship between the logic of generalized truth values and the logic of bilattices. It suggests a definite solution to the problem of axiomatizing the truth and falsity consequence relations, \ and \ , considered in a language without implication and determined via the truth and falsity orderings on the trilattice SIXTEEN 3 . The solution is based on the fact that a certain algebra isomorphic to SIXTEEN 3 generates the variety of commutative and (...) distributive bilattices with conflation. (shrink)

Recent results of Partee, Rooth, Krifka and other formal semanticians confirm that topic-focus articulation (TFA) of sentence is relevant for its semantics. The essential import of TFA, which is more apparent in case of a language with relatively free word order such as Czech than in case of English, has been traditionally intensively studied by Czech linguists. In this paper we would like to indicate the possibility of the account for TFA in terms of the theory of generalized quantifiers, (...) drawing on the results of both these groups of theoreticians. The basic intuition which we accept as our point of departure is the intuition of topic as the “semantic subject” and focus as the “semantic predicate”; we point out that the role of topic is to specify the entity the sentence is “about” (thereby triggering a presupposition), while that of the focus is to reveal a characterization of this entity, and usually a characterization that is in some sense exhaustive. Then we show that it may be plausible to consider topic and focus as arguments to an implicit generalized quantifier, which may get overridden by an explicit focalizer. (shrink)

As the principle of natural selection is generalized to explain (adaptive) patterns of human behavior, it becomes less clear what the selective environment empirically refers to. While the environment and individual are relatively separable in the non-human biological context, they are highly entangled in the context of moral, social, and institutional evolution. This chapter brings attention to the problem of generalizing the selective environment, and argues that it is ontologically disunified and definable only through its explanatory function. What unifies (...) the selective environment is that it explains adaptation in a non-agential way, by screening off various forms of agency, whether divine, organismic, or human. This explanatory function of the selective environment helps avoid some sources of confusion when the theory of natural selection is applied to humanities and social sciences. (shrink)

The market failures approach to business ethics has recently garnered substantial critical attention (see, e.g., Cohen and Peterson 2019; Moriarty 2020; Steinberg 2017; Hsieh 2017; von Kriegstein 2016; Smith 2018; Endorfer and Larue 2022; Singer 2018). Though precursors of this view can be found in the literature (e.g., McMahon 1981; Friedman 1970), it was Joseph Heath (2004, 2006, 2014, 2023) who developed the approach and gave it its name. The market failures approach (henceforth: MFA) is concerned with the ethical obligations (...) of managers of firms (Heath 2014, 69). Roughly, it holds that managers ought not to conduct their businesses in a way that exploits market failures. “Market failure” is a technical term, meaning any failure of the conditions of the first fundamental welfare theorem, sometimes called the “Pareto conditions” (see Arrow 1951). The theorem states that if the Pareto conditions hold, then the market equilibrium will use society’s scarce resources efficiently, meaning that no one could be made better-off without making anyone else worse off. Efficiency, according to Heath (2014, chapter 7), is the implicit morality of the market. We coordinate much of our shared activity using markets, Heath claims, because of their ability to produce efficient results. Markets are good forms of social organization, according to Heath, because they are the best way to promote our values given empirical facts about the frailties of human psychology and the informational constraints that we face. As such, managers ought not compromise the very conditions that justify a market economy by profiting from breakdowns in the market’s efficiency. Managers are permitted to maximize profits, so long as they do not violate the market’s norm of efficiency in so doing. This is because the fundamental justification for the profit motive is that it is necessary for the operation of the price system which is essential to the efficiency properties of markets. In this paper, I will argue that the MFA is more general than even Heath himself claims. The MFA describes the professional obligations of managers, but the view I develop, the generalized market failures approach, describes the obligations of all market participants. Since efficiency is the implicit morality of the market, it binds not just managers, but all market participants, including consumers, investors and workers. Market participants are permitted to maximize the benefit they gain from market interactions, as long as they do so in a way that does not take advantage of any market failures. Generalizing the MFA in this way has three benefits: first, we gain a unified understanding of the ethics of non-managerial market roles; second, we will develop an even better understanding of the duties of managers; finally, it gives us the resources to respond to some familiar objections to the MFA found in the literature. In the next section, I will further motivate the MFA and explain how this motivation can be easily generalized to other market roles. Importantly, one can avoid benefiting from a market failure in two distinct ways: by avoiding transactions that exploit market failures or by transacting in such markets and then remediating the harm done, by compensating those negatively affected by the market failure. This section concludes by discussing how the remediation duties are to be split between the transacting parties and how to identify the parties to whom compensation is owed. In section 3, I use the tools of the generalized MFA to develop a unified ethics of consumption, investment and labor, respectively. This is the basis of a grand abductive argument for the generalized MFA. The view is strongly supported by the fact that it provides attractive and unifying explanations of our obligations in domains as variegated as carbon offsetting, CEO compensation, the reparations white Americans owe to black Americans and occupational licensure. Section 4 briefly concludes. (shrink)

Extant literature suggests a positive correlation between social trust (also called generalized trust) and life satisfaction. However, the psychological pathways underlying this relationship can be complex. Using the Bayesian Mindsponge Framework (BMF), we examined the influence of social trust in a high-violence environment. Employing Bayesian analysis on a sample of 1237 adults in Cali, Colombia, we found that in a linear relationship, generalized trust is positively associated with life satisfaction. However, in a model including the interactions between trust (...) and education level as well as between trust and socioeconomic status, generalized trust is found to be negatively associated with life satisfaction. In this non-linear relationship, both education level and socioeconomic status have moderating effects against the negative association between generalized trust and life satisfaction. In other words, less educated people living in worse socioeconomic conditions are more likely to have lower life satisfaction when they have higher levels of social trust. In contrast, highly educated people living in better socioeconomic conditions are more likely to have higher life satisfaction when they have higher levels of social trust. Due to the facilitating function of trust in information processing, lowering the rigor of the filtering system in a high-violence social environment will likely put an individual at risk. Based on our findings, we suggest that policymakers should consider the impacts of social contexts when advocating for increasing social trust. We also recommend that researchers carefully examine the psychological mechanism underlying an observed association before making suggestions for policymaking. (shrink)

Conservativity in generalized quantifiers is linked to presupposition filtering, under a propositions-as-types analysis extended with dependent quantifiers. That analysis is underpinned by modeltheoretically interpretable proofs which inhabit propositions they prove, thereby providing objects for quantification and hooks for anaphora.

The aim of the present paper is to analyse compactness properties of nonmonotonic inference operations within the framework of model theory. For this purpose the concepts of a deductive frame and its semantical counterpart, a semantical frame are introduced. Compactness properties play a fundamental in the study of non-monotonic inference, and in the paper several new versions of compactness are studied.

Searching for information is critical in many situations. In medicine, for instance, careful choice of a diagnostic test can help narrow down the range of plausible diseases that the patient might have. In a probabilistic framework, test selection is often modeled by assuming that people's goal is to reduce uncertainty about possible states of the world. In cognitive science, psychology, and medical decision making, Shannon entropy is the most prominent and most widely used model to formalize probabilistic uncertainty and the (...) reduction thereof. However, a variety of alternative entropy metrics (Hartley, Quadratic, Tsallis, Rényi, and more) are popular in the social and the natural sciences, computer science, and philosophy of science. Particular entropy measures have been predominant in particular research areas, and it is often an open issue whether these divergences emerge from different theoretical and practical goals or are merely due to historical accident. Cutting across disciplinary boundaries, we show that several entropy and entropy reduction measures arise as special cases in a unified formalism, the Sharma–Mittal framework. Using mathematical results, computer simulations, and analyses of published behavioral data, we discuss four key questions: How do various entropy models relate to each other? What insights can be obtained by considering diverse entropy models within a unified framework? What is the psychological plausibility of different entropy models? What new questions and insights for research on human information acquisition follow? Our work provides several new pathways for theoretical and empirical research, reconciling apparently conflicting approaches and empirical findings within a comprehensive and unified information-theoretic formalism. (shrink)

Several authors proposed to devise logical structures for Natural Language (NL) semantics in which noun phrases yield referential terms rather than standard Generalized Quantifiers. In this view, two main problems arise: the need to refer to the maximal sets of entities involved in the predications and the need to cope with Independent Set (IS) readings, where two or more sets of entities are introduced in parallel. The article illustrates these problems and their consequences, then presents an extension of the (...) proposal made in Sher (J Philos Logic 26:1–43, 1997 ) in order to properly represent the meaning of IS readings involving NL quantifiers. The solution proposed here allows to uniformly deal with both standard linear and IS readings, regardless of their actual existence in NL or quantifiers’ monotonicity. Sentences featuring nested quantifications are particularly problematic. By avoiding parallel nested quantification in the formulae, the proper true values are achieved. (shrink)

The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type t there is a generalized quantifier of type t which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than t. This was proved for unary similarity types by (...) Per Lindström [17] with a counting argument. We extend his method to arbitrary similarity types. (shrink)

Context: In this paper I expand aspects of the generalized bottom-up explanatory approach devised in Part I to expound the natural emergence of composite self-organized dynamic systems endowed with self-produced embodied boundaries and with observed degrees of autonomous behavior. In Part I, the focus was on the rules defined by Varela, Maturana & Uribe (VM&U rules), viewed as a validation test to assess if an observed system is autopoietic. This was accomplished by referring to Maturana’s ontological-epistemological frame and by (...) defining distinctions, concepts, and abstractions necessary to describe dynamic systems in any observational domain. This approach concentrates on pure causation flow rather than on domain-specific interaction mechanisms. Problem: It is essential to analyze the requirements imposed by the VM&U rules on the “intra-boundaries” phenomenology for compliance with the self-production capabilities expected from an autopoietic system. Beyond what is merely implied by the compact wording of the VM&U rules, a key point needs to be addressed explicitly: how to describe some “peculiar” capabilities that the components should be endowed with to participate in new component production (as macro-molecules do in the biological domain) so that system’s self-production can be assessed. Method: Using this approach, I first describe the process of constituting self-organized dynamic structures provided with embodied boundaries. Then I explain how a capability of self-organization emerges and how this results in ephemeral configurations that may evolve into self-regulated long-lasting dynamic system stability within a continuous causation flow inside the boundaries, up to the emergence of some “specialized” subsets of components. This explication allows us to distinguish the medium, the boundaries, and the core of a self-organized dynamic system and to focus attention on the “intra-boundaries” phenomenology that should be at the heart of self-production capabilities, as prescribed by the 5th and 6th VM&U rules. Results: I propose an abstract, domain-free description of the “peculiar” composition and decomposition transformation capabilities that components should possess while subject to state transitions triggered within the “intra-boundaries” causation flow. This is combined with a discussion concerning the “intra-boundaries” causation structure’s possible topological layouts that could be compliant with the 6th rule. Implications: The above-mentioned results allow us to improve our analytic criteria when observing dynamic systems existing in non-biological domains in order to assess their autopoietic nature. They also reveal that the task of consistently identifying possible non-biological autopoietic systems is harder than merely identifying self-organized dynamic systems provided with boundaries and some observable autonomous behavioral capabilities in a given observational domain. More implications will be discussed further in Part III. (shrink)

Extant literature suggests a positive correlation between social trust (also called generalized trust) and life satisfaction. However, the psychological pathways underlying this relationship can be complex. Using the Bayesian Mindsponge Framework (BMF), we examined the influence of social trust in a high-violence environment. Employing Bayesian analysis on a sample of 1237 adults in Cali, Colombia, we found that in a linear relationship, generalized trust is positively associated with life satisfaction. However, in a model including the interactions between trust (...) and education level as well as between trust and socioeconomic status, generalized trust is found to be negatively associated with life satisfaction. In this non-linear relationship, both education level and socioeconomic status have moderating effects against the negative association between generalized trust and life satisfaction. In other words, less educated people living in worse socioeconomic conditions are more likely to have lower life satisfaction when they have higher levels of social trust. In contrast, highly educated people living in better socioeconomic conditions are more likely to have higher life satisfaction when they have higher levels of social trust. Due to the facilitating function of trust in information processing, lowering the rigor of the filtering system in a high-violence social environment will likely put an individual at risk. Based on our findings, we suggest that policymakers should consider the impacts of social contexts when advocating for increasing social trust. We also recommend that researchers carefully examine the psychological mechanism underlying an observed association before making suggestions for policymaking. (shrink)

Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.

REFERENCES Barwise, J. & R. Cooper (1981) — 'Generalized Quantifiers and Natural Language', Linguistics and Philosophy 4:2159-219. Van Benthem, J. (1983a) — ' Five Easy Pieces', in Ter Meulen (ed.), 1-17. Van Benthem, J. (1983b) ...

The concept of a generalized quantifier of a given similarity type was defined in [12]. Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity typetthere is a generalized quantifier of typetwhich is not definable in the extension of first order logic by all generalized quantifiers of type smaller thant. This was proved for unary similarity types by Per Lindström [17] with a (...) counting argument. We extend his method to arbitrary similarity types. (shrink)

The filtration method is often used to prove the finite model property of modal logics. We adapt this technique to the generalized Veltman semantics for interpretability logics. In order to preserve the defining properties of generalized Veltman models, we use bisimulations to define adequate filtrations. We give an alternative proof of the finite model property of interpretability logic with respect to Veltman models, and we prove the finite model property of the systems and with respect to generalized (...) Veltman models. (shrink)

Probabilistic inference forms lead from point probabilities of the premises to interval probabilities of the conclusion. The probabilistic version of Modus Ponens, for example, licenses the inference from \({P(A) = \alpha}\) and \({P(B|A) = \beta}\) to \({P(B)\in [\alpha\beta, \alpha\beta + 1 - \alpha]}\) . We study generalized inference forms with three or more premises. The generalized Modus Ponens, for example, leads from \({P(A_{1}) = \alpha_{1}, \ldots, P(A_{n})= \alpha_{n}}\) and \({P(B|A_{1} \wedge \cdots \wedge A_{n}) = \beta}\) to an according (...) interval for P(B). We present the probability intervals for the conclusions of the generalized versions of Cut, Cautious Monotonicity, Modus Tollens, Bayes’ Theorem, and some SYSTEM O rules. Recently, Gilio has shown that generalized inference forms “degrade”—more premises lead to less precise conclusions, i.e., to wider probability intervals of the conclusion. We also study Adam’s probability preservation properties in generalized inference forms. Special attention is devoted to zero probabilities of the conditioning events. These zero probabilities often lead to different intervals in the coherence and the Kolmogorov approach. (shrink)

Kripke [1975] gives a formal theory of truth based on Kleene's strong evaluation scheme. It is probably the most important and influential that has yet been given—at least since Tarski. However, it has been argued that this theory has a problem with generalized quantifiers such as All—that is, All ϕs are ψ—or Most. Specifically, it has been argued that such quantifiers preclude the existence of just the sort of language that Kripke aims to deliver—one that contains its own truth (...) predicate. In this paper I solve the problem by showing how Kleene's strong scheme, and Kripke's theory based on it, can in a natural way be extended to accommodate the full range of generalized quantifiers. (shrink)

Polysemous concepts with multiple related meanings pervade natural languages, yet some philosophers argue that we should eliminate them to avoid miscommunication and pointless debates in scientific discourse. This paper defends the legitimacy of polysemous concepts in science against this eliminativist challenge. My approach analyses such concepts as patchworks with multiple scale-dependent, technique-involving, domain-specific and property-targeting uses (patches). I demonstrate the generality of my approach by applying it to "hardness" in materials science, "homology" in evolutionary biology, "gold" in chemistry and "cortical (...) column" in neuroscience. Such patchwork concepts are legitimate if the techniques used to apply them produce reliable results, the domains to which they are applied are homogenous, and the properties they refer to are significant to describe, classify or explain the behavior of entities in the extension of the concept. By following these normative constraints, researchers can avoid miscommunication and pointless debates without having to eliminate polysemous patchwork concepts in scientific discourse. (shrink)

We here examine the expressive power of first order logic with generalized quantifiers over finite ordered structures. In particular, we address the following problem: Given a family Q of generalized quantifiers expressing a complexity class C, what is the expressive power of first order logic FO(Q) extended by the quantifiers in Q? From previously studied examples, one would expect that FO(Q) captures L C , i.e., logarithmic space relativized to an oracle in C. We show that this is (...) not always true. However, after studying the problem from a general point of view, we derive sufficient conditions on C such that FO(Q) captures L C . These conditions are fulfilled by a large number of relevant complexity classes, in particular, for example, by NP. As an application of this result, it follows that first order logic extended by Henkin quantifiers captures L NP . This answers a question raised by Blass and Gurevich [Ann. Pure Appl. Logic, vol. 32, 1986]. Furthermore we show that for many families Q of generalized quantifiers (including the family of Henkin quantifiers), each FO(Q)-formula can be replaced by an equivalent FO(Q)-formula with only two occurrences of generalized quantifiers. This generalizes and extends an earlier normal-form result by I. A. Stewart [Fundamenta Inform. vol. 18, 1993]. (shrink)