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 creme caramel is delicious, you would ordinarily assume that I have actually tasted the creme 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)

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)

After some generalities about connections between functions and relations in Sections 1 and 2 recalls the possibility of taking the semantic values of ‐ary Boolean connectives as ‐ary relations among truth‐values rather than as ‐ary truth functions. Section 3, the bulk of the paper, looks at correlates of these truth‐value relations as applied to formulas, and explores in a preliminary way how their properties are related to the properties of “logical relations” among formulas such as equivalence, implication (entailment) (...) and contrariety (logical incompatibility), concentrating for illustrative purposes on binary logical relations such as those just listed. To avoid an excess of footnotes, some points have been deferred to an Appendix as “Longer Notes”. (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)

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)

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)

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)

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)

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)

The present thesis focuses on counterfactuals. Specifically, we will address new questions and open problems that arise for the standard semantic accounts of counterfactual conditionals. The first four chapters deal with the Lewisian semantic account of counterfactuals. On a technical level, we contribute by providing an equivalent algebraic semantics for Lewis' variably strict conditional logics, which is notably absent in the literature. We introduce a new kind of algebra and differentiate between local and global versions of each of Lewis' variably (...) strict conditional logics. We study the algebraic properties of Lewis' logics and the structure theory of our newly introduced algebras. Additionally, we employ a new algebraic construction, based on the framework of Boolean algebras of conditionals, to provide an alternative semantics for Lewisian counterfactual conditionals. This semantic account allows us to establish new truth conditions for Lewisian counterfactuals, implying that Lewisian counterfactuals are definable conditionals, and each counterfactual can be characterized as a modality of a corresponding probabilistic conditional. We further extend these results by demonstrating that each Lewisian counterfactual can also be characterized as a modality of the corresponding Stalnaker conditional. The resulting formal semantic framework is much more expressive than the standard one and, in addition to providing new truth conditions for counterfactuals, it also allows us to define a new class of conditional logics falling into the broader framework of weak logics. On the philosophical side, we argue that our results shed new light on the understanding of Lewisian counterfactuals and prompt a conceptual shift in this field: Lewisian counterfactual dependence can be understood as a modality of probabilistic conditional dependence or Stalnakerian conditional dependence. In other words, whether a counterfactual connection occurs between A and B depends on whether it is "necessary" for a Stalnakerian/probabilistic dependence to occur between A and B. We also propose some ways to interpret the kind of necessity involved in this interpretation. The remaining two chapters deal with the probability of counterfactuals. We provide an answer to the question of how we can characterize the probability that a Lewisian counterfactual is true, which is an open problem in the literature. We show that the probability of a Lewisian counterfactual can be characterized in terms of belief functions from Dempster-Shafer theory of evidence, which are a super-additive generalization of standard probability. We define an updating procedure for belief functions based on the imaging procedure and show that the probability of a counterfactual A > B amounts to the belief function of B imaged on A. This characterization strongly relies on the logical results we proved in the previous chapters. Moreover, we also solve an open problem concerning the procedure to assign a probability to complex counterfactuals in the framework of causal modelling semantics. A limitation of causal modelling semantics is that it cannot account for the probability of counterfactuals with disjunctive antecedents. Drawing on the same previous works, we define a new procedure to assign a probability to counterfactuals with disjunctive antecedents in the framework of causal modelling semantics. We also argue that our procedure is satisfactory in that it yields meaningful results and adheres to some conceptually intuitive constraints one may want to impose when computing the probability of counterfactuals. (shrink)

Gottfried Leibniz embarked on a research program to prove all the Aristotelic categorical syllogisms by diagrammatic and algebraic methods. He succeeded in proving them by means of Euler diagrams, but didn’t produce a manuscript with their algebraic proofs. We demonstrate how key excerpts scattered across various Leibniz’s drafts on logic contained sufficient ingredients to prove them by an algebraic method –which we call the Leibniz-Cayley (LC) system– without having to make use of the more expressive and complex machinery of first-order (...) quantificational logic. In addition, we prove the classic categorical syllogisms again by a relational method –which we call the McColl-Ladd (ML) system– employing categorical relations studied by Hugh McColl and Christine Ladd. Finally, we show the connection of ML and LC with Boolean algebra, proving that ML is a consequence of LC, and that LC is a consequence of the Boolean lattice axioms, thus establishing Leibniz’s historical priority over George Boole in characterizing and applying (a sufficient fragment of) Boolean algebra to effectively tackle categorical syllogistic. (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)

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work aims to fill this gap by providing a comprehensive logico-algebraic analysis of Lewis's logics. We begin by introducing novel finite axiomatizations for varying strengths of Lewis's logics, distinguishing between global and local consequence relations on Lewisian sphere models. We then demonstrate that the global consequence relation is strongly algebraizable in (...) terms of a specific class of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local consequence relation is generally not algebraizable, although it can be characterized as the degree-preserving logic over the same algebraic models. Further, we delve into the algebraic semantics of Lewis's logics, developing two dual equivalences with respect to particular topological spaces. In more details, we show a duality with respect to the topological version of Lewis's sphere models, and also with respect to Stone spaces with a selection function; using the latter, we demonstrate the strong completeness of Lewis's logics with respect to sphere models. Finally, we draw some considerations concerning the limit assumption over sphere models. (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)

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)

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)

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)

Configurational Comparative Methods (CCMs) aim to learn causal structures from datasets by exploiting Boolean sufficiency and necessity relationships. One important challenge for these methods is that such Boolean relationships are often not satisfied in real-life datasets, as these datasets usually contain noise. Hence, CCMs infer models that only approximately fit the data, introducing a risk of inferring incorrect or incomplete models, especially when data are also fragmented (have limited empirical diversity). To minimize this risk, evaluation measures for sufficiency (...) and necessity should be sensitive to all relevant evidence. This article points out that the standard evaluation measures in CCMs, consistency and coverage, neglect certain evidence for these Boolean relationships. Correspondingly, two new measures, contrapositive consistency and contrapositive coverage, which are equivalent to the binary classification measures specificity and negative predictive value, respectively, are introduced to the CCM context as additions to consistency and coverage. A simulation experiment demonstrates that the introduced contrapositive measures indeed help to identify correct CCM models. (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)

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)

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.

This article discusses the process of universalization of education in Brazil the count from a specific spatiality - the places on the edge of the Transmazonica highway. There being no need toquestion the scope and effectiveness of expanding access to basic education, given its wide acceptance in the country - we start from the principle of geographical connectivity/connection to problematize such educational universalization. We aim to reflect on the scope of basic education, its conditions and ability to potentiate or not (...) the diversity of the territory. Methodologically grounded in a dialogue between phenomenology and existentialism, we conduct a literature review taking as starting point the preliminary empirical research data. We conclude that the universalization of education is configured as extermination argument that effective the urbanocentric vision and one connectedness between places and territory, produces disconnection of the places themselves, removing their ability to communicative action that jeopardizes not only education the local, but regional and national. (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.

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.

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)

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)

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)

This chapter draws attention to some deep points of philosophical connection between Arendt’s Lectures and Kant’s own and contemporary Kantian legal and political writings in the English-speaking world today. The aim is not to convince as such, but to show ways to bridge these historical divisions such that we can utilize these important works left us in the philosophical canon as we strive to improve our understanding of politics generally and the particular political challenges facing us. In this way, this (...) chapter strives to stay in Arendt’s and Kant’s philosophical spirit of thinking of their works as resources we can use as we strive to think and do better, whether we see to do so as Kantians, Arendtians, or Karendtians. (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)

We should drop the marketplace of ideas as our go-to metaphor in free speech discourse and take up a new metaphor of the connected city. Cities are more liveable when they have an integrated mix of transport options providing their occupants with a variety of locomotive affordances. Similarly, societies are more liveable when they have a mix of communication platforms that provide a variety of communicative affordances. Whereas the marketplace metaphor invites us to worry primarily about authoritarian control over the (...) content that circulates through our communication networks, the connected-city metaphor invites us to worry, more so, about the homogenization of the tools and formats through which we communicate. I argue that the latter worry demands greater attention under emerging technological conditions. (shrink)

College towns contain mixtures of students and locals, tied to the intitution’s urban life. Due to students’ health, community engagement must be prioritized in these towns. However, technology is often blamed for distancing people. A paradoxical use of it, specifically immersive technology, a youth favorite, can be the solution by focusing on the technological narratives of the institute-related materials to improve community cohesion. This strategy shaped connections between students and locals and among past, present, and future. In this presentation, the (...) impact of immersive technology will be discussed and compared in two college towns, Lancaster, UK, and Lubbock, USA. (shrink)

The Rigidity Thesis states that no rigid term can have the same semantic content as a nonrigid one. Drawing on Dummett (1973; 1991), Evans (1979; 1982), and Lewis (1980), Stanley (1997a; 1997b; 2002) rejects the thesis since it relies on an illicit identification of compositional semantic content and the content of assertion (henceforth, assertoric content). I argue that Stanley’s critique of the Rigidity Thesis fails since it places constraints on assertoric content that cannot be satisfied by any plausible notion of (...) content appropriately related to compositional semantic content. For similar reasons, I also challenge a recent two-dimensionalist defense of Stanley by Ninan (2012). The moral is far-reaching: any theory that invokes a distinction between semantic and assertoric contents is unsatisfactory unless it can plausibly explain the connection between them. (shrink)

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)

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)

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)

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)

Tourism education plays a key role in shaping students’ engagement with sustainability by providing them with the knowledge and skills to address environmental challenges and encouraging them to promote sustainable practices in the industry. This study explores how four years of tourism education at Prince of Songkla University in Phuket, Thailand, influence students’ knowledge, attitudes, and intentions toward sustainability. Despite gaining theoretical knowledge of sustainability principles, the findings reveal a decline in students’ willingness to adopt environmental sustainability practices as their (...) years of education increase. This may reflect a disconnect between classroom lessons and practical application, potentially due to limited practical learning experiences and the prevalent “eco-deficit culture” within the tourism industry, which often prioritizes profit over environmental responsibility. As a result, students may filter out information regarding environmental sustainability despite their sustainability education at the university. To support long-term engagement in sustainability, the paper recommends revising curricula to include more experiential learning opportunities, interdisciplinary collaboration, and stronger partnerships with industry stakeholders. (shrink)

Karl Pfeifer argues against Searle's "Connection Principle" which requires that unconscious intentional mental states must be in principle accessible to consciousness.

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.

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.

The use of impact factor (IF) in the scientific and academic world is not new. A phenomenon that has gained widespread recognition and utilization. However, in modern-day usage, there seems to be a trend in higher education where academics are evaluated based on the impact factor of journals where scholarly works are published. This trend is gradually shifting the paradigm from the assessment of research contents to publication venues. This does not align with the original purpose of IF conceived by (...) Garfield in 1955. One question that has continued to agitate the minds of concerned academics is whether the IF of journals is a dependable measure of research quality. This paper is an attempt to clarify or address this problem. Based on a thorough literature search and filtration, several problems about the use of IF as a research quality measure are discussed as well as their implications. Recommendations were also made aimed at providing a way forward in higher education. (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)

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)

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.

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)

Students often have difficulty connecting theoretical and text-based scholarship to the real world. When teaching in Asia, this disconnection is exacerbated by the European/American focus of many canonical texts, whereas students' own experiences are primarily Asian. However, in my discipline of political philosophy, this problem receives little recognition nor is it comprehensively addressed. In this paper, I propose that the problem must be taken seriously, and I share my own experiences with a novel pedagogical strategy which might offer a possible (...) path forward. Recent scholarship has championed an active learning approach, where students engage in their own research, and deliver outward-facing products that have a meaning and purpose beyond the confines of the student-professor relationship. In this spirit, I have put into practice a strategy of course design, where active learning is used to overcome students' disconnection with the course content. In particular, as a major component of course assessment, students are required to write an 'opinion piece', which is then showcased on a public website. The opinion piece must address a real-world issue which the student himself or herself selects and deems important; furthermore, it must build on the theoretical tools of the course and be written in a style which makes it accessible to a wider audience. I discuss the implementation of this strategy in two political philosophy courses, including strategies to avoid 'dumbing down' and ‘diluting’ the process of critical thinking. While no formal analysis of impact of the strategy on learning outcomes has been conducted, an anonymous pedagogical survey has yielded an overwhelmingly positive response for students' self-reported perceptions of the curricular innovations. (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)

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)

This paper looks at the debates between internalism and externalism in mind and epistemology. In each realm, internalists face what we call 'The Connection Problem', while externalists face what we call 'The Problem of Opacity'. We offer an integrated account of thought content and epistemic warrant that overcomes the problems. We then apply the framework to debates between internalists and externalists in metaethics.