This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. (...) The paper ends by advocating for a more practice-based approach towards the philosophical understanding of proof systems and their role in structural proof theory. (shrink)

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each (...) nested calculus inherits favorable proof-theoretic properties from its associated labelled calculus. (shrink)

This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. (...) In the single-agent case, we show that the refined calculi Ldm^m_nL derive theorems within a restricted class of (forestlike) sequents, allowing us to provide proof-search algorithms that decide single-agent STIT logics. We prove that the proof-search algorithms are correct and terminate. (shrink)

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties (...) from their associated labelled calculi, such as completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics. (shrink)

This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated (...) syntax that explicitly incorporates the semantics of the associated logic, and such systems typically violate the subformula property to a high degree. By contrast, nested sequent calculi employ a simpler syntax and adhere to a strict reading of the subformula property, making such systems useful in the design of automated reasoning algorithms. However, the downside of the nested sequent paradigm is that a general theory concerning the automated construction of such calculi (as in the labelled setting) is essentially absent, meaning that the construction of nested systems and the confirmation of their properties is usually done on a case-by-case basis. The refinement method connects both paradigms in a fruitful way, by transforming labelled systems into nested (or, refined labelled) systems with the properties of the former preserved throughout the transformation process. To demonstrate the method of refinement and some of its applications, we consider grammar logics, first-order intuitionistic logics, and deontic STIT logics. The introduced refined labelled calculi will be used to provide the first proof-search algorithms for deontic STIT logics. Furthermore, we employ our refined labelled calculi for grammar logics to show that every logic in the class possesses the effective Lyndon interpolation property. (shrink)

We present cut-free labelled sequent calculi for a central formalism in logics of agency: STIT logics with temporal operators. These include sequent systems for Ldm , Tstit and Xstit. All calculi presented possess essential structural properties such as contraction- and cut-admissibility. The labelled calculi G3Ldm and G3Tstit are shown sound and complete relative to irreflexive temporal frames. Additionally, we extend current results by showing that also Xstit can be characterized through relational frames, omitting the use (...) of BT+AC frames. (shrink)

A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in (...) the number of truth values, and it is shown that this bound is tight. (shrink)

The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant (...) logics. (shrink)

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are (...) sound and complete, and it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.

We argue that the universal recommendations against “off-label” pediatric use of approved COVID-19 issued by the FDA, CDC, and AAP are overbroad. Especially for higher-risk children, vaccination can be ethically justified even before FDA authorization or approval – and similar reasoning is relevant for even younger patients. Legal risks can also be managed, although the FDA, CDC, and Department of Health and Human Services (HHS) should move quickly to provide clarity.

We introduce an effective translation from proofs in the display calculus to proofs in the labelled calculus in the context of tense logics. We identify the labelled calculus proofs in the image of this translation as those built from labelled sequents whose underlying directed graph possesses certain properties. For the basic normal tense logic Kt, the image is shown to be the set of all proofs in the labelled calculus G3Kt.

We review the definition of the Full Bayesian Significance Test (FBST), and summarize its main statistical and epistemological characteristics. We review also the Abstract Belief Calculus (ABC) of Darwiche and Ginsberg, and use it to analyze the FBST’s value of evidence. This analysis helps us understand the FBST properties and interpretation. The definition of value of evidence against a sharp hypothesis, in the FBST setup, was motivated by applications of Bayesian statistical reasoning to legal matters where the sharp hypotheses were (...) defendants statements, to be judged according to the Onus Probandi juridical principle. (shrink)

One of the core insights from Eleanor Rosch’s work on categorization is that human categorization isn’t arbitrary. Instead, two psychological principles constrain possible systems of classification for all human cultures. According to these principles, the task of a category system is to provide maximum information with the least cognitive effort, and the perceived world provides us with structured rather than arbitrary features. In this paper, I show that Rosch's insights give us important resources for making progress on the 'feasibility question' (...) in conceptual engineering: the question of how we can implement conceptual engineering projects in ways that are practically feasible. Specifically, I show that one overlooked upshot of Rosch's work is that naming practices play an extremely important role in the construction of perceived similarities within and dissimilarities between categories, and, correspondingly, the dissemination of social stereotypes that serve as markers between different categories that are otherwise similar. Thus, naming practices will be a crucial constraint for the feasibility of certain ameliorative projects. (shrink)

We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.

This note is based on a lecture delivered at the Conference on the Scien- tic Research of the Mathematical Center of Opole, Turawa, May 10-11th, 1980. A somewhat extended version will be published in the Proceedings of the Conference. At the same time it is an abstract of a part of a planned larger paper, which will involve the theory of label-tokens. The theory is included into the author's monograph in Polish "Teorie Językow Syntaktycznie Kategorialnych", PWN, Warszawa-Wrocław 1985 and into (...) its English version: Theory of Language Syntax. Categorial Approach, Kluwer Academic Publishers, Boston-London-Dordrecht 1991. (shrink)

In his Tractatus, Wittgenstein sets out what he calls his N-operator notation which can be used to calculate whether an expression is a tautology. In his Laws of Form, George Spencer Brown offers what he calls a “primary algebra” for such calculation. Both systems are perplexing. But comparing two blurry images can reduce noise, producing a focus. This paper reveals that Spencer Brown independently rediscovered the quantifier-free part of the N-operator calculus. The comparison sheds a flood light on each and (...) from the letters of correspondence we shall find that Russell, as one might have surmised, was a catalyst for both. (shrink)

In this essay, I analyse Howard S. Becker's labelling theory, using Wittgenstein and Foucault to argue that it has significant explanatory power in describing what I term "the hegemonic power of the label". Much of this essay hints at my general thought with regards hegemony at the level of interaction and language. Final grade was first class honours, 2,000 word limit. -/- The ideas expressed herein have matured significantly since. I am working on a quantitative study with my University to (...) analyse the ability of Becker's labelling theory (plus some ideas of my own) to explain the exact process of the social construction of age. I am also working on a revision of the theory of hegemony, of which includes analysis of hegemony at an interactive/linguistic level, which is heavily influenced by Becker's and Wittgenstein's thought. (shrink)

We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the (...) original proof. We then present a linear natural deduction calculus that makes use of formal illocutionary expressions in such a way that unique readability for derivations is guaranteed – thus showing that formalizing illocutionary expressions can eliminate the need for commentary. (shrink)

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can (...) be computed from the calculus. (shrink)

In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...) translation is a tautology of its corresponding σ-system. We then use these results to obtain other key advantages. Most interestingly, we provide a recipe for building unlabeled sequent calculi for σ-systems. We then exemplify this with a σ-system useful for logics of the ST family, and prove soundness and completeness for it, which indirectly gives us a calculus for the metainferences of all those mixed systems. Finally, we respond to some possible objections and show how our σ-framework can shed light on the “obeying” discussion within mixed metainferential contexts. (shrink)

Recent studies have explored the effectiveness of open-label placebos for a variety of conditions, including chronic pain, cancer-related fatigue and irritable bowel syndrome. OLPs are thought to sidestep traditional ethical worries about placebos because they do not involve deception: with an OLP, patients or subjects are told outright that they are not given an active substance. As deception is framed as the primary hurdle to ethical placebo use, the door is ostensibly opened to ethical studies of OLPs. In this article, (...) I suggest that even though OLPs seemingly do not involve deception, there are other ethical considerations in their clinical investigation and subsequent use. Research ethics often focusses on informed consent—of which, deception and honesty are a piece—as a means to justify research practices with human subjects. Yet, it is but one of the ethical considerations that should be taken into account. With research into placebo effects in particular, I argue that the history of clinical placebo use grounds special considerations for OLP research that go beyond respect for the autonomy of individual patients through informed consent and encompass structural concerns about the type of patient for whom a placebo has historically been thought appropriate. (shrink)

This paper discusses the following question: why was the term “dunatos” (“possible”) employed by Aristotle as an alternative label for imperfect syllogisms in his discussion of assertoric syllogistic? My answer ascribes to Aristotle a bottom up perspective, in which he stresses what is necessary in the premise-pairs to attain target conclusions of a given form within a given figure. I argue that “dunatos” is employed by Aristotle to stress that an imperfect syllogism is always one of the possible options to (...) attain a conclusion of a given form within a given figure. I also argue that this picture sheds some light on Aristotle’s clarifications of the final clause in his definition of syllogism. (shrink)

1. Historically, our sense of smell has been deemed informationally impoverished, not very discerning, subjective, ineffable, and generally of little value (for an overview, see e.g., Barwich, 2020...

This commentary defends 3 arguments for changing the label of levonorgestrel-based emergency contraception (LNG EC) so that it no longer supports the possibility of a mechanism of action after fertilization. First, there is no direct scientific evidence confirming any postfertilization mechanisms. Second, despite the weight of evidence, there is still widespread public misunderstanding over the mechanism of LNG EC. Third, this FDA label is not a value-free claim, but instead it has functioned like a political tool for reducing contraceptive access. (...) The label is laden with antiabortion values (even though EC is contraception, not abortion), and it imposes these values on potential users, resulting in barriers to access such as with Burwell v. Hobby Lobby. These 3 arguments together provide scientific, social, and ethical grounds for the FDA to take the initiate in changing Plan B's drug label. (shrink)

Despite its prevalence, the term ‘extreme’ has received little critical attention. ‘Extremity’ is routinely employed in ways that imply its meanings are self-evident. However, the adjective itself offers no such clarity. This article focuses on one particular use of the term – ‘extreme porn’ – in order to illustrate a broader set of concerns about the pitfalls of labelling. The label ‘extreme’ is typically employed as a substitute for engaging with the term’s supposed referents (here, pornographic content). In its contemporary (...) usage, ‘extreme’ primarily refers to a set of context-dependent judgements rather than absolute standards or any specific properties the ‘extreme’ item is alleged to have. Concurrently then, the label ‘extreme’ carries a host of implicit values, and the presumption that the term’s meanings are ‘obvious’ obfuscates those values. In the case of ‘extreme porn’, this obfuscation is significant because it has facilitated the cultural and legal suppression of pornography. (shrink)

In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied.

Abstract: The development of technology pushes human to increase productivity by changing manual system to automatic system. Modernization affect almost all aspect especially in art. Batik is a ancestor legacy of indonesian people that recogized by UNESCO as culture legacy of Indonesia yet batik industries are not develop as much. Modernization in batik art is expected to optimize its productivity. This research design algorithm and the program in MATLAB that used for controlling movement protype of batik maker 2 dof cartesian (...) robot. The input data is a picture that will be processed to obtain the order of coordinate edge. Then it procesed and sent to plantby using MATLAB based on Graphical User Interface (GUI). The 2 dof Cartesian robot and a pen (end effector) is used to draw a pattern. A servo motor is installed to activate end effector and two stepper motor coupled with thread mechanic that used to move it towards the X and Y axis. Testing is done by sending coordinat orders to the plant or by observing drawing process order. Obtained error from program and algorithm testing is 2,32% . (shrink)

By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an empty name (...) in the model, so we are able to construct a 3-valued matrix, while for the latter, for which an empty name is necessary, the respective matrices are 4-valued. (shrink)

The study, designed to find out the gender outcome, gender roles, and labeling of labels in the department's head examination, was conducted using 194 study participants recruited from lecturers at Dire Dawa University in Ethiopia 116 women and 78 were males aged 29.23. The following five labels are used: Department head in general, efficient male Department head, efficient female Department head, inefficient male Department head, and inefficient female Department head) were responded to by the research participants. Seven different hypotheses were (...) tested using ANOVA. Findings revealed that gender role orientation had a significant effect on the evaluation of the Department head. Furthermore, there were no significant effects of gender, and attachment of labels on the evaluation of Department head and no interaction effects of gender and gender role orientation, gender and attachment of labels and gender, gender role orientation, and attachment of labels on the evaluation of Department head. (shrink)

I explain and criticize a theory of beliefs and of belief sentences offered by Graeme Forbes. My main criticism will be directed at Forbes' idea that, as a matter of the semantic rules of belief reporting -- as a matter of the meaning of belief ascriptions -- to get at the subject's way of thinking in an attitude ascription, we must use expressions that are "linguistic counterparts" of the subject's expressions. I think we often do something like that, but that (...) we have other, equally good methods of getting at ways of thinking; so what is wanted is a more inclusive characterization of the rules of belief reporting by which we manage to do it -- a characterization more along the lines of: anything goes. (shrink)

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting (...) to embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

Analytic philosophy has been perhaps the most successful philosophical movement of the twentieth century. While there is no one doctrine that defines it, one of the most salient features of analytic philosophy is its reliance on contemporary logic, the logic that had its origin in the works of George Boole and Gottlob Frege and others in the mid‐to‐late nineteenth century. Boolean algebra, the heart of Boole's contributions to logic, has also come to represent a cornerstone of modern computing. Frege had (...) broad philosophical interests, and his writings on the nature of logical form, meaning and truth remain the subject of intense theoretical discussion, especially in the analytic tradition. Frege's works, and the powerful new logical calculi developed at the end of the nineteenth century, influenced many of its most seminal figures, such as Bertrand Russell, Ludwig Wittgenstein and Rudolf Carnap. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with (...) formal grammars, and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A tableau (...) system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

This article develops a logic with two fundamental components: objects and labels. We compare the properties of the two universes that can be constructed from these building blocks and show how they naturally resolve a class of linguistic paradoxes. We conclude with a application to modal logics involving context fields.

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

Disputes about the causal structure of natural selection have implications for teleosemantics. Etiological, mainstream teleosemantics is based on a causalist view of natural selection. The core of its solution to Brentano’s Problem lies in the solution to Kant’s Puzzle provided by the Modern Synthesis concerning populational causation. In this paper, I suggest that if we adopt an alternative, statisticalist view on natural selection, the door is open for two reflections. First, it allows for setting different challenges to etiological teleosemantics that (...) arise if a statisticalist reading of natural selection is right. Second, by providing a different solution to Kant’s Puzzle based on individual causes of evolution, statisticalism promotes a different answer to Brentano’s Problem, what I label as Agential Teleosemantics. (shrink)

The label `semiotic grammar' captures a fundamental property of the grammars of human languages: not only is language a semiotic system in the familiar Saussurean sense, but its organizing system, its grammar, is also a semiotic system. This proposition, explicated in detail by William McGregor in this book, constitutes a new theory of grammar. Semiotic Grammar is `functional' rather than `formal' in its intellectual origins, approaches, and methods. It demonstrates, however, that neither a purely functional nor a purely formal account (...) of language is adequate, given the centrality of the sign as the fundamental unit of grammatical analysis. The author distinguishes four types of grammatical signs: experiential, logical, interpersonal, and textural. The signifiers of these signs are syntagmatic relationships of the following types, respectively: constituency, dependency, conjugational and linking. McGregor illustrates and exemplifies the theory with data from a variety of languages including English, Acehnese, Polish, Finnish, Japanese, Chinese, and Mohawk; and from his pioneering research on Gooniyandi and Nyulnyul, two languages of the Kimberleys region of Western Australia. (shrink)

One main goal of argumentation theory is to evaluate arguments and to determine whether they should be accepted or rejected. When there is no clear answer, a third option, being undecided, has to be taken into account. Indecision is often not considered explicitly, but rather taken to be a collection of all unclear or troubling cases. However, current philosophy makes a strong point for taking indecision itself to be a proper object of consideration. This paper aims at revealing parallels between (...) the findings concerning indecision in philosophy and the treatment of indecision in argumentation theory. By investigating what philosophical forms and norms of indecision are involved in argumentation theory, we can improve our understanding of the different uncertain evidential situations in argumentation theory. (shrink)

In the substitutional framework, validity is truth under all substitutions of the nonlogical vocabulary. I develop a theory where □ is interpreted as substitutional validity. I show how to prove soundness and completeness for common modal calculi using this definition.

In this article I offer an opinionated overview of the central elements of Kant’s philosophical methodology during the critical period. I begin with a brief characterization of how Kant conceives of the aims of human inquiry – focusing on the idea that inquiry ideally aims at not just cognition (Erkenntnis), but also the more demanding cognitive achievements that Kant labels insight (Einsehen) and comprehension (Begreifen). Then I explore the implications of this picture for philosophy — emphasizing Kant’s distinction between critical (...) and doctrinal phases of philosophical inquiry, with the first of these playing both a negative and a positive role with respect to the second. Then, I will argue that this positive role is possible, according to Kant, only insofar as philosophy follows what I call a “capacities-first” methodology – that is, one that treats basic cognitive capacities (such as reason) and their self-conscious activities as fundamental (in both a cognitive sense and in an explanatory sense) for the sort of philosophy human beings are capable of. It is this methodology, I will argue, that allows Kant to introduce the first principles that philosophy in its doctrinal phase requires in a manner that is neither arbitrary nor (at least obviously) incompatible with Kant’s own critical restrictions on cognition. I conclude by discussing some of the implications of this methodological picture – including the methodological significance of self-consciousness and regressive or “transcendental” arguments, Kant’s distinction between analytic and synthetic methods in philosophy, and Kant’s conception of reason as autonomous. (shrink)

The current political climate is awash with groups that we might be tempted to label irrational, extremist, hyper-partisan; it is full of echo-chambers, radicalization, and epistemic bubbles. Philosophers have profitably analyzed some of these phenomena. In this essay, I draw attention to a crucial but neglected aspect of our time: the way in which certain groups are fanatical. I distinguish fanatical groups from other types of problematic groups, such as extremist and cultish groups. I argue that a group qualifies as (...) fanatical only if it has features that promote individual fanaticism. But how might a group promote individual fanaticism? I argue that a typical feature of fanatical groups is their tendency to encourage an emotion that philosophers sometimes call “ressentiment,” which differs from ordinary resentment. I explain what ressentiment is, how it can be fostered, and how it can lead to fanaticism. I contend that this account helps us to identify a disturbing and increasingly widespread feature of contemporary social and political groups. (shrink)

The first learning game to be developed to help students to develop and hone skills in constructing proofs in both the propositional and first-order predicate calculi. It comprises an autotelic (self-motivating) learning approach to assist students in developing skills and strategies of proof in the propositional and predicate calculus. The text of VALIDITY consists of a general introduction that describes earlier studies made of autotelic learning games, paying particular attention to work done at the Law School of Yale University, (...) called the ALL Project (Accelerated Learning of Logic). Following the introduction, the game of VALIDITY is described, first with reference to the propositional calculus, and then in connection with the first-order predicate calculus with identity. Sections in the text are devoted to discussions of the various rules of derivation employed in both calculi. Three appendices follow the main text; these provide a catalogue of sequents and theorems that have been proved for the propositional calculus and for the predicate calculus, and include suggestions for the classroom use of VALIDITY in university-level courses in mathematical logic. (shrink)

Reism or concretism are the labels for a position in ontology and semantics that is represented by various philosophers. As Kazimierz Ajdukiewicz and Jan Woleński have shown, there are two dimensions with which the abstract expression of reism can be made concrete: The ontological dimension of reism says that only things exist; the semantic dimension of reism says that all concepts must be reduced to concrete terms in order to be meaningful. In this paper we argue for the following two (...) theses: (1) Arthur Schopenhauer has advocated a reistic philosophy of language which says that all concepts must ultimately be based on concrete intuition in order to be meaningful. (2) In his semantics, Schopenhauer developed a theory of logic diagrams that can be interpreted by modern means in order to concretize the abstract position of reism. Thus we are not only enhancing Jan Woleński’s list of well-known reists, but we are also adding a diagrammatic dimension to concretism, represented by Schopenhauer. (shrink)

In a recent paper, Erasmus et al. (2021) defend the idea that the ambiguity of the term “explanation” in explainable AI (XAI) can be solved by adopting any of four different extant accounts of explanation in the philosophy of science: the Deductive Nomological, Inductive Statistical, Causal Mechanical, and New Mechanist models. In this chapter, I show that the authors’ claim that these accounts can be applied to deep neural networks as they would to any natural phenomenon is mistaken. I also (...) provide a more general argument as to why the notion of explainability as it is currently used in the XAI literature bears little resemblance to the traditional concept of scientific explanation. It would be more fruitful to use the label “understandable AI” to avoid the confusion that surrounds the goal and purposes of XAI. In the second half of the chapter, I argue for a pragmatic conception of understanding that is better suited to play the central role attributed to explanation in XAI. Following De Regt (2017) and Kuorikoski and Ylikoski (2015), the conditions of satisfaction for understanding an ML system are fleshed out in terms of an agent’s success in using the system. (shrink)

Contrary to economics or history, for example, there does not exist an organized field dedicated to the philosophy of political science. Given that the philosophical issues raised by political science research are just as pressing and vibrant as those raised in these more organized fields, fostering a field that labels itself Philosophy of Political Science (PoPS) is important. PoPS is advanced here as a fruitful meeting place where both philosophers and practicing political scientists contribute and discuss—with philosophical discussions that are (...) close to and informed by actual developments in political science, making philosophy of science continuous with the sciences in line with contemporary naturalist philosophy of science. The topics scrutinized in the different chapters of the Handbook will figure prominently in PoPS, as we lay out in this chapter. (shrink)

“Art”—what is it? What sort of entities are artworks? “Art”—when is it? Normally, when we visit an art exhibition, when we listen to a concert or when we look at a performing art in a setting, we use to read the titles, the tags or something textual, a threshold not crafted by the author, about the exposed or executed artworks in order to grasp their subject, style, history, and author. But: how does a title, a non-fiction depiction or a pointing, (...) and different ways of para-textual activation, entitle and unable us to such an operation and to live an aesthetic relation? This issue of “Aisthesis” explores the conditions under which it could be useful to distinguish between aesthetic objects and artworks–visual, musical, literary, performing arts– and to admit that the existence of the latter depends on a marginal and basic component of them: tags. The issue contains articles by Jerrold Levinson, Bernard Sève, Filippo Focosi, Alberto Voltolini, Giulia Alberti, Pietro Kobau, Jean-Pierre Cometti, Isabelle Thomas-Fogiel, Filippo Fimiani, Bertrand Rougé, Leardo Botti, Michel Déguy, Jean-Marie Klinkenberg, Micla Petrelli, Andrea Olivieri, Alessandro Ottaviani. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (shrink)

According to the so-called ‘Taking Condition’ (a label due to Boghossian 2014) on inference, for a response R in circumstances C to count as an instance of reasoning or inferring, it must be the case that the agent’s taking it that R is warranted or justified in C plays (the right sort of) explanatory role in her R-ing. The Taking Condition has come under much criticism in the theory of reasoning. While I believe that these criticisms can be answered, my (...) aim in this paper is to build a positive case for the Taking Condition. More specifically, I argue that views based on the Taking Condition do a much better job accounting for crucial features of reasoning—especially once we recognize the pervasiveness and significance of defeasibility in our reasoning. (shrink)