Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and Pearce. In Example 2, uncountably many pairs of definitionally inequivalent theories are given such that their model categories are concretely isomorphic via bijections that preserve ultraproducts in the model categories up to isomorphism. Based on these results, we settle several conjectures of Barrett, (...) Glymour and Halvorson. (shrink)

In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.

Recently, it has been proposed to understand a logic as containing not only a validity canon for inferences but also a validity canon for metainferences of any finite level. Then, it has been shown that it is possible to construct infinite hierarchies of ‘increasingly classical’ logics—that is, logics that are classical at the level of inferences and of increasingly higher metainferences—all of which admit a transparent truth predicate. In this paper, we extend this line of investigation by taking a somehow (...) different route. We explore logics that are different from classical logic at the level of inferences, but recover some important aspects of classical logic at every metainferential level. We dub such systems meta-classical non-classical logics. We argue that the systems presented deserve to be regarded as logics in their own right and, moreover, are potentially useful for the non-classical logician. (shrink)

I discuss problems with Martin-Löf's distinction between analytic and synthetic judgments in constructive type theory and propose a revision of his views. I maintain that a judgment is analytic when its correctness follows exclusively from the evaluation of the expressions occurring in it. I argue that Martin-Löf's claim that all judgments of the forms a : A and a = b : A are analytic is unfounded. As I shall show, when A evaluates to a dependent function type (x : (...) B) → C, all judgments of these forms fail to be analytic and therefore end up as synthetic. Going beyond the scope of Martin-Löf's original distinction, I also argue that all hypothetical judgments are synthetic and show how the analytic-synthetic distinction reworked here is capable of accommodating judgments of the forms A type and A = B type as well. Finally, I consider and reject an alternative account of analyticity as decidability and assess Martin-Löf's position on the analytic grounding of synthetic judgments. (shrink)

Logical frameworks that are sensitive to features of sentences’ subject-matter—like Berto’s topic-sensitive intentional modals (TSIMs)—demand a maximally faithful model of the topics of sentences. This is an especially difficult task in the case in which topics are assigned to intensional formulae. In two previous papers, a framework was developed whose model of intensional subject-matter could accommodate a wider range of intuitions about particular intensional conditionals. Although resolving a number of counterintuitive features, the work made an implicit assumption that the subject-matter (...) of an intensional conditional is a function of the subject-matters of its subformulae. This assumption—which I will call a principle of topic sufficiency—runs counter to some natural intuitions concerning topic. In this paper, we will investigate topic sufficiency and offer a semantic account that is state-sensitive, providing an implementation through the introduction of topic-sensitive logics related to William Parry’s prototypical $\mathsf {PAI}$. (shrink)

We formulate Hilbert’s epsilon calculus in the context of expansion proofs. This leads to a simplified proof of the epsilon theorems by disposing of the need for prenexification, Skolemisation, and their respective inverse transformations. We observe that the natural notion of cut in the epsilon calculus is associative.

This paper proposes and partially defends a novel philosophy of arithmetic—finitary upper logicism. According to it, the natural numbers are finite cardinalities—conceived of as properties of properties—and arithmetic is nothing but higher-order modal logic. Finitary upper logicism is furthermore essentially committed to the logicality of finitary plenitude, the principle according to which every finite cardinality could have been instantiated. Among other things, it is proved in the paper that second-order Peano arithmetic is interpretable, on the basis of the finite cardinalities’ (...) conception of the natural numbers, in a weak modal type theory consisting of the modal logic $\mathsf {K}$, negative free quantified logic, a contingentist-friendly comprehension principle, and finitary plenitude. By replacing finitary plenitude for the axiom of infinity this result constitutes a significant improvement on Russell and Whitehead’s interpretation of second-order Peano arithmetic, itself based on the finite cardinalities’ conception of the natural numbers. (shrink)

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to (...) reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ${\mathrm {ZFC}}$ to enable the development of interesting mathematics.We propose an axiomatic system ${\mathrm {BZFC}}$, obtained by analysing the ${\mathrm {ZFC}}$ -axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set.Our theory is naturally bi-interpretable with ${\mathrm {ZFC}}$, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1].Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory. (shrink)

The paper investigates from a proof-theoretic perspective various non-contractive logical systems, which circumvent logical and semantic paradoxes. Until recently, such systems only displayed additive quantifiers (Grišin and Cantini). Systems with multiplicative quantifiers were proposed in the 2010s (Zardini), but they turned out to be inconsistent with the naive rules for truth or comprehension. We start by presenting a first-order system for disquotational truth with additive quantifiers and compare it with Grišin set theory. We then analyze the reasons behind the inconsistency (...) phenomenon affecting multiplicative quantifiers. After interpreting the exponentials in affine logic as vacuous quantifiers, we show how such a logic can be simulated within a truth-free fragment of a system with multiplicative quantifiers. Finally, we establish that the logic for these multiplicative quantifiers (but without disquotational truth) is consistent, by proving that an infinitary version of the cut rule can be eliminated. This paves the way to a syntactic approach to the proof theory of infinitary logic with infinite sequents. (shrink)

In the early nineteenth century, a series of articles by Laplace and Poisson discussed the importance of ‘directness’ in mathematical methodology. In this thesis, we argue that their conception of a ‘direct’ proof is similar to the more widely contemplated notion of a ‘pure’ proof. More rigorous definitions of mathematical purity were proposed in recent publications by Arana and Detlefsen, as well as by Kahle and Pulcini: we compare Laplace and Poisson’s writings with these modern definitions of purity and show (...) how the modern definitions fail to grasp some more nuanced aspects. (shrink)

This paper proves the finite axiomatizability of transitive modal logics of finite depth and finite width w.r.t. proper-successor-equivalence. The frame condition of the latter requires, in a rooted transitive frame, a finite upper bound of cardinality for antichains of points with different sets of proper successors. The result generalizes Rybakov’s result of the finite axiomatizability of extensions of $\mathbf {S4}$ of finite depth and finite width.

We generalize the notion of consequence relation standard in abstract treatments of logic to accommodate intuitions of relevance. The guiding idea follows the use criterion, according to which in order for some premises to have some conclusion(s) as consequence(s), the premises must each be used in some way to obtain the conclusion(s). This relevance intuition turns out to require not just a failure of monotonicity, but also a move to considering consequence relations as obtaining between multisets. We motivate and state (...) basic definitions of relevant consequence relations, both in single conclusion (asymmetric) and multiple conclusion (symmetric) settings, as well as derivations and theories, guided by the use intuitions, and prove a number of results indicating that the definitions capture the desired results (at least in many cases). (shrink)

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

This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FL ${}_{\scriptsize\mbox{e}}$ -algebras). In particular, we inquire into sufficient and necessary conditions under which generalizations of the connexive implication-like operation defined in [6] for Heyting algebras still satisfy connexive theses. It will turn out that, in most cases, connexive principles are equivalent to the equational Glivenko property with respect to Boolean algebras. Furthermore, we (...) provide some philosophical upshots like, e.g., a discussion on the relevance of the above operation in relationship with G. Polya’s logic of plausible inference, and some characterization results on weak and strong connexivity. (shrink)

Sedlár and Vigiani [18] have developed an approach to propositional epistemic logics wherein (i) an agent’s beliefs are closed under relevant implication and (ii) the agent is located in a classical possible world (i.e., the non-modal fragment is classical). Here I construct first-order extensions of these logics using the non-Tarskian interpretation of the quantifiers introduced by Mares and Goldblatt [12], and later extended to quantified modal relevant logics by Ferenz [6]. Modular soundness and completeness are proved for constant domain semantics, (...) using non-general frames with Mares–Goldblatt truth conditions. I further detail the relation between the demand that classical possible worlds have Tarskian truth conditions and incompleteness results in quantified relevant logics. (shrink)

We develop a method for showing that various modal logics that are valid in their countably generated canonical Kripke frames must also be valid in their uncountably generated ones. This is applied to many systems, including the logics of finite width, and a broader class of multimodal logics of ‘finite achronal width’ that are introduced here.

This is the second part of a two-part series on the logic of hyperlogic, a formal system for regimenting metalogical claims in the object language (even within embedded environments). Part A provided a minimal logic for hyperlogic that is sound and complete over the class of all models. In this part, we extend these completeness results to stronger logics that are sound and complete over restricted classes of models. We also investigate the logic of hyperlogic when the language is enriched (...) with hyperintensional operators such as counterfactual conditionals and belief operators. (shrink)

Orthomodular logic is a weakening of quantum logic in the sense of Birkhoff and von Neumann. Orthomodular logic is shown to be a nonlinear noncommutative logic. Sequents are given a physically motivated semantics that is consistent with exactly one semantics for propositional formulas that use negation, conjunction, and implication. In particular, implication must be interpreted as the Sasaki arrow, which satisfies the deduction theorem in this logic. As an application, this deductive system is extended to two systems of predicate logic: (...) the first is sound for Takeuti’s quantum set theory, and the second is sound for a variant of Weaver’s quantum logic. (shrink)

Anselm described god as “something than which nothing greater can be thought” [1, p. 93], and Descartes viewed him as “a supreme being” [7, p. 122]. I first capture those characterizations formally in a simple language for monadic predicate logic. Next, I construct a model class inspired by Stoic and medieval doctrines of grades of being [8, 20]. Third, I prove the models sufficient for recovering, as internal mathematics, the famous ontological argument of Anselm, and show that argument to be, (...) on this formalization, valid. Fourth, I extend the models to incorporate a modality fit for proving that any item than which necessarily no greater can be thought is also necessarily real. Lastly, with the present approach, I blunt the sharp edges of notable objections to ontological arguments by Gaunilo and by Grant. A trigger warning: every page of this writing flouts the old saw “Existence is not a predicate” and flagrantly. (shrink)

This paper assembles a unifying framework encompassing a wide variety of mathematical instruments used to compare different theories. The main theme will be the idea that theory comparison techniques are most easily grasped and organized through the lens of category theory. The paper develops a table of different equivalence relations between theories and then answers many of the questions about how those equivalence relations are themselves related to each other. We show that Morita equivalence fits into this framework and provide (...) answers to questions left open in Barrett and Halvorson [4]. We conclude by setting up a diagram of known relationships and leave open some questions for future work. (shrink)

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

The present note was prompted by Weber’s approach to proving Cantor’s theorem, i.e., the claim that the cardinality of the power set of a set is always greater than that of the set itself. While I do not contest that his proof succeeds, my point is that he neglects the possibility that by similar methods it can be shown also that no non-empty set satisfies Cantor’s theorem. In this paper unrestricted abstraction based on a cut free Gentzen type sequential calculus (...) will be employed to prove both results. In view of the connection between Priest’s three-valued logic of paradox and cut free Gentzen calculi this, a fortiori, has an impact on any paraconsistent set theory built on Priest’s logic of paradox. (shrink)

The aim of this paper is to provide a complete Natural Kind Semantics for an Essentialist Theory of Kinds. The theory is formulated in two-sorted first order monadic modal logic with identity. The natural kind semantics is based on Rudolf Willes Theory of Concept Lattices. The semantics is then used to explain several consequences of the theory, including results about the specificity (species–genus) relations between kinds, the definitions of kinds in terms of genera and specific differences and the existence of (...) negative kinds. First, I show under which conditions the Hierarchy principle, which has been subjected to counterexamples in the literature, holds. I also show that a different principle about the species–genus relations between kinds, namely Kant’s Law, follows from the essentialist theory. Second, I introduce two new operations for kinds and show that they can be used to provide traditional definitions of kinds in terms of genera and specific differences. Finally, I show that these operations of specific difference induce, for each kind, a uniquely specified contrary kind and a uniquely specified subcontrary kind, which can be used as semantic values for non-classical predicate negations of kind terms. (shrink)

It is widely thought that chance should be understood in reductionist terms: claims about chance should be understood as claims that certain patterns of events are instantiated. There are many possible reductionist theories of chance, differing as to which possible pattern of events they take to be chance-making. It is also widely taken to be a norm of rationality that credence should defer to chance: special cases aside, rationality requires that one’s credence function, when conditionalized on the chance-making facts, should (...) coincide with the objective chance function. It is a shortcoming of a theory of chance if it implies that this norm of rationality is unsatisfiable. The primary goal of this paper is to show, on the basis of considerations concerning computability and inductive learning, that this shortcoming is more common than one would have hoped. (shrink)

A new characterization of tabularity in tense logic is established, namely, a tense logic L is tabular if and only if $\mathsf {tab}_n^T\in L$ for some $n\geq 1$. Two characterization theorems for the Post-completeness in tabular tense logics are given. Furthermore, a characterization of the Post-completeness in the lattice of all tense logics is established. Post numbers of some tense logics are shown.

We formulate and explore two basic axiomatic systems of type-free subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that the first of these systems is a suitable background theory for formally investigating controversial principles about type-free subjective probability.

Two of the most well-known belief contraction operators are partial meet contractions (PMCs) and kernel contractions (KCs). In this paper we propose two new classes of contraction operators, namely the class of generalized partial meet contractions (GPMC) and the class of generalized kernel contractions (GKC), which strictly contain the classes of PMCs and of KCs, respectively. We identify some extra conditions that can be added to the definitions of GPMCs and of GKCs, which give rise to some interesting subclasses of (...) those classes of functions, namely the classes of extensional and of uniform GPMCs/GKCs. In the context of contractions on belief sets the classes of partial meet contractions, uniform GPMCs and extensional GPMCs are all identical. Nevertheless, when considered as operations on belief bases, the class of uniform GPMCs coincides with the class of partial meet contractions, but the extensional GPMCs constitute a new kind of belief base contraction functions whose characterizing postulate of irrelevance of syntax is extensionality—the same postulate of irrelevance of syntax which occurs in the classical axiomatic characterization of partial meet contractions for belief sets—rather than the postulate of uniformity—which is the irrelevance of syntax postulate used in the axiomatic characterization for partial meet contractions on belief bases. Analogous results are obtained regarding the classes of extensional and of uniform GKCs. We present the interrelations in the sense of inclusion among all the new classes of operators presented in this paper and several well known classes of PMCs and of KCs. (shrink)

Purity is known as an ideal of proof that restricts a proof to notions belonging to the ‘content’ of the theorem. In this paper, our main interest is to develop a conception of purity for formal (natural deduction) proofs. We develop two new notions of purity: one based on an ontological notion of the content of a theorem, and one based on the notions of surrogate ontological content and structural content. From there, we characterize which (classical) first-order natural deduction proofs (...) of a mathematical theorem are pure. Formal proofs that refer to the ontological content of a theorem will be called ‘fully ontologically pure’. Formal proofs that refer to a surrogate ontological content of a theorem will be called ‘secondarily ontologically pure’, because they preserve the structural content of a theorem. We will use interpretations between theories to develop a proof-theoretic criterion that guarantees secondary ontological purity for formal proofs. (shrink)

In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for intuitionistic predicate logic with constant domains [13]. More precisely, we show that there is a valid implication $\phi \rightarrow \psi $ with no interpolant. Importantly, this result does not contradict the unfortunately named ‘Craig interpolation’ theorem established by Rauszer in [24] since that article is about the property more correctly named ‘deductive interpolation’ (see (...) Galatos, Jipsen, Kowalski and Ono’s use of this term in [5]) for global consequence. Given that the deduction theorem fails for bi-intuitionistic logic with global consequence, the two formulations of the property are not equivalent. (shrink)

In this paper, I develop an algorithmic impossible-worlds model of belief and knowledge that provides a middle ground between models that entail that everyone is logically omniscient and those that are compatible with even the most egregious kinds of logical incompetence. In outline, the model entails that an agent believes (knows) φ just in case she can easily (and correctly) compute that φ is true and thus has the capacity to make her actions depend on whether φ. The model thereby (...) captures the standard view that belief and knowledge ground are constitutively connected to dispositions to act. As I explain, the model improves upon standard algorithmic models developed by Parikh, Halpern, Moses, Vardi, and Duc, among other ways, by integrating them into an impossible-worlds framework. The model also avoids some important disadvantages of recent candidate middle-ground models based on dynamic epistemic logic or step logic, and it can subsume their most important advantages. (shrink)

Neo-Fregeanism aims to provide a possible route to knowledge of arithmetic via Hume’s principle, but this is of only limited significance if it cannot account for how the vast majority of arithmetic knowledge, accrued by ordinary people, is obtained. I argue that Hume’s principle does not capture what is ordinarily meant by numerical identity, but that we can do much better by buttressing plural logic with plural versions of the ancestral operator, obtaining natural and plausible characterizations of various key arithmetic (...) concepts, including finiteness, equinumerosity and addition and multiplication of cardinality—revealing these to be logical concepts, and obtaining much of ordinary arithmetic knowledge as logical knowledge. Supplementing this with an abstraction principle and a simple axiom of infinity (known either empirically or modally) we obtain a full interpretation of arithmetic. (shrink)

We present recent results on the model companions of set theory, placing them in the context of a current debate in the philosophy of mathematics. We start by describing the dependence of the notion of model companionship on the signature, and then we analyze this dependence in the specific case of set theory. We argue that the most natural model companions of set theory describe (as the signature in which we axiomatize set theory varies) theories of $H_{\kappa ^+}$, as $\kappa (...) $ ranges among the infinite cardinals. We also single out $2^{\aleph _0}=\aleph _2$ as the unique solution of the continuum problem which can (and does) belong to some model companion of set theory (enriched with large cardinal axioms). While doing so we bring to light that set theory enriched by large cardinal axioms in the range of supercompactness has as its model companion (with respect to its first order axiomatization in certain natural signatures) the theory of $H_{\aleph _2}$ as given by a strong form of Woodin’s axiom $(*)$ (which holds assuming $\mathsf {MM}^{++}$ ). Finally this model-theoretic approach to set-theoretic validities is explained and justified in terms of a form of maximality inspired by Hilbert’s axiom of completeness. (shrink)

We investigate whether ordinary quantification over objects is an extensional phenomenon, or rather creates non-extensional contexts; each claim having been propounded by prominent philosophers. It turns out that the question only makes sense relative to a background theory of syntax and semantics (here called a grammar) that goes well beyond the inductive definition of formulas and the recursive definition of satisfaction. Two schemas for building quantificational grammars are developed, one that invariably constructs extensional grammars (in which quantification, in particular, thus (...) behaves extensionally) and another that only generates non-extensional grammars (and in which quantification is responsible for the failure of extensionality). We then ask whether there are reasons to favor one of these grammar schemas over the other, and examine an argument according to which the proper formalization of deictic utterances requires adoption of non-extensional grammars. (shrink)

We extend the languages of both basic and graded modal logic with the infinity diamond, a modality that expresses the existence of infinitely many successors having a certain property. In both cases we define a natural notion of bisimilarity for the resulting formalisms, that we dub $\mathtt {ML}^{\infty }$ and $\mathtt {GML}^{\infty }$, respectively. We then characterise these logics as the bisimulation-invariant fragments of the naturally corresponding predicate logic, viz., the extension of first-order logic with the infinity quantifier. Furthermore, for (...) both $\mathtt {ML}^{\infty }$ and $\mathtt {GML}^{\infty }$ we provide a sound and complete axiomatisation for the set of formulas that are valid in every Kripke frame, we prove a small model property with respect to a widened class of weighted models, and we establish decidability of the satisfiability problem. (shrink)

We explain and explore class-theoretic potentialism—the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning the relevant potentialist systems (in particular exhibiting failures of the $\mathsf {.2}$ and $\mathsf {.3}$ axioms). We then discuss the significance of these results for the different kinds of class-theoretic potentialists.

In topological modal logic, it is well known that the Cantor derivative is more expressive than the topological closure, and the ‘elsewhere’, or ‘difference’, operator is more expressive than the ‘somewhere’ operator. In 2014, Kudinov and Shehtman asked whether the combination of closure and elsewhere becomes strictly more expressive when adding the Cantor derivative. In this paper we give an affirmative answer: in fact, the Cantor derivative alone can define properties of topological spaces not expressible with closure and elsewhere. To (...) prove this, we develop a novel theory of morphisms which preserve formulas with the elsewhere operator. (shrink)

The way Leibniz applied his philosophy to mathematics has been the subject of longstanding debates. A key piece of evidence is his letter to Masson on bodies. We offer an interpretation of this often misunderstood text, dealing with the status of infinite divisibility innature, rather than inmathematics. In line with this distinction, we offer a reading of the fictionality of infinitesimals. The letter has been claimed to support a reading of infinitesimals according to which they are logical fictions, contradictory in (...) their definition, and thus absolutely impossible. The advocates of such a reading have lumped infinitesimals with infinite wholes, which are rejected by Leibniz as contradicting the part–whole principle. Far from supporting this reading, the letter is arguably consistent with the view that infinitesimals, as inassignable quantities, arementis fictiones, i.e., (well-founded) fictions usable in mathematics, but possibly contrary to the Leibnizian principle of the harmony of things and not necessarily idealizing anything inrerum natura. Unlike infinite wholes, infinitesimals—as well as imaginary roots and other well-founded fictions—may involve accidental (as opposed to absolute) impossibilities, in accordance with the Leibnizian theories of knowledge and modality. (shrink)

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical interpretation of the (...) connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

We prove a strengthened version of Shavrukov’s result on the non-isomorphism of diagonalizable algebras of two $\Sigma _1$ -sound theories, based on the improvements previously found by Adamsson. We then obtain several corollaries to the strengthened result by applying it to various pairs of theories and obtain new non-isomorphism examples. In particular, we show that there are no surjective homomorphisms from the algebra $(\mathfrak {L}_T, \Box _T\Box _T)$ onto the algebra $(\mathfrak {L}_T, \Box _T)$. The case of bimodal diagonalizable algebras (...) is also considered. We give several examples of pairs of theories with isomorphic diagonalizable algebras but non-isomorphic bimodal diagonalizable algebras. (shrink)

We systematically study several versions of the disjunction and the existence properties in modal arithmetic. First, we newly introduce three classes $\mathrm {B}$, $\Delta (\mathrm {B})$, and $\Sigma (\mathrm {B})$ of formulas of modal arithmetic and study basic properties of them. Then, we prove several implications between the properties. In particular, among other things, we prove that for any consistent recursively enumerable extension T of $\mathbf {PA}(\mathbf {K})$ with $T \nvdash \Box \bot $, the $\Sigma (\mathrm {B})$ -disjunction property, the (...) $\Sigma (\mathrm {B})$ -existence property, and the $\mathrm {B}$ -existence property are pairwise equivalent. Moreover, we introduce the notion of the $\Sigma (\mathrm {B})$ -soundness of theories and prove that for any consistent recursively enumerable extension of $\mathbf {PA}(\mathbf {K4})$, the modal disjunction property is equivalent to the $\Sigma (\mathrm {B})$ -soundness. (shrink)

In providing a good foundation for mathematics, set theorists often aim to develop the strongest theories possible and avoid those theories that place undue restrictions on the capacity to possess strength. For example, adding a measurable cardinal to $ZFC$ is thought to give a stronger theory than adding $V=L$ and the latter is thought to be more restrictive than the former. The two main proponents of this style of account are Penelope Maddy and John Steel. In this paper, I’ll offer (...) a third account that is intended to provide a simple analysis of restrictiveness based on the algebraic concept of retraction in the category of theories. I will also deliver some results and arguments that suggest some plausible alternative approaches to analyzing restrictiveness do not live up to their intuitive motivation. (shrink)

Many tasks in statistical and causal inference can be construed as problems of entailment in a suitable formal language. We ask whether those problems are more difficult, from a computational perspective, for causal probabilistic languages than for pure probabilistic (or “associational”) languages. Despite several senses in which causal reasoning is indeed more complex—both expressively and inferentially—we show that causal entailment (or satisfiability) problems can be systematically and robustly reduced to purely probabilistic problems. Thus there is no jump in computational complexity. (...) Along the way we answer several open problems concerning the complexity of well-known probability logics, in particular demonstrating the ${\exists \mathbb {R}}$ -completeness of a polynomial probability calculus, as well as a seemingly much simpler system, the logic of comparative conditional probability. (shrink)

This paper puts forth a class of algebraic structures, relativized Boolean algebras (RBAs), that provide semantics for propositional logic in which truth/validity is only defined relative to a local domain. In particular, the join of an event and its complement need not be the top element. Nonetheless, behavior is locally governed by the laws of propositional logic. By further endowing these structures with operators—akin to the theory of modal Algebras—RBAs serve as models of modal logics in which truth is relative. (...) In particular, modal RBAs provide semantics for various well-known awareness logics and an alternative view of possibility semantics. (shrink)

Scoring rules measure the deviation between a forecast, which assigns degrees of confidence to various events, and reality. Strictly proper scoring rules have the property that for any forecast, the mathematical expectation of the score of a forecast p by the lights of p is strictly better than the mathematical expectation of any other forecast q by the lights of p. Forecasts need not satisfy the axioms of the probability calculus, but Predd et al. [9] have shown that given a (...) finite sample space and any strictly proper additive and continuous scoring rule, the score for any forecast that does not satisfy the axioms of probability is strictly dominated by the score for some probabilistically consistent forecast. Recently, this result has been extended to non-additive continuous scoring rules. In this paper, a condition weaker than continuity is given that suffices for the result, and the condition is proved to be optimal. (shrink)