Scott Soames has argued that Rigidified Descriptivism wrongly predicts that one cannot believe, say, that Joe Strummer was born in 1952 without having a belief about the actual world. Soames suggests that agents in other possible worlds may have this belief, but may lack any beliefs about the actual world, a world that they do not occupy and have no contact with. I respond that this argument extends to other popular actuality-involving analyses. In order for Soames to hold on to (...) his argument against Rigidified Descriptivism, he must provide alternatives to these analyses. I argue that there is reason to think that these alternatives are not forthcoming, so Soames should surrender his argument against Rigidified Descriptivism. (shrink)

We consider the problem of axiomatizing various natural "successor" logics for 2-dimensional integral spacetime. We provide axiomatizations in monomodal and multimodal languages, and prove completeness theorems. We also establish that the irreflexive successor logic in the "standard" modal language (i.e. the language containing □ and ◊) is not finitely axiomatizable.

This research article revisits Hempel’s logic of confirmation in light of recent developments in categorical proof theory. While Hempel advocated several logical conditions in favor of a purely syntactical definition of a general non-quantitative concept of confirmation, we show how these criteria can be associated to specific logical properties of monoidal modal deductive systems. In addition, we show that many problems in confirmation logic, such as the tacked disjunction, the problem of weakening with background knowledge and the problem of irrelevant (...) conjunction, are also associated with specific logical properties and, incidentally, with some of Hempel’s logical conditions of adequacy. We discuss the raven paradox together with further objections against Hempel’s approach, showing how our analysis enables a clear understanding of the relationships between Hempel’s conditions, the problems in confirmation logic, and the properties of deductive systems. (shrink)

This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals (...) are drawn concerning the possibility of having two logical systems that are "empirically distinct" but are both translationally equivalent to a common logic. (shrink)

Traditional procedures for rational updating fail when it comes to self-locating opinions, such as your credences about where you are and what time it is. This paper develops an updating procedure for rational agents with self-locating beliefs. In short, I argue that rational updating can be factored into two steps. The first step uses information you recall from your previous self to form a hypothetical credence distribution, and the second step changes this hypothetical distribution to reflect information you have genuinely (...) learned as time has passed. While the second step resembles traditional procedures of updating by conditionalization, the first is best understood by analogy to traditional models of how agents transmit self-locating opinions through ordinary interpersonal communication. (shrink)

In their presentation of canonical models for normal systems of modal logic, Hughes and Cresswell observe that some of these models are based on a frame which can be also thought of as a collection of two or more isolated frames; they call such frames ‘non-cohesive’. The problem of checking whether the canonical model of a given system is cohesive is still rather unexplored and no general decision procedure is available. The main contribution of this article consists in introducing a (...) method which is sufficient to show that canonical models of some relevant classes of normal monomodal and bimodal systems are always non-cohesive. (shrink)

This article concerns the metatheory of a class of modal logics whose language includes propositional constants of various kinds. The main novelties are the use of general frames with specific restrictions and the definition of the strict range of a formula. Many examples from the literature are treated within the framework provided and some traditional model-theoretic issues such as preservation results concerning the validity of formulas and definability results concerning frame properties are addressed.

Historically, it was the interpretations of intuitionist logic in the modal logic S4 that inspired the standard Kripke semantics for intuitionist logic. The inspiration of this paper is the interpretation of intuitionist logic in the non-normal modal logic S3: an S3 model structure can be 'looked at' as an intuitionist model structure and the semantics for S3 can be 'cashed in' to obtain a non-normal semantics for intuitionist propositional logic. This non-normal semantics is then extended to intuitionist quantificational logic.

The essay introduces a non-Diodorean, non-Kantian temporal modal semantics based on part-whole, rather than class, theory. Formalizing Edmund Husserl’s theory of inner time consciousness, §3 uses his protention and retention concepts to define a relation of self-awareness on intentional events. §4 introduces a syntax and two-valued semantics for modal first-order predicate object-languages, defines semantic assignments for variables and predicates, and truth for formulae in terms of the axiomatic version of Edmund Husserl’s dependence ontology (viz. the Calculus [CU] of Urelements) introduced (...) by The Ontology of Intentionality I & II. It then uses the §3 results to define the modalities of truth, and §5 extends the semantics to identity claims. §6 defines and contrasts synthetic a priori truths to analytic a priori truths, and §7 compares Brentano School noetic semantic and Leibnizian possible-world semantic perspectives on modality. The essay argues that the modal logics it defines semantically are two-valued, first-order versions of the type of language which Husserl viewed as the language of any ontology of experience (i.e. of any science), and conceived as the logic of intentionality. (shrink)

This essay introduces a puzzle about the interaction between quantifiers and epistemic modals. The puzzle motivates the idea that whether an object satisfies an epistemically modalized predicate depends on the mode of presentation of the domain of quantification. I compare two ways of implementing this idea, one using counterpart theory, the other using Aloni's 'conceptual covers' theory, and then provides some evidence in favor of the former.

In the context of modal logics one standardly considers two modal operators: possibility ) and necessity ) [see for example Chellas ]. If the classical negation is present these operators can be treated as inter-definable. However, negative modalities ) and ) are also considered in the literature [see for example Béziau ; Došen :3–14, 1984); Gödel, in: Feferman, Collected works, vol 1, Publications 1929–1936, Oxford University Press, New York, 1986, p. 300; Lewis and Langford ]. Both of them can be (...) treated as negations. In Béziau a logic \ has been defined on the basis of the modal logic \. \ is proposed as a solution of so-called Jaśkowski’s problem [see also Jaśkowski ]. The only negation considered in the language of \ is ‘it is not necessary’. It appears that logic \ and \ inter-definable. This initial correspondence result between \ and \ has been generalised for the case of normal logics, in particular soundness-completeness results were obtained [see Marcos :279–300, 2005); Mruczek-Nasieniewska and Nasieniewski :229–248, 2005)]. In Mruczek-Nasieniewska and Nasieniewski it has been proved that there is a correspondence between \-like logics and regular extensions of the smallest deontic logic. To obtain this result both negative modalities were used. This result has been strengthened in Mruczek-Nasieniewska and Nasieniewski :261–280, 2017) since on the basis of classical positive logic it is enough to solely use \ to equivalently express both positive modalities and negation. Here we strengthen results given in Mruczek-Nasieniewska and Nasieniewski by showing correspondence for the smallest regular logic. In particular we give a syntactic formulation of a logic that corresponds to the smallest regular logic. As a result we characterise all logics that arise from regular logics. From this follows via respective translations a characterisation of a class of logics corresponding to some quasi-regular logics where \ is the smallest element. Moreover, if a given quasi-regular logic is characterised by some class of models, the same class can be used to semantically characterise the logic obtained by our translation. (shrink)

This paper argues that several leading theories of subjunctive conditionals are incompatible with ordinary intuitions about what credences we ought to have in subjunctive conditionals. In short, our theory of subjunctives should intuitively display semantic humility, i.e. our semantic theory should deliver the truth conditions of sentences without pronouncing on whether those conditions actually obtain. In addition to describing intuitions about subjunctive conditionals, I argue that we can derive these ordinary intuitions from justified premises, and I answer a possible worry (...) for my derivation by refuting a subjunctive triviality result modeled on (Lewis 1976). I conclude that the debate over the correct theory of subjunctive conditionals requires settling meta-philosophical questions about the relative value of various virtues of first-order theories of subjunctive conditionals. (shrink)

Recently, von Fintel (2001) and Gillies (2007) have argued that certain sequences of counterfactuals, namely reverse Sobel sequences, should motivate us to abandon standard truth conditional theories of counterfactuals for dynamic semantic theories. I argue that we can give a pragmatic account of our judgments about counterfactuals without giving up the standard semantics. In particular, I introduce a pragmatic principle governing assertability, and I use this principle to explain a variety of subtle data concerning reverse Sobel sequences.

This paper argues that just as full beliefs can constitute knowledge, so can properties of your credence distribution. The resulting notion of probabilistic knowledge helps us give a natural account of knowledge ascriptions embedding language of subjective uncertainty, and a simple diagnosis of probabilistic analogs of Gettier cases. Just like propositional knowledge, probabilistic knowledge is factive, safe, and sensitive. And it helps us build knowledge-based norms of action without accepting implausible semantic assumptions or endorsing the claim that knowledge is interest-relative.

We present a completeness proof for Propositional Interval Temporal Logic with finite time which avoids certain difficulties of conventional methods. It is more gradated than previous efforts since we progressively reduce reasoning within the original logic to simpler reasoning in sublogics. Furthermore, our approach benefits from being less constructive since it is able to invoke certain theorems about regular languages over finite words without the need to explicitly describe the associated intricate proofs. A modified version of regular expressions called Fusion (...) Expressions is used as part of an intermediate logic called Fusion Logic. Both have the same expressiveness as PITL but are lower-level notations which play an important role in the hierarchical structure of the overall completeness proof. In particular, showing completeness for PITL is reduced to showing completeness for Fusion Logic. This in turn is shown to hold relative to completeness for conventional linear-time temporal logic with finite time. Logics based on regular languages over finite words and!-words offer a promising but elusive framework for formal specification and verification. A number of such logics and decision procedures have been proposed. In addition, various researchers have obtained complete axiom systems by embedding and expressing the decision procedures directly within the logics. The work described here contributes to this topic by showing how to exploit some interesting links between regular languages and interval-based temporal logics. (shrink)

The logical hexagon (or hexagon of opposition) is a strange, yet beautiful, highly symmetrical mathematical figure, mysteriously intertwining fundamental logical and geometrical features. It was discovered more or less at the same time (i.e. around 1950), independently, by a few scholars. It is the successor of an equally strange (but mathematically less impressive) structure, the “logical square” (or “square of opposition”), of which it is a much more general and powerful “relative”. The discovery of the former did not raise interest, (...) neither among logicians, nor among philosophers of logic, whereas the latter played a very important theoretical role (both for logic and philosophy) for nearly two thousand years, before falling in disgrace in the first half of the twentieth century: it was, so to say, “sentenced to death” by the so-called analytical philosophers and logicians. Contrary to this, since 2004 a new, unexpected promising branch of mathematics (dealing with “oppositions”) has appeared, “oppositional geometry” (also called “n-opposition theory”, “NOT”), inside which the logical hexagon (as well as its predecessor, the logical square) is only one term of an infinite series of “logical bi-simplexes of dimension m”, itself just one term of the more general infinite series (of series) of the “logical poly-simplexes of dimension m”. In this paper we recall the main historical and the main theoretical elements of these neglected recent discoveries. After proposing some new results, among which the notion of “hybrid logical hexagon”, we show which strong reasons, inside oppositional geometry, make understand that the logical hexagon is in fact a very important and profound mathematical structure, destined to many future fruitful developments and probably bearer of a major epistemological paradigm change. (shrink)

Whereas geometrical oppositions (logical squares and hexagons) have been so far investigated in many fields of modal logic (both abstract and applied), the oppositional geometrical side of “deontic logic” (the logic of “obligatory”, “forbidden”, “permitted”, . . .) has rather been neglected. Besides the classical “deontic square” (the deontic counterpart of Aristotle’s “logical square”), some interesting attempts have nevertheless been made to deepen the geometrical investigation of the deontic oppositions: Kalinowski (La logique des normes, PUF, Paris, 1972) has proposed a (...) “deontic hexagon” as being the geometrical representation of standard deontic logic, whereas Joerden (jointly with Hruschka, in Archiv für Rechtsund Sozialphilosophie 73:1, 1987), McNamara (Mind 105:419, 1996) and Wessels (Die gute Samariterin. Zur Struktur der Supererogation, Walter de Gruyter, Berlin, 2002) have proposed some new “deontic polygons” for dealing with conservative extensions of standard deontic logic internalising the concept of “supererogation”. Since 2004 a new formal science of the geometrical oppositions inside logic has appeared, that is “ n -opposition theory”, or “NOT”, which relies on the notion of “logical bi-simplex of dimension m ” ( m = n − 1). This theory has received a complete mathematical foundation in 2008, and since then several extensions. In this paper, by using it, we show that in standard deontic logic there are in fact many more oppositional deontic figures than Kalinowski’s unique “hexagon of norms” (more ones, and more complex ones, geometrically speaking: “deontic squares”, “deontic hexagons”, “deontic cubes”, . . ., “deontic tetraicosahedra”, . . .): the real geometry of the oppositions between deontic modalities is composed by the aforementioned structures (squares, hexagons, cubes, . . ., tetraicosahedra and hyper-tetraicosahedra), whose complete mathematical closure happens in fact to be a “deontic 5-dimensional hyper-tetraicosahedron” (an oppositional very regular solid). (shrink)

We present a straightforward embedding of modal nonmonotonic logics into default logic.

This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.

In this paper, I present the modal adaptive logic $AJ^{r}$ (based on S5) as well as the discussive logic $D_{2}^{r}$ that is defined from it. $D_{2}^{r}$ is a (nonmonotonic) alternative for Jaśkowski's paraconsistent system D₂. Like D₂, $D_{2}^{r}$ validates all single-premise rules of Classical Logic. However, for formulas that behave consistently, $D_{2}^{r}$ moreover validates all multiple-premise rules of Classical Logic. Importantly, and unlike in the case of D₂, this does not require the introduction of discussive connectives. It is argued that (...) this has clear advantages with respect to one of the main application contexts of discussive logics, namely the interpretation of discussions. (shrink)

I set up a dilemma, concerning metaphysical modality de re, for the essentialist opponent of a ‘two senses’ view of necessity. I focus specifically on Frank Jackson's two-dimensional account in his From Metaphysics to Ethics (Oxford: Oxford University Press, 1998). I set out the background to Jackson's conception of conceptual analysis and his rejection of a two senses view. I proceed to outline two purportedly objective (as opposed to epistemic) differences between metaphysical and logical necessity. I conclude that since one (...) of these differences must hold and since each requires the adoption of a two senses view of necessity, essentialism is not consistent with the rejection of a two senses view. (shrink)

An account of validity that makes what is invalid conditional on how many individuals there are is what I call a conditional account of validity. Here I defend conditional accounts against a criticism derived from Etchemendy’s well-known criticism of the model-theoretic analysis of validity. The criticism is essentially that knowledge of the size of the universe is non-logical and so by making knowledge of the extension of validity depend on knowledge of how many individuals there are, conditional accounts fail to (...) reflect that the former knowledge is basic, i.e., independent of knowledge derived from other sciences. Appealing to Russell’s pre-Principia logic, I defend conditional accounts against this criticism by sketching a rationale for thinking that there are infinitely many logical objects. (shrink)

. I give a systematic presentation of a fairly large family of multiple-conclusion modal logics that are paraconsistent and/or paracomplete. After providing motivation for studying such systems, I present semantics and tableau-style proof theories for them. The proof theories are shown to be sound and complete with respect to the semantics. I then show how the “standard” systems of classical, single-conclusion modal logics fit into the framework constructed.

Logic is usually thought to concern itself only with features that sentences and arguments possess in virtue of their logical structures or forms. The logical form of a sentence or argument is determined by its syntactic or semantic structure and by the placement of certain expressions called “logical constants.”[1] Thus, for example, the sentences Every boy loves some girl. and Some boy loves every girl. are thought to differ in logical form, even though they share a common syntactic and semantic (...) structure, because they differ in the placement of the logical constants “every” and “some”. By contrast, the sentences Every girl loves some boy. and Every boy loves some girl. are thought to have the same logical form, because “girl” and “boy” are not logical constants. Thus, in order to settle questions about logical form, and ultimately about which arguments are logically valid and which sentences logically true, we must distinguish the “logical constants” of a language from its nonlogical expressions. (shrink)

I offer you some theories of intellectual obligations and rights (virtue Ethics): initially, RBT (a Right to Believe Truth, if something is true it follows one has a right to believe it), and, NDSM (one has no right to believe a contradiction, i.e., No right to commit Doxastic Self-Mutilation). Evidence for both below. Anthropology, Psychology, computer software, Sociology, and the neurosciences prove things about human beliefs, and History, Economics, and comparative law can provide evidence of value about theories of rights. (...) However, insofar as we have methods within Philosophy to help us formulate precise concepts of 'belief' and 'rights', methods that also help us to prove links (or absence thereof) amongst families of concepts of rights and belief, our discipline is in and of itself capable of sound reasoning about issues as puzzling as the following. Suppose a Jane who does not believe in God yet who believes she ought to so believe: Jane is undergoing doxastic moral regret (moral regret for lack of faith). We have all known such Janes and perhaps at one time or another even been one. Paradox: given RBT and NDSM, Jane as described not only does not exist, Jane cannot exist. Thus, to enrich the ways in which Philosophy need not get all its evidence from other academic disciplines, I present a brief introduction to what I call Neutral Universal Frames (NUFs). NUFs solve hard puzzles about interactions among modal concepts of belief and rights, concepts that occur in RBT, NDSM and the description of our Janes. NUFs for theories precisely articulated via any two or more modal concepts are a powerful and immensely general set of tools enabling us to define rich theories of truth ("models on frames") to test philosophical theories for internal consistency and to prove the existence of connections (or absence thereof) amongst alternative articulations of philosophical theories. NUFs thereby add to the constructive knowledge producing way Logics intersect with Philosophy of Religion. And we will soon see why Jane, be she named 'Jane' or known simply as you: cannot exist. Read on at your own risk. (shrink)

We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.

There are logics where necessity is defined by means of a given identity connective: \ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity \ can be defined by strict equivalence \}\). All these approaches to modality involve a principle that we call the Collapse Axiom : “There is only one necessary proposition.” In this paper, we consider a notion of PI which relies on the identity axioms of Suszko’s non-Fregean logic SCI. (...) Then S3 proves to be the smallest Lewis modal system where PI can be defined as SE. We extend S3 to a non-Fregean logic with propositional quantifiers such that necessity and PI are integrated as non-interdefinable concepts. CA is not valid and PI refines SE. Models are expansions of SCI-models. We show that SCI-models are Boolean prealgebras, and vice-versa. This associates non-Fregean logic with research on Hyperintensional Semantics. PI equals SE iff models are Boolean algebras and CA holds. A representation result establishes a connection to Fine’s approach to propositional quantifiers and shows that our theories are conservative extensions of S3–S5, respectively. If we exclude the Barcan formula and a related axiom, then the resulting systems are still complete w.r.t. a simpler denotational semantics. (shrink)

The aim of this paper is to present the method of Socratic proofs for seven modal propositional logics: K5, S4.2, S4.3, S4M, S4F, S4R and G. This work is an extension of [10] where the method was presented for the most common modal propositional logics: K, D, T, KB, K4, S4 and S5.

In his essay Tracy Lupher (henceforth, TL) is concerned with Robert Kane's (1984) version of the modal ontological argument (MOA). As he correctly points out, Kane's argument is valid only if the accessibility relation between possible worlds is assumed to be symmetric. TL's remarks pave the way to thinking that the MOA is intended to establish the existence of a perfect being as a matter of logical necessity. Moreover, given TL's undisputed supposition (even shared by Kane) that S5 - in (...) which the accessibility relation is symmetric - captures the notion of logical necessity, the real issue becomes whether the premise of the MOA is true. Contrary to TL's main claim, the discussion thus shifts back from technical arguments for why the appropriate modal logic must have a symmetric accessibility relation to metaphysical, theological, or conceptual considerations about the notion of a perfect being itself. I argue that it is only due to such considerations that we even start to ponder the question of what modal logic is the appropriate one to choose. (shrink)

We introduce and investigate the notion of uniform Lyndon interpolation property which is a strengthening of both uniform interpolation property and Lyndon interpolation property. We prove several propositional modal logics including \, \, \ and \ enjoy ULIP. Our proofs are modifications of Visser’s proofs of uniform interpolation property using layered bisimulations Gödel’96, logical foundations of mathematics, computer science and physics—Kurt Gödel’s legacy, Springer, Berlin, 1996). Also we give a new upper bound on the complexity of uniform interpolants for \ (...) and \. (shrink)

In this paper, we investigate Rosser provability predicates whose provability logics are normal modal logics. First, we prove that there exists a Rosser provability predicate whose provability logic is exactly the normal modal logic \. Secondly, we introduce a new normal modal logic \ which is a proper extension of \, and prove that there exists a Rosser provability predicate whose provability logic includes \.

It is demonstrated that Hamblin's 15 tense theorem does not only hold for temporal logic with linear time but also for branching time. Furthermore three other theorems with finitely many tenses are shown.

This paper draws attention to a proof of the necessity of identity given by Arthur Prior. In its simplicity, it is comparable to a proof of Quine's, popularised by Kripke, but it is slightly different. Prior's Polish notation is transcribed into a more familiar idiom. Prior's proof is followed by a proof of the necessity of difference, possibly the first such proof in the literature, which is also repeated here and transcribed. The paper concludes with a brief discussion of Prior's (...) views on identity and difference over time. (shrink)

In opposition to a common assumption, this paper defends the idea that the auxiliary verb will has no other semantic contribution in contemporary English than a temporal shift towards the future with respect to the utterance time. Strong reasons for rejecting the idea that will quantifies over possible worlds are presented. Given the adoption of Lewis’s and Kratzer’s views on modality, the alleged ‘modal’ uses of will are accounted for by a pragmatic mechanism which restricts the domain of the covert (...) epistemic necessity operator scoping over the sentence. (shrink)

The theory of rough sets starts with the notion of an approximation space , which is a pair ( U , R ), U being the domain of discourse, and R an equivalence relation on U . R is taken to represent the knowledge base of an agent, and the induced partition reflects a granularity of U that is the result of a lack of complete information about the objects in U . The focus then is on approximations of concepts (...) on the domain, in the context of the granularity. The present article studies the theory in the situation where information is obtained from different sources. The notion of approximation space is extended to define a multiple-source approximation system with distributed knowledge base , which is a tuple , where N is a set of sources and P ranges over all finite subsets of N . Each R P is an equivalence relation on U satisfying some additional conditions, representing the knowledge base of the group P of sources. Thus each finite group of sources and hence individual source perceives the same domain differently (depending on what information the group/individual source has about the domain), and the same concept may then have approximations that differ with the groups. In order to express the notions and properties related with rough set theory in this multiple-source situation, a quantified modal logic LMSAS D is proposed. In LMSAS D , quantification ranges over modalities, making it different from modal predicate logic and modal logic with propositional quantifiers. Some fragments of LMSAS D are discussed and it is shown that the modal system KTB is embedded in LMSAS D . The epistemic logic is also embedded in LMSAS D , and cannot replace the latter to serve our purpose. The relationship of LMSAS D with first and second-order logics is presented. Issues of expressibility, axiomatization and decidability are addressed. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

– We offer a new motivation for imprecise probabilities. We argue that there are propositions to which precise probability cannot be assigned, but to which imprecise probability can be assigned. In such cases the alternative to imprecise probability is not precise probability, but no probability at all. And an imprecise probability is substantially better than no probability at all. Our argument is based on the mathematical phenomenon of non-measurable sets. Non-measurable propositions cannot receive precise probabilities, but there is a natural (...) way for them to receive imprecise probabilities. The mathematics of non-measurable sets is arcane, but its epistemological import is far-reaching; even apparently mundane propositions are liable to be affected by non-measurability. The phenomenon of non-measurability dramatically reshapes the dialectic between critics and proponents of imprecise credence. Non-measurability offers natural rejoinders to prominent critics of imprecise credence. Non-measurability even reverses some of the critics’ arguments—by the very lights that have been used to argue against imprecise credences, imprecise credences are better than precise credences. (shrink)

The logic of 'elsewhere,' i.e., of a sentence operator interpretable as attaching to a formula to yield a formula true at a point in a Kripke model just in case the first formula is true at all other points in the model, has been applied in settings in which the points in question represent spatial positions, as well as in the case in which they represent moments of time. This logic is applied here to the alethic modal case, in which (...) the points are thought of as possible worlds, with the suggestion that its deployment clarifies aspects of a position explored by John Divers under the name 'modal agnosticism.' In particular, it makes available a logic whose Halldén incompleteness explicitly registers the agnostic element of the position - its neutrality as between modal realism and modal anti-realism. (shrink)

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...) what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

Classical mereology (CM) is usually taken to be formulated in a tenseless language, and is therefore associated with a four-dimensionalist metaphysics. This paper presents three ways one might integrate the core idea of flat plenitude, i.e., that every suitable condition or property has exactly one mereological fusion, with a tensed logical setting. All require a revised notion of mereological fusion. The candidates differ over how they conceive parthood to interact with existence in time, which connects to the distinction between endurance (...) and perdurance. Similar issues arise for the integration of mereology with modality, and much of our discussion applies to this project as well. (shrink)

From Leibniz to Krauss philosophers and scientists have raised the question as to why there is something rather than nothing. Why-questions request a type of explanation and this is often thought to include a deductive component. With classical logic in the background only trivial answers are forthcoming. With free logics in the background, be they of the negative, positive or neutral variety, only question-begging answers are to be expected. The same conclusion is reached for the modal version of the Question, (...) namely ‘Why is there something contingent rather than nothing contingent?’. The categorial version of the Question, namely ‘Why is there something concrete rather than nothing concrete?’, is also discussed. The conclusion is reached that deductive explanations are question-begging, whether one works with classical logic or positive or negative free logic. I also look skeptically at the prospects of giving causal-counterfactual or probabilistic answers to the Question, although the discussion of the options is less comprehensive and the conclusions are more tentative. The meta-question, viz. ‘Should we not stop asking the Question’, is accordingly tentatively answered affirmatively. (shrink)

The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light of the problems of logical (...) omniscience and logical competence. Awareness models, impossible worlds models and syntactical models have been introduced to deal with the first problem. Certain conditions on the accessibility relations are needed to deal with the second problem. I go on to argue that those models are subject to the problem of quantifying in, for which I will provide a solution. (shrink)

Famously, the Church–Fitch paradox of knowability is a deductive argument from the thesis that all truths are knowable to the conclusion that all truths are known. In this argument, knowability is analyzed in terms of having the possibility to know. Several philosophers have objected to this analysis, because it turns knowability into a nonfactive notion. In addition, they claim that, if the knowability thesis is reformulated with the help of factive concepts of knowability, then omniscience can be avoided. In this (...) article we will look closer at two proposals along these lines :557–568, 1985; Fuhrmann in Synthese 191:1627–1648, 2014a), because there are formal models available for each. It will be argued that, even though the problem of omniscience can be averted, the problem of possible or potential omniscience cannot: there is an accessible state at which all truths are known. Furthermore, it will be argued that possible or potential omniscience is a price that is too high to pay. Others who have proposed to solve the paradox with the help of a factive concept of knowability should take note :53–73, 2010; Spencer in Mind 126:466–497, 2017). (shrink)

Carnap's theory of descriptions was restricted in two ways. First, the descriptive conditions had to be non-modal. Second, only primitive predicates or the identity predicate could be used to predicate something of the descriptum . The motivating reasons for these two restrictions that can be found in the literature will be critically discussed. Both restrictions can be relaxed, but Carnap's theory can still be blamed for not dealing adequately with improper descriptions.

The central question of this article is how to combine counterfactual theories of knowledge with the notion of actuality. It is argued that the straightforward combination of these two elements leads to problems, viz. the problem of easy knowledge and the problem of missing knowledge. In other words, there is overgeneration of knowledge and there is undergeneration of knowledge. The combination of these problems cannot be solved by appealing to methods by which beliefs are formed. An alternative solution is put (...) forward. The key is to rethink the closeness relation that is at the heart of counterfactual theories of knowledge. (shrink)