In this paper we show that any reasoning process in which conclusions can be both fallible and corrigible can be formalized in terms of two approaches: (i) syntactically, with the use of defeasible reasoning, according to which reasoning consists in the construction and assessment of arguments for and against a given claim, and (ii) semantically, with the use of partial structures, which allow for the representation of less than conclusive information. We are particularly interested in the formalization of scientific reasoning, (...) along the lines traced by Lakatos’ methodology of scientific research programs. We show how current debates in cosmology could be put into this framework, shedding light on a very controversial topic. (shrink)

We present a memorial summary of the professional life and contributions to logic of John Corcoran. We also provide a full list of his many publications.Courtesy of Lynn Corcoran.

Strong negation is a well-known alternative to the standard negation in intuitionistic logic. It is defined virtually by giving falsity conditions to each of the connectives. Among these, the falsity condition for implication appears to unnecessarily deviate from the standard negation. In this paper, we introduce a slight modification to strong negation, and observe its comparative advantages over the original notion. In addition, we consider the paraconsistent variants of our modification, and study their relationship with non-constructive principles and connexivity.

We present a sequent calculus of a paraconsistent logic QMPT0, which has the paraconsistent-type excluded middle law (PEML) as an initial sequent. Our system shows that the presence of PEML is essentially important for QMPT0. It also has special rules when the set of constant symbols is finite. We also discuss the cut-elimination property of our system.

The partial structures approach has two major components: a broad notion of structure (partial structure) and a weak notion of truth (quasi-truth). In this paper, we discuss the relationship between this approach and free logic. We also compare the model-theoretic analysis supplied by partial structures with the method of supervaluations, which was initially introduced as a technique to provide a semantic analysis of free logic. We then combine the three formal frameworks (partial structures, free logic and supervaluations), and apply the (...) resulting approach to accommodate semantic paradoxes. (shrink)

Pessimistic meta-induction is a powerful argument against scientific realism, so one of the major roles for advocates of scientific realism will be trying their best to give a sustained response to this argument. On the other hand, it is also alleged that structural realism is the most plausible form of scientific realism; therefore, the plausibility of scientific realism is threatened unless one is given the explicit form of a structural continuity and minimal structural preservation for all our current theories. This (...) essay aims to present what we call expansive structures, which are the structures that can be reconstructed from geometrized Newtonian gravitation and are capable of expanding into general relativity, explicitly. In this way, pessimistic meta-induction will be undermined. (shrink)

I show that extant attempts to capture and generalize empirical adequacy in terms of partial structures fail. Indeed, the motivations for the generalizations in the partial structures approach are better met by the generalizations via approximation sets developed in “Generalizing Empirical Adequacy I”. Approximation sets also generalize partial structures.

An introduction to the model-theoretic approach in the philosophy of science is given and it is argued that this program is further enhanced by the introduction of partial structures. It is then shown that this leads to a natural and intuitive account of both "iconic" and mathematical models and of the role of the former in science itself.

We expose the main ideas, concepts and results about Jaśkowski's discussive logic, and apply that logic to the concept of pragmatic truth and to the Dalla Chiara-di Francia view of the foundations of physics.

In this work, the first of a series, we study the nature of informal inconsistency in physics, focusing mainly on the foundations of quantum theory, and appealing to the concept of quasi-truth. We defend a pluralistic view of the philosophy of science, grounded on the existence of inconsistencies and on quasi-truth. Here, we treat only the ‘classical aspects’ of the subject, leaving for a forthcoming paper the ‘non-classical’ part.

We apply the recently elaborated notions of 'pragmatic truth' and 'pragmatic probability' to the problem of the construction of a logic of inductive inference. It is argued that the system outlined here is able to overcome many of the objections usually levelled against such attempts. We claim, furthermore, that our view captures the essentially cumulative nature of science and allows us to explain why it is indeed reasonable to accept and believe in the conclusions reached by inductive inference.

Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understand identity as meaning indistinguishability . Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical theories, we present a higher-order logical system in which these concepts (...) are systematically separated. A 'classical' semantics for the system is presented and some philosophical related questions are mentioned. One of the main characteristics of our system is that Leibniz' Principle of the Identity of Indiscernibles cannot be derived. This fact is in accordance with some authors who maintain that quantum mechanics violates this principle. Furthermore, our system may be viewed as a way of making sense some of Schrödinger's logical intuitions about the nature of elementary particles. (shrink)

Two kinds of justification logics are studied. Then, this article shows how the notion of quasi-truth can be defined in these systems.

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, (...) a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

In order to develop an account of scientific rationality, two problems need to be addressed: (i) how to make sense of episodes of theory change in science where the lack of a cumulative development is found, and (ii) how to accommodate cases of scientific change where lack of consistency is involved. In this paper, we sketch a model of scientific rationality that accommodates both problems. We first provide a framework within which it is possible to make sense of scientific revolutions, (...) but which still preserves some (partial) relations between old and new theories. The existence of these relations help to explain why the break between different theories is never too radical as to make it impossible for one to interpret the process in perfectly rational terms. We then defend the view that if scientific theories are taken to be quasi-true, and if the underlying logic is paraconsistent, it's perfectly rational for scientists and mathematicians to entertain inconsistent theories without triviality. As a result, as opposed to what is demanded by traditional approaches to rationality, it's not irrational to entertain inconsistent theories. Finally, we conclude the paper by arguing that the view advanced here provides a new way of thinking about the foundations of science. In particular, it extends in important respects both coherentist and foundationalist approaches to knowledge, without the troubles that plague traditional views of scientific rationality. (shrink)

Abstract: According to Luciano Floridi (2008) , informational structural realism provides a framework to reconcile the two main versions of realism about structure: the epistemic formulation (according to which all we can know is structure) and the ontic version (according to which structure is all there is). The reconciliation is achieved by introducing suitable levels of abstraction and by articulating a conception of structural objects in information-theoretic terms. In this essay, I argue that the proposed reconciliation works at the expense (...) of realism. I then propose an alternative framework, in terms of partial structures, that offers a way of combining information and structure in a realist setting while still preserving the distinctive features of the two formulations of structural realism. Suitably interpreted, the proposed framework also makes room for an empiricist form of informational structuralism (structural empiricism). Pluralism then emerges. (shrink)

A first step is taken towards articulating a constructive empiricist philosophy of mathematics, thus extending van Fraassen's account to this domain. In order to do so, I adapt Field's nominalization program, making it compatible with an empiricist stance. Two changes are introduced: (a) Instead of taking conservativeness as the norm of mathematics, the empiricist countenances the weaker notion of quasi-truth (as formulated by da Costa and French), from which the formal properties of conservativeness are derived; (b) Instead of quantifying over (...) spacetime regions, the empiricist only admits quantification over occupied regions, since this is enough for his or her needs. (shrink)

One important role of belief systems is to allow us to represent information about a certain domain of inquiry. This paper presents a formal framework to accommodate such information representation. Three cognitive models to represent information are discussed: conceptual spaces, state-spaces, and the problem spaces familiar from artificial intelligence. After indicating their weakness to deal with partial information, it is argued that an alternative, formulated in terms of partial structures, can be provided which not only captures the positive features of (...) these models, but also accommodates the partiality of information ubiquitous in science and mathematics. (shrink)

. This paper proposes a generalization of the theory of the process of explanation to include consistent as well as inconsistent situations. The generalization is strong, for example in the sense that, if the background theory and the initial conditions are consistent, it leads to precisely the same results as the theory from the lead paper (Halonen and Hintikka 2004). The paper presupposes (and refers to arguments for the view that) inconsistencies constitute problems and that scientists try to resolve them.

Quasi-truth (a.k.a. pragmatic truth or partial truth) is typically advanced as a framework accounting for incompleteness and uncertainty in the actual practices of science. Also, it is said to be useful for accommodating cases of inconsistency in science without leading to triviality. In this paper, we argue that the formalism available does not deliver all that is promised. We examine the standard account of quasi-truth in the literature, advanced by da Costa and collaborators in many places, and argue that it (...) cannot legitimately account for incompleteness in science. We shall claim that it conflates paraconsistency and paracompleteness. It also cannot properly account for inconsistencies, because no direct contradiction of the form S ∧ ¬S can be quasi-true according to the framework; contradictions simply have no place in the formalism. Finally, we advance an alternative interpretation of the formalism in terms of dealing with distinct contexts where incompatible information is dealt with. This does not save the original program, but seems to make better sense of the apparatus. (shrink)

In order to develop efficient tools for automated reasoning with inconsistency (theorem provers), eventually making Logics of Formal inconsistency (_LFI_) a more appealing formalism for reasoning under uncertainty, it is important to develop the proof theory of the first-order versions of such _LFI_s. Here, we intend to make a first step in this direction. On the other hand, the logic _Ciore_ was developed to provide new logical systems in the study of inconsistent databases from the point of view of _LFI_s. (...) An interesting fact about _Ciore_ is that it has a _strong_ consistency operator, that is, a consistency operator which (forward/backward) propagates inconsistency. Also, it turns out to be an algebraizable logic (in the sense of Blok and Pigozzi) that can be characterized by means of a 3-valued logical matrix. Recently, a first-order version of _Ciore_, namely _QCiore_, was defined preserving the spirit of _Ciore_, that is, without introducing unexpected relationships between the quantifiers. Besides, some important model-theoretic results were obtained for this logic. In this paper we study some proof–theoretic aspects of both _Ciore_ and _QCiore_ respectively. In first place, we introduce a two-sided sequent system for _Ciore_. Later, we prove that this system enjoys the cut-elimination property and apply it to derive some interesting properties. Later, we extend the above-mentioned system to first-order languages and prove completeness and cut-elimination property using the well-known Shütte’s technique. (shrink)