SearcharxivSearch

arXiv · 2101.03593

The (Relevant) Logic of Scientific Discovery

Abstract

This paper presents a thoroughgoing interpretation of a weak relevant logic built over the Dunn-Belnap four-valued semantics in terms of the communication of information in a network of sites of knowledge production (laboratories). The knowledge communicated concerns experimental data and the regularities tested using it. There have been many nods to interpretations similar to ours - for example, in Dunn (1976), Belnap (1977). The laboratory interpretation was outlined in Bilkova et al. (2010). Our system is built on the Routley--Meyer semantics for relevant logic equipped with a four-valued valuation of formulas, where labs stand in for situations, and the four values reflect the complexity of assessing results of experiments. This semantics avoids using the Routley star, on the cost of introducing a further relation, required in evaluating falsity assignments of implication. We can however provide a natural interpretation of two accessibility relations - confirmation and refutation of hypotheses are two independent processes in our laboratory setup. This setup motivates various basic properties of the accessibility relations, as well as a number of other possible restrictions. This gives us a flexible modular system which can be adjusted to specific epistemic contexts. As perfect regularities are rarely, or perhaps never, actually observed, we add probabilities to the logical framework. As our logical framework is non-classical, the probability is non-classical as well, satisfying a weaker version of Kolmogorov axioms (cf. Priest 2006). We show that these probabilities allow for a relative frequency as well as for a subjective interpretation (we provide a Dutch book argument). We further show how to update the probabilities and to distinguish conditional probabilities from the probability of conditionals.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy Childers, Ondrej Majer, Peter Milne. 2021-01-10. The (Relevant) Logic of Scientific Discovery. https://arxiv.org/abs/2101.03593

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