This book offers a state-of-the-art introduction to the basic techniques and results of neighborhood semantics for modal logic. In addition to presenting the relevant technical background, it highlights both the pitfalls and potential uses of neighborhood models – an interesting class of mathematical structures that were originally introduced to provide a semantics for weak systems of modal logic. In addition, the book discusses a broad range of topics, including standard modal logic results ; bisimulations for (...) class='Hi'>neighborhood models and other model-theoretic constructions; comparisons with other semantics for modal logic ; neighborhood semantics for first-order modal logic, applications in game theory ; applications in epistemic logic ; and non-normal modal logics with dynamic modalities. The book can be used as the primary text for seminars on philosophical logic focused on non-normal modal logics; as a supplemental text for courses on modal logic, logic in AI, or philosophical logic ; or as the primary source for researchers interested in learning about the uses of neighborhood semantics in philosophical logic and game theory. (shrink)

The main purpose of this paper is to define and study a particular variety of Montague-Scott neighborhood semantics for modal propositional logic. We call this variety the first-order neighborhood semantics because it consists of the neighborhood frames whose neighborhood operations are, in a certain sense, first-order definable. The paper consists of two parts. In Part I we begin by presenting a family of modal systems. We recall the Montague-Scott semantics and apply it to (...) some of our systems that have hitherto be uncharacterized. Then, we define the notion of a first-order indefinite semantics, along with the more specific notion of a first-order uniform semantics, the latter containing as special cases the possible world semantics of Kripke. In Part II we prove consistency and completeness for a broad range of the systems considered, with respect to the first-order indefinite semantics, and for a selected list of systems, with respect to the first-order uniform semantics. The completeness proofs are algebraic in character and make essential use of the finite model property. A by-product of our investigations is a result relating provability in S-systems and provability in T-systems, which generalizes a known theorem relating provability in the systems S 2° and C 2. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (...) (like FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (shrink)

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula in terms of neighborhood frames with (...) constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics. We conclude by introducing general first order neighborhood frames and we offer a general completeness result in terms of them which circumvents some well-known problems of propositional and first order neighborhood semantics. We argue that the semantical program that thus arises surpasses both in expressivity and adequacy the standard Kripkean approach, even when it comes to the study of first order normal systems. (shrink)

We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E. In contrast to the well-known interpretation of higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE, but rather by a suitable complete Heyting algebra H. The canonical map relating H and ΩE both serves to interpret equality and provides a modal operator on H in the form of a comonad. Examples of such structures arise from surjective geometric morphisms (...) f : F → E, where H = f∗ΩF. The logic differs from non-modal higher-order logic in that the principles of functional and propositional extensionality are not longer valid but may be replaced by modalized versions. The usual Kripke, neighborhood, and sheaf semantics for propositional and first-order modal logic are subsumed by this notion. (shrink)

As part of an approach to the liar paradox and the other paradoxes affecting truth, I have proposed replacing our concept of truth with two concepts: ascending truth and descending truth.1 I am not going to discuss why I think this is the best approach or how it solves the paradoxes; instead, I concentrate on the theory of ascending and descending truth. I formulate an axiomatic theory of ascending truth and descending truth (ADT) and provide a possible-worlds semantics for (...) it (which I dub xeno semantics). Xeno semantics is a generalization of the familiar neighborhood semantics, which itself is a generalization of the standard relational semantics. Once the details of ADT have been presented, it is easy to show that neither relational semantics nor neighborhood semantics will work for it; thus, the move to a more general framework is required. The main result is a fixed point theorem that guarantees the existence of an acceptable first-order constant-domain xeno model. From this result it follows that ADT is sound with respect to the class of such models. The upshot is that ADT is consistent relative to the background set theory. (shrink)

The intuitive notion of evidence has both semantic and syntactic features. In this paper, we develop an evidence logic for epistemic agents faced with possibly contradictory evidence from different sources. The logic is based on a neighborhood semantics, where a neighborhood N indicates that the agent has reason to believe that the true state of the world lies in N. Further notions of relative plausibility between worlds and beliefs based on the latter ordering are then defined in (...) terms of this evidence structure, yielding our intended models for evidence-based beliefs. In addition, we also consider a second more general flavor, where belief and plausibility are modeled using additional primitive relations, and we prove a representation theorem showing that each such general model is a p-morphic image of an intended one. This semantics invites a number of natural special cases, depending on how uniform we make the evidence sets, and how coherent their total structure. We give a structural study of the resulting ‘uniform’ and ‘flat’ models. Our main result are sound and complete axiomatizations for the logics of all four major model classes with respect to the modal language of evidence, belief and safe belief. We conclude with an outlook toward logics for the dynamics of changing evidence, and the resulting language extensions and connections with logics of plausibility change. (shrink)

We construct a Hilbert style system RPL for the notion of plausibility measure introduced by Halpern J, and we prove the soundness and completeness with respect to a neighborhood style semantics. Using the language of RPL, we demonstrate that it can define well-studied notions of necessity, conditionals and propositional identity.

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)

We take Carnap’s problem to be to what extent standard consequence relations in various formal languages fix the meaning of their logical vocabulary, alone or together with additional constraints on the form of the semantics. This paper studies Carnap’s problem for basic modal logic. Setting the stage, we show that neighborhood semantics is the most general form of compositional possible worlds semantics, and proceed to ask which standard modal logics (if any) constrain the box operator to (...) be interpreted as in relational Kripke semantics. Except when restricted to finite domains, no modal logic characterizes all the Kripkean interpretation of P. Moreover, we show that, in contrast with the case of first-order logic, the obvious requirement of permutation invariance is not adequate in the modal case. After pointing out some known facts about modal logics that nevertheless force the Kripkean interpretation, we focus on another feature often taken to embody the gist of modal logic: locality. We show that invariance under point-generated subframes (properly defined) does single out the Kripkean interpretations, but only among topological interpretations, not in general. Finally, we define a notion of bisimulation invariance — another aspect of locality — that, together with a reasonable closure condition, gives the desired general result. Along the way, we propose a new perspective on normal neighborhood frames as filter frames, consisting of a set of worlds equipped with an accessibility relation, and a free filter at every world. (shrink)

We construct a Hilbert style system RPL for the notion of plausibility measure introduced by Halpern J, and we prove the soundness and completeness with respect to a neighborhood style semantics. Using the language of RPL, we demonstrate that it can define well-studied notions of necessity, conditionals and propositional identity.

In this paper we present a neighborhood semantics for Intuitionistic Propositional Logic (IPL). We show that for each Kripke model of the logic there is a pointwise equivalent neighborhood model and vice versa. In this way, we establish soundness and completeness of IPL with respect to the neighborhood semantics. The relation between neighborhood and topological semantics are also investigated. Moreover, the notions of bisimulation and n-bisimulation between neighborhood models of IPL are defined (...) naturally and some of their basic properties are proved. We also consider Basic Propositional Logic (BPL), a logic weaker than IPL introduced by Albert Visser, and introduce and study its neighborhood models in the same manner. (shrink)

Classical modal logics, based on the neighborhood semantics of Scott and Montague, provide a generalization of the familiar normal systems based on Kripke semantics. This paper defines AGM revision operators on several first-order monotonic modal correspondents, where each first-order correspondence language is defined by Marc Pauly’s version of the van Benthem characterization theorem for monotone modal logic. A revision problem expressed in a monotone modal system is translated into first-order logic, the revision is performed, and the new (...) belief set is translated back to the original modal system. An example is provided for the logic of Risky Knowledge that uses modal AGM contraction to construct counter-factual evidence sets in order to investigate robustness of a probability assignment given some evidence set. A proof of correctness is given. (shrink)

In this paper, we give an alternative semantics to the non-normal logic of knowing how proposed by Fervari et al., based on a class of Kripke neighborhood models with both the epistemic relations and neighborhood structures. This alternative semantics is inspired by the same quantifier alternation pattern of ∃∀\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\exists \forall$$\end{document} in the semantics of the know-how modality and the neighborhood semantics for the standard (...) modality. We show that this new semantics is equivalent to the original Kripke semantics in terms of the validities. A key result is a representation theorem showing that the more abstract Kripke neighborhood models can be represented by the concrete Kripke models with action transitions modulo the valid formulas. We prove the completeness of the logic for the neighborhood semantics. The neighborhood semantics can be adapted to other variants of logics of knowing how. It provides us a powerful technical tool to study these logics while preserving the basic semantic intuition. (shrink)

This article outlines a semantic approach to the logics of unknown truths, and the logic of false beliefs, using neighborhood structures, giving results on soundness, completeness, and expressivity. Relational semantics for the logics of unknown truths are also addressed, specically the conditions under which sound axiomatizations of these logics might be obtained from their normal counterparts, and the relationship between refexive insensitive logics and logics containing the provability operator as the primary modal operator.

As we’ve seen in the last chapter, there is good linguistic reason to categorize negations (and negative operators in general) by which De Morgan laws they support. The weakest negative operators (merely downward monotonic) support only two De Morgan laws;1 medium-strength negative operators support a third;2 and strong negative operators support all four. As we’ve also seen, techniques familiar from modal logic are of great use in giving unifying theories of negative operators. In particular, Dunn’s (1990) distributoid theory allows us (...) to generate relational semantics for many negations. However, the requirements of distributoid theory are a bit too strict for use in modeling the weakest negations. For a relational semantics to work, an operator must either distribute or antidistribute over either conjunction or disjunction; but the merely downward monotonic operators do not. Thus, a unifying semantics cannot be had in distributoid theory. In the (more familiar) study of positive modalities, there is a parallel result. Normal necessities distribute over conjunction, and normal possibilities over disjunction. When these distributions break down, a relational semantics is no longer appropriate. Here, there is a somewhat familiar solution: neighborhood semantics. In this chapter, I’ll adapt neighborhood semantics to the less familiar case of negative modalities, showing how it can be used to give a single semantic framework appropriate to all the pertinent sorts of negative operators. (shrink)

In this note, I present a modified semantic framework for the multi-valued paraconsistent logic LP, which allows for a straightforward preservation of a significant classical intuition about negation, namely that the negation operator reverses truth-value.

The paper presents a semantics for quantified modal logic which has a weaker axiomatization than the usual Kripke semantics. In particular, the Barcan Formula and its converse are not valid with the proposed semantics. Subclasses of models which validate BF and other interesting formulas are presented. A completeness theorem is proved, and the relation between this result and completeness with respect to Kripke models is investigated.

Towards NonBeing (Priest, 2005) gives a noneist account of the semantics of intentional operators and predicates. The semantics for intentional operators are modelled on those for the , is given and assessed.

In this paper, we generalize the ordered-pair semantics advanced by Matthew Clemens for the Logic of Paradox to n-tuple semantics, for each fixed n. Moreover, we show that the resulting semantics can accommodate not only LP, but also classical logic as well as strong Kleene logic depending on the set of designated values that one chooses. Building on the technical observations, we offer intuitively plausible readings for the semantics, and we also discuss some weaknesses of (...) the original intuitive reading advanced by Clemens. (shrink)

In the article we study the existence predicate $\varepsilon$ in the context of semantics for first-order modal logic. For a formula $\varphi$ we define $\varphi^{\varepsilon}$ - the so called existence relativization. We point to a gap in the work of Fitting and Mendelsohn concerning the relationship between the truth of $\varphi$ and $\varphi^{\varepsilon}$ in classes of varying- and constant-domain models. We introduce operations on models which allow us to fill the gap and provide a more general perspective on the (...) issue. As a result we obtain a series of theorems describing the logical connection between the notion of truth of a formula with the existence predicate in constant-domain models and the notion of truth of a formula without the existence predicate in varying-domain models. (shrink)

We propose a new perspective on logics of computation by combining instantial neighborhood logic \ with bisimulation safe operations adapted from \. \ is a recent modal logic, based on an extended neighborhood semantics which permits quantification over individual neighborhoods plus their contents. This system has a natural interpretation as a logic of computation in open systems. Motivated by this interpretation, we show that a number of familiar program constructors can be adapted to instantial neighborhood (...) class='Hi'>semantics to preserve invariance for instantial neighborhood bisimulations, the appropriate bisimulation concept for \. We also prove that our extended logic \ is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for \, and establish its finite model property and decidability. (shrink)

In a mathematical perspective, neighborhood models for modal logic are generalized quantifiers, parametrized to points in the domain of objects/worlds. We explore this analogy further, connecting generalized quantifier theory and modal neighborhood logic. In particular, we find interesting analogies between conservativity for linguistic quantifiers and the locality of modal logic, and between the role of invariances in both fields. Moreover, we present some new completeness results for modal neighborhood logics of linguistically motivated classes of generalized quantifiers, and (...) raise new types of open problem. With the bridges established here, many further analogies might be explored between the two fields to mutual benefit. (shrink)

We propose a new perspective on logics of computation by combining instantial neighborhood logic INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} with bisimulation safe operations adapted from PDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PDL}$$\end{document}. INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} is a recent modal logic, based on an extended neighborhood semantics which permits quantification over individual neighborhoods plus their contents. This system has a natural (...) interpretation as a logic of computation in open systems. Motivated by this interpretation, we show that a number of familiar program constructors can be adapted to instantial neighborhood semantics to preserve invariance for instantial neighborhood bisimulations, the appropriate bisimulation concept for INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document}. We also prove that our extended logic IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document} is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document}, and establish its finite model property and decidability. (shrink)

In this article, we study logics of unknown truths and false beliefs under neighborhood semantics. We compare the relative expressivity of the two logics. It turns out that they are incomparable over various classes of neighborhood models, and the combination of the two logics are equally expressive as standard modal logic over any class of neighborhood models. We propose morphisms for each logic, which can help us explore the frame definability problem, show a general soundness and (...) completeness result, and generalize some results in the literature. We axiomatize the two logics over various classes of neighborhood frames. Most importantly, by adopting the intersection semantics and the subset semantics in the literature, we extend the results to the case of public announcements, which gives us the desired reduction axioms and has good applications related to Moore sentences, successful formulas and self-refuting formulas. Also, we can say something about the comparative merits of the intersection semantics and the subset semantics. (shrink)

In the literature, different frameworks of probabilistic epistemic logic have been proposed. Most of these frameworks define knowledge or belief by relational structure. In this paper, we explore the relationship between probability and belief, based on the Lockean thesis, and adopt neighborhood semantics that defines belief directly using probability. We provide a sound and weakly complete axiomatization for our framework. We also try to explain the lottery paradox by modelling it within our framework. Moreover, the paper presents findings (...) concerning the relationship between knowledge, belief and probability within various frameworks. (shrink)

There are times when a curiously odd relic of language presents us with a thread, which when pulled, reveals deep and general facts about human language. This paper unspools such a case. Prior to 1930, English speakers uniformly preferred male-before-female word order in conjoined nouns such asuncles and aunts; nephews and nieces; men and women. Since then, at least a half dozen items have systematically reversed their preferred order (e.g.,aunts and uncles, nieces and nephews) while others have not (men and (...) women). We review evidence that the unusual reversals began withmother and dad(dy)and spread to semantically and morphologically related binomials over a period of decades. The present work proposes that three aspects ofcognitive accessibilitycombine to quantify the probability of A&B order: (1) the relative accessibility of the A&B terms individually, (2) competition from B&A order, and critically, (3) cluster strength (i.e., similarity to related A'&B' cases). The emergent cluster of female-first binomials highlights the influence of semantic neighborhoods in memory retrieval. We suggest that cognitive accessibility can be used to predict the word order of both familiar and novel binomials generally, as well as the diachronic change focused on here. (shrink)

This work focuses on a multiagent system with time-varying interval uncertainty in the system matrix, where multiple agents interact through an undirected topology graph and only the bounding matrices on the uncertainty in the system matrix are known. A reduced-order interval observer, which is named the reduced-order neighborhood interval observer, is designed to estimate the relative state of each agent and those of its neighbors. It is shown that the reduced-order IO can guarantee the consensus of the uncertain multiagent (...) system. Finally, simulation examples are proposed to verify the theoretical findings. (shrink)

We consider subintuitionistic logics as an extension of positive propositional logic with a binary modality, interpreted over ordered and unordered monotone neighborhood frames, with a range of frame conditions. This change in perspective allows us to apply tools and techniques from the modal setting to subintuitionistic logics. We provide a Priestley-style duality, and transfer results from the (classical) logic of monotone neighborhood frames to obtain completeness, conservativity, and a finite model property for the basic logic, extended with (...) a number of axioms. (shrink)

On the traditional deontic framework, what is required (what morality demands) and what is optimal (what morality recommends) can't be distinguished and hence they can't both be represented. Although the morally optional can be represented, the supererogatory (exceeding morality's demands), one of its proper subclasses, cannot be. The morally indifferent, another proper subclass of the optional-one obviously disjoint from the supererogatory-is also not representable. Ditto for the permissibly suboptimal and the morally significant. Finally, the minimum that morality allows finds no (...) place in the traditional scheme. With a focus on the question, What would constitute a hospitable logical neighborhood for the concept of supererogation?, I present and motivate an enriched logical and semantic framework for representing all these concepts of common sense morality. (shrink)

We develop a set-theoretic semantics for Cocchiarella's second-order logical system . Such a semantics is a modification of the nonstandard sort of second-order semantics described, firstly, by Simms and later extended by Cocchiarella. We formulate a new second order logical system and prove its relative consistency. We call such a system and construct its set-theoretic semantics. Finally, we prove completeness theorems for proper normal extensions of the two systems with respect to certain notions of validity provided (...) by the semantics. (shrink)

Quine’s most important charge against second-, and more generally, higher-order logic is that it carries massive existential commitments. The force of this charge does not depend upon Quine’s questionable assimilation of second-order logic to set theory. Even if we take second-order variables to range over properties, rather than sets, the charge remains in force, as long as properties are individuated purely extensionally. I argue that if we interpret them as ranging over properties more reasonably construed, in accordance with an abundant (...) or deflationary conception, Quine’s charge can be resisted. This interpretation need not be seen as precluding the use of model-theoretic semantics for second-order languages; but it will preclude the use of the standard semantics, along with the more general Henkin semantics, of which it is a special case. To that extent, the approach I recommend has revisionary implications which some may find unpalatable; it is, however, compatible with the quite different special case in which the second-order variables are taken to range over definable subsets of the first-order domain, and with respect to such a semantics, some important metalogical results obtainable under the standard semantics may still be obtained. In my final section, I discuss the relations between second-order logic, interpreted as I recommend, and a strong version of schematic ancestral logic promoted in recent work by Richard Heck. I argue that while there is an interpretation on which Heck’s logic can be contrasted with second-order logic as standardly interpreted, when it is so interpreted, its differences from the more modest form of second-order logic I advocate are much less substantial, and may be largely presentational. (shrink)

Introduction -/- 1 Précis -/- 2 Methodology: Introducing digital humanities to the history of philosophy 2.1 Introduction 2.2 Core constructs 2.3 Operationalizing the constructs 2.4 Querying the Nietzsche Source 2.5 Cleaning the data 2.6 Visualizations and preliminary analysis 2.6.1 Visualization of the whole corpus 2.6.2 Book visualizations 2.7 Summary -/- Nietzsche’s Socio-Moral Framework -/- 3 From instincts and drives to types 3.1 Introduction 3.2 The state of the art on drives, instincts, and types 3.2.1 Drives 3.2.2 Instincts 3.2.3 Types 3.3 (...) The semantic neighborhood of drive, instinct, and type 3.4 A theory of (the relations among) instincts, drives, and types 3.4.1 Drives are act-directed rather than outcome-directed dispositions 3.4.2 The reflexive turn in Nietzsche’s drive psychology 3.4.3 Triggers of drive-displacement 3.4.4 Instincts are innate drives 3.4.5 Types are constellations of instincts and other drives 3.4.6 To what extent are types, instincts, and drives fixed? 3.5 Summary -/- 4 From types to virtues 4.1 Introduction 4.2 The state of the art on virtues and values 4.2.1 Virtues 4.2.2 Values 4.3 The semantic neighborhood of virtue and value 4.4 On (the relations among) instincts, drives, types, values, virtues, and values 4.4.1 Virtues are well-calibrated drives 4.4.2 Nietzsche’s type-relative unity of virtue thesis 4.4.3 The type of the criminal 4.4.4 Nietzschean exemplarism and his ad hominem attacks 4.5 Summary -/- 5 Socializing Nietzschean virtues 5.1 Introduction 5.2 Higher-order types 5.2.1 Social character construction 5.2.2 Reflexive character construction 5.3 Eponymous trait terms and Nietzschean summoning 5.3.1 Eponymous trait terms 5.3.2 Nietzschean summoning 5.4 Summary -/- Nietzschean virtues -/- 6 Curiosity 6.1 Introduction 6.2 Curiosity in virtue epistemology 6.3 Curiosity and its affiliated emotions 6.4 Curiosity, perspectivism, and inquiry 6.5 Curiosity as a virtue 6.5.1 A preliminary characterization 6.5.2 Curiosity in the middle through late works 6.6 Summary -/- 7 Courage 7.1 Introduction 7.2 Intellectual courage in contemporary virtue epistemology 7.3 Courage as a virtue 7.3.1 A preliminary characterization 7.3.2 Courage in the middle through late works 7.4 Summary -/- 8 Pathos of distance 8.1 Introduction 8.2 Contempt and disgust in contemporary moral psychology 8.3 The semantic neighborhood of contempt, disgust, and the pathos of distance 8.4 Nietzsche on contempt 8.4.1 Spernere mundum 8.4.2 Spernere neminem 8.4.3 Spernere se ipsum 8.4.4 Spernere se sperni 8.4.5 Nietzsche aims to induce what he considers fitting contempt in receptive readers 8.5 Nietzsche on disgust 8.5.1 The use of disgust: detaching from an ideal 8.5.2 The danger of disgust 8.6 The pathos of distance 8.7 Prospects for a Nietzschean democratic ethos 8.8 Summary -/- 9 Sense of humor 9.1 Introduction 9.2 The semantic neighborhood of laughter, humor, and comedy 9.3 The Nietzschean sense of humor and its functions 9.3.1 From episodic laughter to the sense of humor 9.3.2 Affirmation and inquiry 9.3.3 Negation and inquiry 9.3.4 Affiliation with like-minded inquirers 9.4 Summary -/- 10 Solitude 10.1 Introduction 10.2 Solitude in virtue theory and Nietzsche scholarship 10.3 The semantic neighborhood of solitude 10.4 An account of Nietzschean solitude 10.5 Summary -/- Conclusion -/- 11 Conscience & integrity 11.1 Introduction 11.2 Conscience and integrity in contemporary moral psychology and Nietzsche scholarship 11.2.1 Conscience and integrity in contemporary moral psychology 11.2.2 Conscience and integrity in Nietzsche commentary 11.3 The semantic neighborhood of conscience and integrity 11.4 Distinguishing conscience, good conscience, bad conscience, and intellectual conscience 11.4.1 Conscience 11.4.2 Good conscience 11.4.3 Bad conscience 11.4.4 Intellectual conscience and integrity 11.5 Summary -/- 12 Prospectus 12.1 Future directions in moral psychology 12.2 Future directions in Nietzsche scholarship 12.3 Future directions in digital humanities and the history of philosophy . (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

Paraconsistent extensions of 3-valued Gödel logic are studied as tools for knowledge representation and nonmonotonic reasoning. Particularly, Osorio and his collaborators showed that some of these logics can be used to express interesting nonmonotonic semantics. CG’3 is one of these 3-valued logics. In this paper, we introduce Fidel semantics for a certain calculus of CG’3 by means of Fidel structures, named CG’3-structures. These structures are constructed from enriched Boolean algebras with a special family of sets. Moreover, we also (...) show that the most basic CG’3-structures coincide with da Costa–Alves’ bi-valuation semantics; this connection is displayed through a Representation Theorem for CG’3-structures. By contrast, we show that for other paraconsistent logics that allow us to present semantics through Fidel structures, this connection is not held. Finally, Fidel semantics for the first-order version of the logic of CG’3 are presented by means of adapting algebraic tools. (shrink)

Moeser suggested participants default to linear ordering elements but they can be primed to impose either linear or partial ordering. This study seems problematic insofar as ‘greater than’ might be understood to incline participants to favor linear orderings. Recent follow-up studies strongly suggest participants do not default to linear ordering. It seems plausible, moreover, that the observed priming effect is far more pervasive than Moeser countenanced. The present work explores the extent to which priming for linear or partial orders conflicts (...) with the construction of linear or partial ordering lists. Our two experiments suggest friction between priming and task, and also show once the priming tasks are cleared of potentially confounding semantic content, participants perform equally with respect to constructing linear or partial orders under similar priming conditions. (shrink)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a (...) third-order accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

This paper introduces the logic _Q__L__E__T_ _F_, a quantified extension of the logic of evidence and truth _L__E__T_ _F_, together with a corresponding sound and complete first-order non-deterministic valuation semantics. _L__E__T_ _F_ is a paraconsistent and paracomplete sentential logic that extends the logic of first-degree entailment (_FDE_) with a classicality operator ∘ and a non-classicality operator ∙, dual to each other: while ∘_A_ entails that _A_ behaves classically, ∙_A_ follows from _A_’s violating some classically valid inferences. The semantics (...) of _Q__L__E__T_ _F_ combines structures that interpret negated predicates in terms of anti-extensions with first-order non-deterministic valuations, and completeness is obtained through a generalization of Henkin’s method. By providing sound and complete semantics for first-order extensions of _FDE_, _K3_, and _LP_, we show how these tools, which we call here the method of _anti-extensions + valuations_, can be naturally applied to a number of non-classical logics. (shrink)

Recently, some philosophers have argued that we should take quantification of any (finite) order to be a legitimate and irreducible, sui generis kind of quantification. In particular, they hold that a semantic theory for higher-order quantification must itself be couched in higher-order terms. Øystein Linnebo has criticized such views on the grounds that they are committed to general claims about the semantic values of expressions that are by their own lights inexpressible. I show that Linnebo’s objection rests on the assumption (...) of a notion of semantic value or contribution which both applies to expressions of any order, and picks out, for each expression, an extra-linguistic correlate of that expression. I go on to argue that higher-orderists can plausibly reject this assumption, by means of a hierarchy of notions they can use to describe the extra-lingustic correlates of expressions of different orders. (shrink)

Several philosophers of science construe models of scientific theories as set-theoretic structures. Some of them moreover claim that models should not be construed as structures in the sense of model theory because the latter are language-dependent. I argue that if we are ready to construe models as set-theoretic structures (strict semantic view), we could equally well construe them as model-theoretic structures of higher-order logic (liberal semantic view). I show that every family of set-theoretic structures has an associated language of higher-order (...) logic and an up to signature isomorphism unique model-theoretic counterpart, which is able to serve the same purposes. This allows to carry over every syntactic criterion of equivalence for theories in the sense of the liberal semantic view to theories in the sense of the strict semantic view. Taken together, these results suggest that the recent dispute about the semantic view and its relation to the syntactic view can be resolved. (shrink)

This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics, introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with n (...) -ary additive or multiplicative operators, with negation operators modally interpreted as impossibility and unnecessity, as well as with implication connectives. Order-dual relational semantics shares with the generalized Kripke frames, or the bi-approximation semantics approach, the use of both a satisfaction and a co-satisfaction relation, but it also responds to the recently voiced concerns of Craig, Haviar and Conradie about the relative non-intuitiveness of the 2-sorted semantics of the aforementioned approaches. In this article, we provide a standard interpretation of modalities and natural interpretations of both negation and implication, despite the absence of distribution. Thereby, our results contribute in creating the necessary background for research in non-distributive logics with modalities variously interpreted as dynamic, temporal etc, by analogy to the classical case. (shrink)

The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A ∧ B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The unified (...) semantical characterization in terms of neighborhoods permits comparisons between different forms of non-adjunctive inference. For example, we show that the non-adjunctive logic proposed in (Schotch and Jennings, 1980) is not adequate in general for representing the logic of high probability operators. An alternative interpretation of the forcing relation of Schotch and Jennings is derived from the proposed unified semantics and utilized in order to propose a more fine-grained measure of epistemic coherence than the one presented in (Schotch and Jennings, 1980). Finally we propose a syntactic translation of the purely implicative part of Jaśkowski's system D₂ into a classical system preserving all the theorems (and non-theorems) explicilty mentioned in (Jaśkowski, 1969). The translation method can be used in order to develop epistemic semantics for a larger class of non-adjunctive (discursive) logics than the ones historically investigated by Jaśkowski. (shrink)

Here's the thing: when you look at it from just the right angle, it's entirely obvious how semantics for second-order relevant logics ought to go. Or at least, if you've understood how semantics for first-order relevant logics ought to go, there are perspectives like this. What's more is that from any such angle, the metatheory that needs doing can be summed up in one line: everything is just as in the first-order case, but with more indices. Of course, (...) it's no small matter finding the magical angle from which everything becomes obvious. And even having found this perspective, one cannot assume one's audience will find things as obvious as oneself. All that to say this: if the results in the paper below strike you as obvious, pay attention to the perspective that makes that possible. And if they don't, feel free to ignore this preamble in its entirety. (shrink)

In their target article, Wang and Busemeyer (2013) discuss question order effects in terms of incompatible projectors on a Hilbert space. In a similar vein, Blutner recently presented an orthoalgebraic query language essentially relying on dynamic update semantics. Here, I shall comment on some interesting analogies between the different variants of dynamic semantics and generalized quantum theory to illustrate other kinds of order effects in human cognition, such as belief revision, the resolution of anaphors, and default reasoning that (...) result from the crucial non-commutativity of mental operations upon the belief state of a cognitive agent. (shrink)

Intellectual humility is an interesting but underexplored disposition. The claim “I am (intellectually) humble” seems paradoxical in that someone who has the disposition in question would not typically volunteer it. There is an explanatory gap between the meaning of the sentence and the meaning the speaker expresses by uttering it. We therefore suggest analyzing intellectual humility semantically, using a psycholexical approach that focuses on both synonyms and antonyms of ‘intellectual humility’. We present a thesaurus-based method to map the semantic space (...) of intellectual humility as a heuristic to support philosophical and psychological analysis of this disposition. We find three semantic clusters that compose intellectual humility: the sensible self, the discreet self, and the inquisitive self; likewise, we find three clusters that compose its contraries: the overrated self, the underrated other, and the underrated self. (shrink)