Simple taste predications come with an `acquaintance requirement': they require the speaker to have had a certain kind of first-hand experience with the object of predication. For example, if I tell you that the crème caramel is delicious, you would ordinarily assume that I have actually tasted the crème caramel and am not simply relying on the testimony of others. The present essay argues in favor of a lightweight expressivist account of the acquaintance requirement. This account consists of a recursive (...) semantics and an account of assertion; it is compatible with a number of different accounts of truth and content, including contextualism, relativism, and purer forms of expressivism. The principal argument in favor of this account is that it correctly predicts a wide range of data concerning how the acquaintance requirement interacts with Boolean connectives, generalized quantifiers, epistemic modals, and attitude verbs. (shrink)

Biochemical networks are often called upon to illustrate emergent properties of living systems. In this contribution, I question such emergentist claims by means of theoretical work on genetic regulatory models and random Boolean networks. If the existence of a critical connectivity Kc of such networks has often been coined “emergent” or “irreducible”, I propose on the contrary that the existence of a critical connectivity Kc is indeed mathematically explainable in network theory. This conclusion also applies to many other types (...) of formal networks and weakens the emergentist claim attached to bio-molecular networks, and by extension to living systems. (shrink)

This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The paper highlights that the main ideas can be implemented in different grammar formalisms, and discusses in detail an implementation where the partial ordering on categories is given (...) by the derivability relation of a calculus with residuated and Galois-connected unary operators. (shrink)

Formal semantic analyses often take words to be minimal building blocks for the purposes of compositionality. But various recent theories of morphology and syntax have converged on the view that there is no demarcation line corresponding to the word level. The same conclusion has emerged from the compositional semantics of superlatives. In the spirit of extending compositionality below the word level, this paper explores how a small set of particles (Japanese KA and MO, Chinese DOU, and Hungarian VALA/VAGY, MIND, and (...) IS) form quantifier words and serve as connectives, additive and scalar particles, question markers, and existential verbs. The main question is whether the meanings of these particles across the varied environments are highly regular, or they are lexicalized with a variety of different meanings that bear a family resemblance. This paper does not reach definitive conclusions, but it raises analytical possibilities using Boolean semantics and the semantics of alternatives. It also draws attention to systematic similarities and some differences between MO and DOU that have not been studied in the literature. (shrink)

Natural language contains simple lexical items for some but not all Boolean operators. English, for example, contains conjunction and, disjunction or, negated disjunction nor, but no word to express negated conjunction *nand nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described here as a bilateral extension of update semantics. The basic intuition (...) is that a context can be updated by assertion or by rejection, and by one or multiple propositions at once. These distinctions suffice to characterize the logic of the lexicon. (shrink)

Abstract. Let REL(O*E) be the relation algebra of binary relations defined on the Boolean algebra O*E of regular open regions of the Euclidean plane E. The aim of this paper is to prove that the canonical contact relation C of O*E generates a subalgebra REL(O*E, C) of REL(O*E) that has infinitely many elements. More precisely, REL(O*,C) contains an infinite family {SPPn, n ≥ 1} of relations generated by the relation SPP (Separable Proper Part). This relation can be used to (...) define point-free concept of connectedness that for the regular open regions of E coincides with the standard topological notion of connectedness, i.e., a region of the plane E is connected in the sense of topology if and only if it has no separable proper part. Moreover, it is shown that the contact relation algebra REL(O*E, C) and the relation algebra REL(O*E, NTPP) generated by the non-tangential proper parthood relation NTPP, coincide. This entails that the allegedly purely topological notion of connectedness can be defined in mereological terms. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Logical information theory is the quantitative version of the logic of partitions just as logical probability theory is the quantitative version of the dual Boolean logic of subsets. The resulting notion of information is about distinctions, differences and distinguishability and is formalized using the distinctions of a partition. All the definitions of simple, joint, conditional and mutual entropy of Shannon information theory are derived by a uniform transformation from the corresponding definitions at the logical level. The purpose of this (...) paper is to give the direct generalization to quantum logical information theory that similarly focuses on the pairs of eigenstates distinguished by an observable, i.e., qudits of an observable. The fundamental theorem for quantum logical entropy and measurement establishes a direct quantitative connection between the increase in quantum logical entropy due to a projective measurement and the eigenstates that are distinguished by the measurement. Both the classical and quantum versions of logical entropy have simple interpretations as “two-draw” probabilities for distinctions. The conclusion is that quantum logical entropy is the simple and natural notion of information for quantum information theory focusing on the distinguishing of quantum states. (shrink)

Abstract. The aim of this paper is to present a topological method for constructing discretizations (tessellations) of conceptual spaces. The method works for a class of topological spaces that the Russian mathematician Pavel Alexandroff defined more than 80 years ago. Alexandroff spaces, as they are called today, have many interesting properties that distinguish them from other topological spaces. In particular, they exhibit a 1-1 correspondence between their specialization orders and their topological structures. Recently, a special type of Alexandroff spaces was (...) used by Ian Rumfitt to elucidate the logic of vague concepts in a new way. According to his approach, conceptual spaces such as the color spectrum give rise to classical systems of concepts that have the structure of atomic Boolean algebras. More precisely, concepts are represented as regular open regions of an underlying conceptual space endowed with a topological structure. Something is subsumed under a concept iff it is represented by an element of the conceptual space that is maximally close to the prototypical element p that defines that concept. This topological representation of concepts comes along with a representation of the familiar logical connectives of Aristotelian syllogistics in terms of natural settheoretical operations that characterize regular open interpretations of classical Boolean propositional logic. In the last 20 years, conceptual spaces have become a popular tool of dealing with a variety of problems in the fields of cognitive psychology, artificial intelligence, linguistics and philosophy, mainly due to the work of Peter Gärdenfors and his collaborators. By using prototypes and metrics of similarity spaces, one obtains geometrical discretizations of conceptual spaces by so-called Voronoi tessellations. These tessellations are extensionally equivalent to topological tessellations that can be constructed for Alexandroff spaces. Thereby, Rumfitt’s and Gärdenfors’s constructions turn out to be special cases of an approach that works for a more general class of spaces, namely, for weakly scattered Alexandroff spaces. This class of spaces provides a convenient framework for conceptual spaces as used in epistemology and related disciplines in general. Alexandroff spaces are useful for elucidating problems related to the logic of vague concepts, in particular they offer a solution of the Sorites paradox (Rumfitt). Further, they provide a semantics for the logic of clearness (Bobzien) that overcomes certain problems of the concept of higher2 order vagueness. Moreover, these spaces help find a natural place for classical syllogistics in the framework of conceptual spaces. The crucial role of order theory for Alexandroff spaces can be used to refine the all-or-nothing distinction between prototypical and nonprototypical stimuli in favor of a more fine-grained gradual distinction between more-orless prototypical elements of conceptual spaces. The greater conceptual flexibility of the topological approach helps avoid some inherent inadequacies of the geometrical approach, for instance, the so-called “thickness problem” (Douven et al.) and problems of selecting a unique metric for similarity spaces. Finally, it is shown that only the Alexandroff account can deal with an issue that is gaining more and more importance for the theory of conceptual spaces, namely, the role that digital conceptual spaces play in the area of artificial intelligence, computer science and related disciplines. Keywords: Conceptual Spaces, Polar Spaces, Alexandroff Spaces, Prototypes, Topological Tessellations, Voronoi Tessellations, Digital Topology. (shrink)

In this paper the class of Fidel-structures for the paraconsistent logic mbC is studied from the point of view of Model Theory and Category Theory. The basic point is that Fidel-structures for mbC (or mbC-structures) can be seen as first-order structures over the signature of Boolean algebras expanded by two binary predicate symbols N (for negation) and O (for the consistency connective) satisfying certain Horn sentences. This perspective allows us to consider notions and results from Model Theory in order (...) to analyze the class of mbC-structures. Thus, substructures, union of chains, direct products, direct limits, congruences and quotient structures can be analyzed under this perspective. In particular, a Birkhoff-like representation theorem for mbC-structures as subdirect poducts in terms of subdirectly irreducible mbC-structures is obtained by adapting a general result for first-order structures due to Caicedo. Moreover, a characterization of all the subdirectly irreducible mbC-structures is also given. An alternative decomposition theorem is obtained by using the notions of weak substructure and weak isomorphism considered by Fidel for Cn-structures. (shrink)

The paper investigates the understanding of quantum indistinguishability after quantum information in comparison with the “classical” quantum mechanics based on the separable complex Hilbert space. The two oppositions, correspondingly “distinguishability / indistinguishability” and “classical / quantum”, available implicitly in the concept of quantum indistinguishability can be interpreted as two “missing” bits of classical information, which are to be added after teleportation of quantum information to be restored the initial state unambiguously. That new understanding of quantum indistinguishability is linked to the (...) distinction of classical (Maxwell-Boltzmann) versus quantum (either Fermi-Dirac or Bose-Einstein) statistics. The latter can be generalized to classes of wave functions (“empty” qubits) and represented exhaustively in Hilbert arithmetic therefore connectible to the foundations of mathematics, more precisely, to the interrelations of propositional logic and set theory sharing the structure of Boolean algebra and two anti-isometric copies of Peano arithmetic. (shrink)

In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional (...) implication operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices. (shrink)

Aristotle’s philosophy is considered with respect to one central concept of his philosophy, viz. opposition. Far from being a mere side-effect of syllogistic, it is argued in the present paper that opposition helps to articulate ontology and logic through an account of what can be or cannot be in a systematic and structural way. The paper is divided into three main parts. In Section I, the notion of Being is scrutinized through Aristotle’s theory of categories. In Section II, the notion (...) of Non-Being is connected to Aristotle’s theory of oppositions. In Section III, the notion of essence is revisited in order to bring about a holist theory of meaning by individuating through opposite properties. In conclusion, the legacy of Aristotle is depicted as balanced between a powerful reflection around Being and a restrictive ontology of substance. (shrink)

Given a three-valued definition of validity, which choice of three-valued truth tables for the connectives can ensure that the resulting logic coincides exactly with classical logic? We give an answer to this question for the five monotonic consequence relations $st$, $ss$, $tt$, $ss\cap tt$, and $ts$, when the connectives are negation, conjunction, and disjunction. For $ts$ and $ss\cap tt$ the answer is trivial (no scheme works), and for $ss$ and $tt$ it is straightforward (they are the collapsible schemes, (...) in which the middle value acts like one of the classical values). For $st$, the schemes in question are the Boolean normal schemes that are either monotonic or collapsible. (shrink)

Deontic logic is devoted to the study of logical properties of normative predicates such as permission, obligation and prohibition. Since it is usual to apply these predicates to actions, many deontic logicians have proposed formalisms where actions and action combinators are present. Some standard action combinators are action conjunction, choice between actions and not doing a given action. These combinators resemble boolean operators, and therefore the theory of boolean algebra offers a well-known athematical framework to study the properties (...) of the classic deontic operators when applied to actions. In his seminal work, Segerberg uses constructions coming from boolean algebras to formalize the usual deontic notions. Segerberg’s work provided the initial step to understand logical properties of deontic operators when they are applied to actions. In the last years, other authors have proposed related logics. In this chapter we introduce Segerberg’s work, study related formalisms and investigate further challenges in this area. (shrink)

Logical connectives (otherwise known as 'logical constants' or 'logical particles') have seemed challenging to philosophers of language. This article gives a concise account of logical connectives.

Pacific Conservation Biology has officially published the manuscript. The article can be accessed using the following DOI:10.1071/PC23044.

Conceivability is an important source of our beliefs about what is possible; inconceivability is an important source of our beliefs about what is impossible. What are the connections between the reliability of these sources? If one is reliable, does it follow that the other is also reliable? The central contention of this paper is that suitably qualified the reliability of inconceivability implies the reliability of conceivability, but the reliability of conceivability fails to imply the reliability of inconceivability.

Conceptual analysis, like any exclusively theoretical activity, is far from overrated in current psychology. Such a situation can be related both to the contingent influences of contextual and historical character and to the more essential metatheoretical reasons. After a short discussion of the latter it is argued that even within a strictly empirical psychology there are non-trivial tasks that can be attached to well-defined and methodologically reliable, conceptual work. This kind of method, inspired by the ideas of Ludwig Wittgenstein, Peter (...) Strawson (conceptual grammar), and Gilbert Ryle (conceptual geography), is proposed and formally depicted as being holistic, descriptive, and connective. Finally, the newly presented framework of connective conceptual analysis is defended against the “Charge from Psychology,” in a version developed by William Ramsey, claiming that conceptual analysis is based on psychological assumptions that have already been refuted by empirical psychology. (shrink)

We discuss the role of perceptron (or threshold) connectives in the context of Description Logic, and in particular their possible use as a bridge between statistical learning of models from data and logical reasoning over knowledge bases. We prove that such connectives can be added to the language of most forms of Description Logic without increasing the complexity of the corresponding inference problem. We show, with a practical example over the Gene Ontology, how even simple instances of perceptron (...) connectives are expressive enough to represent learned, complex concepts derived from real use cases. This opens up the possibility to import concepts learnt from data into existing ontologies. (shrink)

Integrating the concept of place meanings into protected area management has been difficult. Across a diverse body of social science literature, challenges in the conceptualization and application of place meanings continue to exist. However, focusing on relationships in the context of participatory planning and management allows protected area managers to bring place meanings into professional judgment and practice. This paper builds on work that has outlined objectives and recommendations for bringing place meanings, relationships, and lived experiences to the forefront of (...) land-use planning and management. It proposes the next steps in accounting for people’s relationships with protected areas and their relationships with protected area managers. Our goals are to 1) conceptualize this relationship framework; 2) present a structure for application of the framework; and 3) demonstrate the application in a specific protected area context, using an example from Alaska. We identify three key target areas of information and knowledge that managers will need to sustain quality relationship outcomes at protected areas. These targets are recording stories or narratives, monitoring public trust in management, and identifying and prioritizing threats to relationships. The structure needed to apply this relationship-focused approach requires documenting and following individual relationships with protected areas in multiple ways. The goal of this application is not to predict relationships, but instead to gain a deeper understanding of how and why relationships develop and change over time. By documenting narratives of individuals, managers can understand how relationships evolve over time and the role they play in individual’s lives. By understanding public trust, the shared values and goals of individuals and managers can be observed. By identifying and prioritizing threats, managers can pursue efforts that steward relationships while allowing for the protection of experiences and meanings. The collection and interpretation of these three information targets can then be integrated and implemented within planning and management strategies to achieve outcomes that are beneficial for resource protection, visitor experiences, and stakeholder engagement. By investing in this approach, agencies will gain greater understanding and usable knowledge towards the achievement of quality relationships. It represents an investment in both place relationships and public relations. By integrating such an approach into planning and management, protected area managers can represent the greatest diversity of individual place meanings and connections. relationships, place meanings, trust, narratives, planning, protected areas. (shrink)

he importance of gender equality and of women’s work in relation to the environment is regarded as a crucial question for development in “third‐world” rural societies. “Development” and a certain standard of welfare make these issues appear to be less urgent in a wealthier country such as Sweden. In this article, I trace some of the contradictions and connections in the ways in which gender equality is conceptualized in women’s struggles vis‐à‐vis environmental issues in rural areas in Sweden and India. (...) The article throws light on two important insights: First, in Sweden, where gender equality has been actively pursued as the bedrock of modern societal organizing, the space to organize as women in relation to environmental issues was fraught with ambiguity. Second, development discourses about equality and empowerment of oppressed third‐world women not only bear on how gender equality is conceptualized and practiced in the global South but also shape the space for gender equality in the North. Analyzing the two cases in relation to each other reveals the travel of ideas and conversations across distant geographical spaces. While ideas about the independent, empowered woman are used to deny agency to women’s collectives in India, gendered discrimination has taken different forms in Sweden, making it more difficult to contest. Understanding how this takes place opens an opportunity for interruption in an order and a space that appears to have become narrower under the umbrella of development, welfare, and growth. It brings into question the category of development in a southern but particularly so in a northern context, where the North, and especially Sweden, is taken as a referent for questions of development and gender equality. -/- . (shrink)

The spin-statistics connection is derived in a simple manner under the postulates that the original and the exchange wave functions are simply added, and that the azimuthal phase angle, which defines the orientation of the spin part of each single-particle spin-component eigenfunction in the plane normal to the spin-quantization axis, is exchanged along with the other parameters. The spin factor (−1)2s belongs to the exchange wave function when this function is constructed so as to get the spinor ambiguity under control. (...) This is achieved by effecting the exchange of the azimuthal angle by means of rotations and admitting only rotations in one sense. The procedure works in Galilean as well as in Lorentz-invariant quantum mechanics. Relativistic quantum field theory is not required. (shrink)

In this paper, I consider Sterba’s recent criticism of skeptical theism in context of his argument from evil. I show that Sterba’s criticism of skeptical theism shares an undesirable trait with all past criticisms of skeptical theism: it fails. This is largely due to his focus on causal connections and his neglect of logical connections. Because of this, his argument remains vulnerable to skeptical theism.

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions (...) of the connectives in question. (shrink)

The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.

I present and defend a novel version of the homeostatic property cluster account of natural kinds. The core of the proposal is a development of the notion of co-occurrence, central to the HPC account, along information-theoretic lines. The resulting theory retains all the appealing features of the original formulation, while increasing its explanatory power, and formal perspicuity. I showcase the theory by applying it to the problem of reconciling the thesis that biological species are natural kinds with the fact that (...) many such species are polymorphic. (shrink)

The present article delves into the extension of Knuth’s fundamental Boolean logic table to accommodate the complexities of indeterminate truth values through the integration of neutrosophic logic (Smarandache & Christianto, 2008). Neutrosophic logic, rooted in Florentin Smarandache’s groundbreaking work on Neutrosophic Logic (cf. Smarandache, 2005, and his other works), introduces an additional truth value, ‘indeterminate,’ enabling a more comprehensive framework to analyze uncertainties inherent in computational systems. By bridging the gap between traditional boolean operations and the indeterminacy present (...) in various real-world scenarios, this extension redefines logic tables, introducing neutrosophic operators that capture nuances beyond the binary realm. Through a thorough exploration of neutrosophic logic's principles and its implications in computational paradigms, this study proposes a novel approach to logic design that accommodates uncertain, imprecise, and incomplete information. This paradigm shift in logic tables not only broadens the spectrum of computing methodologies but also holds promise in fields such as decision-making systems and data analytics. This article amalgamates insights from over twelve key references encompassing seminal works in boolean logic, neutrosophic logic, and their applications in diverse scientific and computational domains, aiming to pave the way for a more robust and adaptable logic framework in computation. (shrink)

In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a duality (...) of consequence relations, with which we can maintain uniqueness in a bilateralist setting. (shrink)

This paper is concerned with representations of belief by means of nonadditive probabilities of the Dempster-Shafer (DS) type. After surveying some foundational issues and results in the D.S. theory, including Suppes's related contributions, the paper proceeds to analyze the connection of the D.S. theory with some of the work currently pursued in epistemic logic. A preliminary investigation of the modal logic of belief functions à la Shafer is made. There it is shown that the Alchourrron-Gärdenfors-Makinson (A.G.M.) logic of belief change (...) is closely related to the D.S. theory. The final section compares the critique of Bayesianism which underlies the present paper with some important objections raised by Suppes against this doctrine. -/- . (shrink)

In its origins educational neuroscience has started as an endeavor to discuss implications of neuroscience studies for education. However, it is now on its way to become a transdisciplinary field, incorporating findings, theoretical frameworks and methodologies from education, and cognitive and brain sciences. Given the differences and diversity in the originating disciplines, it has been a challenge for educational neuroscience to integrate both theoretical and methodological perspective in education and neuroscience in a coherent way. We present a multi-level framework for (...) educational neuroscience, which argues for integration of multiple levels of analysis, some originating in brain and cognitive sciences, others in education, as a roadmap for the future of educational neuroscience with concrete examples in moral education. (shrink)

The standard Lewis–Stalnaker semantics of counterfactuals, given the Strong Centering Thesis, implies that all true–true counterfactuals are trivially true. McGlynn developed a theory, based on Penczek, to rehabilitate the non-triviality of true–true counterfactuals. I show here that counterfactuals with true but irrelevant components are counterexamples to McGlynn’s account. I argue that an extended version of the connection hypothesis is sustainable, and grounds a full theory of counterfactuals explicable in a broadly standard way, if an indispensable asymmetry between semifacuals and other (...) counterfactuals is acknowledged. (shrink)

In this paper Beebee argues that the problem of induction, which she describes as a genuine sceptical problem, is the same for Humeans than for Necessitarians. Neither scientific essentialists nor Armstrong can solve the problem of induction by appealing to IBE, for both arguments take an illicit inductive step.

The paper outlines a model-theoretic framework for investigating and comparing a variety of mereotopological theories. In the first part we consider different ways of characterizing a mereotopology with respect to (i) the intended interpretation of the connection primitive, and (ii) the composition of the admissible domains of quantification (e.g., whether or not they include boundary elements). The second part extends this study by considering two further dimensions along which different patterns of topological connection can be classified - the strength of (...) the connection and its multiplicity. (shrink)

Being sure of each other is the blossoming of Kimberley Brownlee’s earlier work on the intrinsic value and qualities of human connection (2013, 2016c, 2016b), opening with a scene from A. A. Milne’s House at Pooh Corner: lost in the woods together, Piglet takes Pooh’s paw ‘just to be sure’ of his friend. The importance of social connection is often overlooked because it is central to our lives, like breathable air. Brownlee’s work highlights the need for social connection, as deserving (...) of more philosophical attention and practical protection through rights. But her key insight is that receiving relational goods isn’t all that matters: being able and permitted to provide relational goods to others, as Piglet and Pooh receive and offer each other reassurance, is just as essential for our wellbeing. Brownlee argues these interests are strong enough to ground rights (2016c: 28). (shrink)

This article synthesizes the results of several interviews with argumentation scholars from across the American continents to address three questions regarding the connections in argumentation studies between North and South/Central America: “What motivated the study of argumentation in the Americas?” “What commonalities, if any, exist in argumentation studies across the Americas?” and “What should the future of argumentation studies in the Americas look like?” Using these interviews in combination with existing textual sources, the article also provides motivated suggestions for directions (...) for the future of the community in the field. (shrink)

This book reports on theoretical and practical analyses of the ethical challenges connected to driving automation. It also aims at discussing issues that have arisen from the European Commission 2020 report “Ethics of Connected and Automated Vehicles. Recommendations on Road Safety, Privacy, Fairness, Explainability and Responsibility”. Gathering contributions by philosophers, social scientists, mechanical engineers, and UI designers, the book discusses key ethical concerns relating to responsibility and personal autonomy, privacy, safety, and cybersecurity, as well as explainability and human-machine interaction. On (...) the one hand, it examines these issues from a theoretical, normative point of view. On the other hand, it proposes practical strategies to face the most urgent ethical problems, showing how the integration of ethics and technology can be achieved through design practices. All in all, this book fosters a multidisciplinary approach where philosophy, ethics, and engineering are integrated, rather than just juxtaposed. It is meant to inform and inspire an audience of philosophers of technology, ethicists, engineers, developers, manufacturers, and regulators, among other interested readers. (shrink)

Numerous studies of the beliefs of people with anorexia nervosa (AN) suggest that a subset of such individuals may experience delusions. We first describe what makes a belief delusional and conclude that such characteristics can be appropriately applied to some beliefs of people with AN. Next, we outline how delusional beliefs may relate to the broader psychopathological process in AN, including: (1) they may be epiphenomenal; (2) they may be an initial partial cause of AN; (3) they may be caused (...) by aspects of AN; or (4) they may be sustaining causes, possibly involved in reciprocal causal relations with aspects of AN. We argue that there is good reason to believe that delusional beliefs of people with AN are not merely epiphenomenal, but rather that they’re causally connected to AN. Because of this, empirical studies can be designed to test for the presence of causal relations. We describe how these studies should be designed. The results of such studies have important implications for understanding the experience of individuals with AN and for the treatment of AN. We outline these implications. (shrink)

Permissivism is the view that, sometimes, there is more than one doxastic attitude that is perfectly rationalised by the evidence. Impermissivism is the denial of Permissivism. Several philosophers, with the aim to defend either Impermissivism or Permissivism, have recently discussed the value of (im)permissive rationality. This paper focuses on one kind of value-conferring considerations, stemming from the so-called “truth-connection” enjoyed by rational doxastic attitudes. The paper vindicates the truth-connected value of permissive rationality by pursuing a novel strategy which rests on (...) two main planks: first, there is a distinction between a fine-grained and a coarse-grained type-individuation of belief-forming methods. Secondly, different kinds of decision-theoretic reasoning, i.e. expected-accuracy reasoning and accuracy-domination reasoning, must be paired with a fine-grained and a coarse-grained type-individuation of methods, respectively. I argue that while the first pair is wholly irrelevant to the question of the truth-connection, the second affords the means to a permissivist explanation of the truth-connected value of rationality. (shrink)

In this paper, we show that for each forcing notion P in a transitive model M of ZFC, if P satisfies some conditions, there is an elementary embedding from M into a generic ultrapower contains a P-generic set. And, we also introduce the result that if we assume the existence of some large cardinals, the above generic ultrapower can be well-founded. Using this result, we prove some theorems on the problems of regularity properties of definable sets of reals.

Brouwer’s intuitionism was a far-reaching attempt to reform the foundations of mathematics. While the mathematical community was reluctant to accept Brouwer’s work, its response to later-developed brands of intuitionism, such as those presented by Hermann Weyl and Arend Heyting, was different. The paper accounts for this difference by analyzing the intuitionistic versions of Brouwer, Weyl, and Heyting in light of a two-tiered model of the body and image of mathematical knowledge. Such a perspective provides a richer account of each story (...) and points to a possible connection between the community’s reaction and the changes each mathematician had proposed. (shrink)

The discrete–structural structure of the world is described. In comparison with the idea of Heraclitus about an indissoluble world, preference is given to the discrete world of Democritus. It is noted that if the discrete atoms of Democritus were simple and indivisible, the atoms of the modern world indicated in the article would possess, rather, a structural structure. The article proves the problem of how the mutual connection of mathematics and philosophy influences cognition, which creates a discrete–structural worldview. The author (...) notes that the appearance of writing, symbolic language and the depiction of the picture of the world through mathematics, led us into the sphere of discrete mathematical mathematics. (shrink)

In aesthetics there is a long tradition according to which beauty is the object of love. One construal of this suggests a sentimentalist theory of beauty: beauty just is the object of an emotion aptly described as love. The first step toward such a view would be to discern whether we can make sense of at least some kind of aesthetic affect as at least some kind of love. I suggest that we can by taking up a thought from Frank (...) Sibley, according to whom aesthetic properties reflect non-aesthetic values that “go deep into human life and interests” or that “mean much to us” given the kinds of lives we live. I show how we might think that a variety of aesthetic affect represents its object as embodying life-affirming value and as such we can see a variety of aesthetic affect as a kind of love of life. It remains to be seen whether this can be leveraged into a theory of beauty narrowly construed. (shrink)

Complex human reasoning involves minimal abilities to extract conclusions implied in the available information. These abilities are considered “deductive” because they exemplify certain abstract relations among propositions or probabilities called deductive arguments. However, the electrophysiological dynamics which supports such complex cognitive pro- cesses has not been addressed yet. In this work we consider typically deductive logico- probabilistically valid inferences and aim to verify or refute their electrophysiological functional connectivity differences from invalid inferences with the same content (same relational variables, same (...) stimuli, same relevant and salient features). We recorded the brain electrophysiological activity of 20 participants (age 1⁄4 20.35 ± 3.23) by means of an MEG system during two consecutive reasoning tasks: a search task (invalid condition) without any specific deductive rules to follow, and a logically valid deductive task (valid condition) with explicit deductive rules as instructions. We calculated the functional connectivity (FC) for each condition and conducted a seed-based analysis in a set of cortical regions of interest. Finally, we used a cluster-based permutation test to compare the dif- ferences between logically valid and invalid conditions in terms of FC. As a first novel result we found higher FC for valid condition in beta band between regions of interest and left prefrontal, temporal, parietal, and cingulate structures. FC analysis allows a second novel result which is the definition of a propositional network with operculo-cingular, parietal and medial nodes, specifically including disputed medial deductive “core” areas. The experiment discloses measurable cortical processes which do not depend on content but on truth-functional propositional operators. These experimental novelties may contribute to understand the cortical bases of deductive processes. (shrink)

THE aim of this paper is to refute Hume's contention that there cannot be logically necessary connections between successive events. I intend to establish, in other words, not 'Logically necessary connections do exist between successive events', but instead the rather more modest proposition: 'It may be, it is possible, as far as we can ever know for certain, that logically necessary connections do exist between successive events.' Towards the end of the paper I shall say something about the implications of (...) rejecting Hume's contention. (shrink)

In response to the many social impacts of automated mobility, in September 2020 the European Commission published Ethics of Connected and Automated Vehicles, a report in which recommendations on road safety, privacy, fairness, explainability, and responsibility are drawn from a set of eight overarching principles. This paper presents the results of an interdisciplinary research where philosophers and engineers joined efforts to operationalize the guidelines advanced in the report. To this aim, we endorse a function-based working approach to support the implementation (...) of values and recommendations into the design of automated vehicle technologies. Based on this, we develop methodological tools to tackle issues related to personal autonomy, explainability, and privacy as domains that most urgently require fine-grained guidance due to the associated ethical risks. Even though each tool still requires further inquiry, we believe that our work might already prove the productivity of the function-based approach and foster its adoption in the CAV scientific community. (shrink)

There is an increase in the use of in-door wireless networking solutions via Wi-Fi and this increase infiltrated and utilized Wi-Fi enable devices, as well as smart mobiles, games consoles, security systems, tablet PCs and smart TVs. Thus the demand on Wi-Fi connections increased rapidly. Rule Based System is an essential method in helping using the human expertise in many challenging fields. In this paper, a Rule Based System was designed and developed for diagnosing the wireless connection problems and attain (...) a precise decision about the cause of the problem. SL5 Object expert system language was used in developing the rule based system. An Evaluation of the rule based system was carried out to test its accuracy and the results were promising. (shrink)

Contrary to the widely-held view that our conscious states are necessarily private (in that only one person can ever experience them directly), in this paper I argue that it is possible for a person to directly experience the conscious states of another. This possibility removes an obstacle to thinking of conscious states as physical, since their apparent privacy makes them different from all other physical states. A separation can be made in the brain between our conscious mental representations and the (...) executive processes that manipulate them and are guided by them in planning and executing behaviour. I argue here that these executive processes are also largely responsible for producing our sense of self in the moment. Our conscious perceptual representations themselves reside primarily in the posterior portions of the brain's cortex, in the temporal and parietal lobes, while the executive processes reside primarily in the prefrontal lobes. We can imagine an experiment in which we sever the association fibers that connect the posterior regions with these prefrontal regions and, instead, connect the posterior regions to the prefrontal regions of another person. According to my hypothesis, this would produce in the latter person the direct experience of the conscious perceptual states of the first person. (shrink)

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and (...) a natural extension of BLT is definitionally equivalent with ZF. (shrink)