SearcharxivSearch

arXiv · 2411.16994

Sequence and Consequence

Abstract

In the course of proving a tenability result about the probabilities of conditionals, van Fraassen (1976) introduced a semantics for conditionals based on omega-sequences of worlds, which amounts to a particularly simple special case of ordering semantics for conditionals. On that semantics, 'If p, then q' is true at an omega-sequence just in case q is true at the first tail of the sequence where p is true (if such a tail exists). This approach has become increasingly popular in recent years. However, its logic has never been explored. We axiomatize the logic of omega-sequence semantics, showing that it is the result of adding two new axioms to Stalnaker's logic C2: one, Flattening, which is prima facie attractive, and, and a second, Sequentiality, which is complex and difficult to assess, but, we argue, likely invalid. But we also show that when sequence semantics is generalized from omega-sequences to arbitrary (transfinite) ordinal sequences, the result is a more attractive logic that adds only Flattening to C2. We also explore the logics of a few other interesting restrictions of ordinal sequence semantics. Finally, we address the question of whether sequence semantics is motivated by probabilistic considerations, answering, pace van Fraassen, in the negative.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cian Dorr, Matt Mandelkern. 2024-11-25. Sequence and Consequence. https://arxiv.org/abs/2411.16994

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO