Logical Studies of Paraconsistent Reasoning in Science and Mathematics 1st Edition Holger Andreas 2024 Scribd Download
Logical Studies of Paraconsistent Reasoning in Science and Mathematics 1st Edition Holger Andreas 2024 Scribd Download
com
https://textbookfull.com/product/logical-studies-of-
paraconsistent-reasoning-in-science-and-mathematics-1st-
edition-holger-andreas/
OR CLICK BUTTON
DOWNLOAD NOW
https://textbookfull.com/product/logical-reasoning-and-data-
interpretation-for-cat-6th-edition-nishit-k-sinha/
textboxfull.com
https://textbookfull.com/product/doing-philosophy-from-common-
curiosity-to-logical-reasoning-timothy-williamson/
textboxfull.com
Logical Studies First Edition. Edition Von Wright
https://textbookfull.com/product/logical-studies-first-edition-
edition-von-wright/
textboxfull.com
https://textbookfull.com/product/how-to-prepare-for-logical-reasoning-
for-cat-arun-sharma-sharma/
textboxfull.com
https://textbookfull.com/product/justification-logic-reasoning-with-
reasons-cambridge-tracts-in-mathematics-1st-edition-sergei-artemov/
textboxfull.com
https://textbookfull.com/product/visualizing-mathematics-the-role-of-
spatial-reasoning-in-mathematical-thought-kelly-s-mix/
textboxfull.com
Trends in Logic 45
Holger Andreas
Peter Verdée Editors
Logical Studies
of Paraconsistent
Reasoning in
Science and
Mathematics
Trends in Logic
Volume 45
TRENDS IN LOGIC
Studia Logica Library
VOLUME 45
Editor-in-Chief
Heinrich Wansing, Ruhr-University Bochum, Bochum, Germany
Editorial Assistant
Andrea Kruse, Ruhr-University Bochum, Bochum, Germany
Editorial Board
Aldo Antonelli, University of California, Davis, USA
Arnon Avron, University of Tel Aviv, Tel Aviv, Israel
Katalin Bimbó, University of Alberta, Edmonton, Canada
Giovanna Corsi, University of Bologna, Bologna, Italy
Janusz Czelakowski, University of Opole, Opole, Poland
Roberto Giuntini, University of Cagliari, Cagliari, Italy
Rajeev Goré, Australian National University, Canberra, Australia
Andreas Herzig, University of Toulouse, Toulouse, France
Andrzej Indrzejczak, University of Łodz, Łodz, Poland
Daniele Mundici, University of Florence, Florence, Italy
Sergei Odintsov, Sobolev Institute of Mathematics, Novosibirsk, Russia
Ewa Orłowska, Institute of Telecommunications, Warsaw, Poland
Peter Schroeder-Heister, University of Tübingen, Tübingen, Germany
Yde Venema, University of Amsterdam, Amsterdam, The Netherlands
Andreas Weiermann, University of Ghent, Ghent, Belgium
Frank Wolter, University of Liverpool, Liverpool, UK
Ming Xu, Wuhan University, Wuhan, People’s Republic of China
Founding editor
Ryszard Wójcicki, Polish Academy of Sciences, Warsaw, Poland
The book series Trends in Logic covers essentially the same areas as the journal Studia Logica,
that is, contemporary formal logic and its applications and relations to other disciplines. The
series aims at publishing monographs and thematically coherent volumes dealing with
important developments in logic and presenting significant contributions to logical research.
The series is open to contributions devoted to topics ranging from algebraic logic, model
theory, proof theory, philosophical logic, non-classical logic, and logic in computer science
to mathematical linguistics and formal epistemology. However, this list is not exhaustive,
moreover, the range of applications, comparisons and sources of inspiration is open and
evolves over time.
Editors
Logical Studies
of Paraconsistent Reasoning
in Science and Mathematics
123
Editors
Holger Andreas Peter Verdée
University of British Columbia Institut Supérieur de Philosophie
Kelowna, BC Université Catholique de Louvain
Canada Louvain-la-Neuve
Belgium
v
vi Contents
H. Andreas (B)
University of British Columbia, Kelowna, Canada
e-mail: [email protected]
P. Verdée
Université catholique de Louvain, Louvain-la-Neuve, Belgium
e-mail: [email protected]
The first and most obvious reason is the need to deal with inconsistent informa-
tion or inconsistent theories. It is rather uncontroversial that every human attempt
to obtain empirical or theoretic information is susceptible to inconsistencies. The
reasons for this may be very diverse. There may be errors in the processing of
information, errors in storing and retrieving information, calculation errors, errors in
observation, discrepancies between theory and observations, unforeseen contradic-
tory outcomes of theories, incompatibilities between different of our best theories
about the world (possibly all empirically adequate w.r.t. past observations), inconsis-
tent sources, inconsistent databases, defeated conclusions of non-deductive reason-
ing…All human epistemic methods are fallible and in case of failure there is nothing
which can warrant the freedom from inconsistencies. Each part of our knowledge can
in principle be wrong and then be in conflict with other parts or future observations. If
this happens, it is rarely easy to solve the issue by diagnosing the problem and simply
contracting the problematic sentences. These conflicts are parts of a structured web
full of useful information. But even if we are able to remove mistaken information,
there usually is no immediate correct alternative at hand which is harmless. As long
as there is no alternative, one seems to be forced to provisionally take this incon-
sistent body of information as it is and continue reasoning from there, until one has
found a way to solve the problem.
An Explosive logic cannot be used for this purpose, because in such a logic every
inconsistent theory is interderivable (from any inconsistent theory one can derive all
statements of any other theory) and thus equivalent. This means that, given an Explo-
sive logic, all inconsistent information becomes inferentially identical and therefore
entirely useless. It should not come as a surprise that this is highly undesired for
the above described type of problems. Instead one may want a logic that maximally
isolates (possible) inconsistencies so that the underlying problems do not infect or
affect other parts of our knowledge. Or, on the other side of the spectrum, one may
rather want a logic which maximally approximates an Explosive logic, but without
Explosion. Similarly, one may want a logic which spreads inconsistencies to all for-
mally related sentences to avoid potentially false assumptions of safety for indirectly
affected sentences. Alternatively, one may want a mechanism to “repair” the incon-
sistency. Yet another project may be to devise a logic which reduces inconsistencies
to more basic/primitive inconsistencies.
A second reason is dealing with inescapable, acceptable or true contradictions.
This concerns several versions of dialetheism (cf. [22]). Semantic paradoxes (among
which the famous Liar Paradox) show that we cannot combine traditional Explosive
logic, certain parts of ordinary language (e.g. unrestricted self reference) and straight-
forward principles of semantics (e.g. transparent truth). Other paradoxes (set theo-
retic, property theoretic, related to informal mathematical proofs or definitions) show
that inconsistencies are obtained by using certain intuitively very attractive principles
of reasoning. In all these cases ways have been found to avoid the inconsistencies
by restricting the modelled domains and the validity of the intuitive principles. But
one may choose to take the intuitions behind the problematic theories seriously and
so to bite the bullet and accept the inescapable inconsistency. Of course one needs a
logic to reason with such an acceptable or even true inconsistency. Even if one does
4 H. Andreas and P. Verdée
consistent formulas (and not for all other formulas). The advantage of this approach
is that one can understand and model classical reasoning as well as paraconsistent
reasoning, depending on which formulas are involved.
A second category are the many valued logics. The idea is to allow other truth
values than consistent truth and consistent falsity. An evident choice is of course the
introduction of a third value indicating both true and false. Other options are: going
four valued (adding a value for neither-true-nor-false) or even infinitely valued. In
general Disjunctive Syllogism will not be valid, because there are non-classical truth
values that make both A and ¬A ∨ B true without affecting the value of B. There
are a lot of examples, but prominent ones are these: the three valued logic of paradox
(cf. [20]), the four valued Belnap Dunn logic (cf. [14]) and, recently, paraconsistent
logics based on infinitely valued fuzzy logics [15]).
A third category are systems in which negation is a modal connective. This is a
diverse group, but in general one obtains paraconsistency by interpreting negation in
such a way that the truth of a negated formulas is interpreted as the possible falsity
of that formula. Just like it is consistent in classical modal logic that a formula is
true and possibly false, there are models in which a formula and its negation are both
true, given such a modal paraconsistent negation. The first and best known example
is what is now known as dual intuitionistic logic (cf. [16]). In the Kripke semantics of
intuitionistic logic negation is interpreted as not possibly true, were ‘possibly’ means
provable at some future point in time. In the dual version we could read negation
as possibly false or refutable at some point in time. This treatment of negation as a
modal connective can be based on many other modal logics in several diverse ways
of expressing the paraconsistent negation. A philosophical study of negation as a
modality can be found in [8].
A fourth category are the non-adjunctive or discussive paraconsistent logics (cf.
[17]). Consistencies are here possible because a sentence may be coherently held
by one agent in a discussion and its negation coherently by another agent in the
same discussion. From the point of view of a neutral observer of the discussion we
are dealing with an inconsistency. A ∧ ¬A would still explode, but there is no way
to conjoin A and ¬A. In these logics Addition is unproblematic, but Disjunctive
Syllogism is only valid in its one premise form: from A ∧ (¬A ∨ B) conclude B.
The Adjunction (Conjunction Introduction) rule (derive A ∧ B from A and B) is
blocked.
A fifth category are the non-monotonic logics. They restrict the law of Disjunctive
Syllogism to formulas which could be consistent in view of the premises. For the
other formulas one of the other paraconsistency strategies is used. That way only
those models are selected that verify a minimal amount of inconsistencies. The
advantage of this strategy is that one has the inferential richness of Explosive logics
for consistent premises, but also the inconsistency tolerance when the premises are
not consistent. The most well known examples are inconsistency adaptive logics [5]
and minimally inconsistent LP (cf. [21]).
A sixth category contains logics that are not cautiously transitive. Merely block-
ing (cautious) transitivity makes it possible to validate both Disjunctive Syllogism
and Addition (and in fact all the strength of classical logic for consistent premises)
6 H. Andreas and P. Verdée
without necessarily validating the Explosion rule (cf. [6, 9]). Non-monotonic logics
will usually also be non-transitive but will make sure that they are cautiously transi-
tive (if something follows from the combination of the premises plus a conclusion,
then it is also a valid conclusion of the premises alone). If one does not have cautious
transitivity, one can have both unproblematic rules, as long as both are not applied
in chain (one after the other). In this case one can have a monotonic structural para-
consistent logic which validates all classical consequences of consistent premises.
The price to pay here is the capacity to build on earlier results. Every proof needs to
start again from the basic axioms.
A seventh category are the implication revising logics. It is quite generally recog-
nized that the material implication of classical logic (and many other logics) is far
from the implication connective used in informal reasoning. A first example are the
relevant logics (cf. [2] and the discussion above). Connexive logic (cf. [18]), on the
other hand, are not subclassical; they really contradict classical logic. They make
it false that something could imply its negation. If, by contrast, one also accepts
that it is true that (some) contradictions imply their negations, one easily obtains a
contradiction the logic should be able to deal with.
Still other options are logics with a non-deterministic semantics. In these systems
the semantics of complex sentences are not necessarily reduced/analysed into incon-
sistencies concerning primitive sentences. That way the negation of a sentence A
may for example be allowed to be true independent of the truth value of A. This way
A and its negation may be true together. Of course one loses compositionality, but
this does not need to make the logic inferentially impotent. Examples are the weaker
LFIs such as mbC and Batens’ system CLuN (cf. [4]).
A final category concerns the possibility to block Addition (possibly only for
inconsistent formulas) in order to avoid Explosion. In a logic that merely analyses
sentences into (combinations of) subsentences, of course one can never obtain an
arbitrary formula. This strategy is followed in [19].
It is clear that there are a lot of paraconsistent logics with a diverse set of purposes.
Although, in general, they are well-developed, both technically and philosophically,
there is not much research comparing them in relation to their applicability in sci-
ence and mathematics. It is surprising how little these logics are actively applied
to actual scientific or mathematical theories (other than some historical reconstruc-
tions). Given how common it is that scientists have to deal with inconsistencies
(between theories, between theories and observations, and inside theories) and incon-
sistency resolution, it is surprising that relatively little work has been done to make
the involved type of reasoning logically precise.
There may be several reasons for this. Let us summarize some of the possible
objections one may have against adopting a paraconsistent logic for concrete appli-
cations in science and mathematics. Many people are reluctant to use paraconsistent
logics because when adopting them, one loses the strongest possible argument to
reject problematic hypotheses and theories, i.e. the fact that they are inconsistent. In
a paraconsistent context, logic alone does not suffice to reject inconsistent theories.
Consequently, in such a context new information will never, by pure force of logic,
necessitate the revision of old information. Logic no longer excludes the possibil-
Paraconsistent Reasoning in Science and Mathematics: Introduction 7
ity to keep piling up all kinds of inconsistent information without ever contracting
old information. Belief revision is therefore no longer a logical requirement. There
may of course be many other reasonable criteria for rejecting problematic theories
(incoherence, vagueness, lack of elegance, lack of explanatory power, empirical inad-
equacy etc.) and consistency may in a paraconsistent context still be a locally valid
extra-logical requirement, or a property one may want to satisfy as much as possible.
Nevertheless it is dialectically very attractive to possess a logical criterion to dismiss
every theory from which one can derive an inconsistency.
Moreover, the discussion above shows that (most) paraconsistent logics need
to lose some a priori attractive principles of reason. We have become so used to
classical logic that all of the above considered principles (Disjunctive Syllogism,
Addition, Adjunction, Monotonicity and Transitivity) seem very natural principles of
logical consequence often successfully applied in informal mathematical or scientific
reasoning. If such principles are no longer logically valid, one needs to explain the
discrepancy between logic and practice. Are the apparently successful applications
of the invalid principles mistakes, locally correct applications of a generally speaking
invalid principle, or the result of a mistaken formalization? Moreover, if not merely
metalogical principles (Monotonicity, Transitivity) but actual logic rules (Disjunctive
Syllogism, Addition, Adjunction) are blocked, one loses inferential power to the
effect that many theories become much weaker. This may be desirable for those
parts of the considered theory where one is confronted with actual inconsistencies,
but problematic where everything seems to behave consistently.
Logics that have more inferential power but require specific treatment for consis-
tent parts of theories are often computationally highly complex. In order to find out
whether a specific application of a rule is valid, one needs to know already whether
an inconsistency is derivable from certain involved formulas in relation to the rest
of the theory. Calculating this may be very difficult (cf. [25]). Suppose that, inside a
given theory ∪ {A, ¬A ∨ B}, one wants to apply Disjunctive Syllogism to obtain
B. If the paraconsistent logic only allows this rule if A is consistent, one needs to
find out whether ¬A is derivable from , before one is able to correctly apply this
single rule. If and A have some non-logical vocabulary in common and is a large
set or forms a complex theory, finding this out may be immensely time consuming
or even undecidable. Computational complexity is not a conclusive reason to reject a
logic, because the logic may be seen as merely the ideal but difficult or unreachable
standard of reasoning. But in that case one should explain how human agents can at
least approximately deal with the unreachable ideal reasoning standards in practice.
Yet another possible objection is the question whether formal logic is applicable in
an inconsistent context. Those who do accept the importance of inconsistency tolerant
reasoning may object that this type of reasoning (largely) happens extralogically (cf.
[24]). Important extra-logical factors involved in dealing with inconsistencies are:
the sources of information, the priority ordering of information and its sources, the
goals of reasoning, social and dialectical dynamics of reasoning and arguing, and
fallible diagnostic reasoning. Nobody will deny that such factors play a role in dealing
with (at least some) inconsistencies, but that does not mean that one cannot also say
something with logical generality based solely on the form of involved expressions.
8 H. Andreas and P. Verdée
Even those who accept that paraconsistent logics correctly formalize some phe-
nomena, may still claim that, to the extent that they are useful, paraconsistent logics
can be translated into more traditional explosive logics. Either one claims that what
paraconsistent logicians would formalize as an inconsistency should actually be for-
malized differently (possibly with the same syntactic consequences). If an agent
receives information A and information ¬A from two equally reliable sources, it
makes sense to formalize this as ‘agent 1 believes A’ and ‘agent 2 believes ¬A’,
using doxastic or epistemic modalities. Even in explosive logics this pair does not
explode. Similar modal solutions work for every kind of inconsistency coming from
different origins (incompatible axioms, theories, observations). In case the incon-
sistency originates from one indissoluble (inconsistent) body of information this
strategy does not work, but one could then argue that the body of information is
simply unreliable and should not be used for doing further reasoning.
Another alternative is to consider the paraconsistent negation as a coherent unary
connective that can be added to classical logic, but not as the negation. One can often
use the usually classical semantics of the paraconsistent negation connective to add it
to classical logic as a conservative extension. Or one can define inconsistency tolerant
databases or inconsistent properties/collections inside a purely classical context as
well-defined mathematical objects. Compare it to fuzzy set theory. People speak of
fuzzy sets (cf. [26]), but they are merely useful classical mathematics tools, which
are defined by means of ordinary sets and real number theory. They behave in such
a way that they are more subtle generalizations of ordinary sets (ones to which the
elements belong to a certain degree, instead of just in or out). They are no alternatives
to classical set theory, but mere extensions of it. People who accept the usefulness of
some paraconsistent logics can claim the same thing about a paraconsistent negation;
a useful tool that can be defined in a rich enough classical logic (plus perhaps some
parts of classical set theory). For many applications of paraconsistent logic it seems
indeed unnecessary to really revise classical logic; it is often sufficient to realize
that classical logic is not the appropriate tool to approach inconsistent collections of
information. But classical logic was never meant for this purpose anyway. The idea
would be that one could keep using classical logic with its inconsistency intolerant
negation for all the more foundational/justifying purposes it was meant for. This may
be a reasonable position if it concerns rather practical applications of paraconsistent
logic, but it does not work for more fundamental applications about the very basics
of mathematics, philosophy and logic.
We have listed a number of often heard objections to the usefulness of paracon-
sistent logic as an alternative to classical logic. None of these objections are suffi-
cient arguments to reject the usefulness of paraconsistent logics, but those defending
paraconsistent logics need to specify how to overcome these issues. This itself is an
interesting debate and the possible answers depend a lot on which logic and which
application one has in mind.
The reader understands by now that paraconsistency is a diverse phenomenon with
different raisons d’être, different technical solution and different ways to respond
to criticism, all of which have to do with the specific application one has in mind.
Nevertheless there is also quite a lot of common ground. Similar techniques have been
Paraconsistent Reasoning in Science and Mathematics: Introduction 9
used, similar arguments have been given against Explosion and against the critics
of paraconsistency, and similar inconsistent theories have been studied, all of this
often independently from one another and inside different schools of paraconsistency.
Nevertheless there is relatively little study about the similarities and differences of the
different currents of paraconsistency in relation to the intended real life applications
of paraconsistency.
In order to open the debate on how the different formalisms relate to their real life
applications in the philosophy of science and mathematics, we decided to organize
a conference on this topic in Munich, Germany: the conference Paraconsistent Rea-
soning in Science and Mathematics (June 11–13, 2014) in the beautiful setting of the
Carl-Friedrich-von-Siemens-Stiftung. Our aim was to bring the different schools of
paraconsistency together to open the debate on how the different formalisms relate
to their real life applications in the philosophy of science and mathematics.
The level of the talks and the quality of the debate was so high that the participants
of the conference were all in favour of publishing a volume on the topic of the confer-
ence, aiming toward a written and more detailed follow up of this debate. The present
book is the result. We hope the reader will find that it lives up to the expectations. In
what follows, we give a brief summary of every paper of our collection.
zation immediately gives rise to an adequate dynamic proof theory for the inference
relations. The paper concludes with a demonstration of how we can derive sensible
conclusions from Bohr’s model of the atom using adaptive proofs.
Franzesco Berto explores impossible worlds for an analysis of ceteris paribus imagi-
nation. An impossible world is one where the laws of classical logic may be violated
by the truth-value assignment to atomic and complex formulas. Hence, an impossi-
ble world may verify a set of sentences that is classically inconsistent. Impossible
worlds, therefore, may serve as a model of inconsistent beliefs.
Why should we want to model inconsistent beliefs? The underlying motivation
derives from the limitations of our logical capacities. We are unable to grasp all
logical consequences of a set of explicit beliefs, and we may even fail to recognize
inconsistencies in our explicit beliefs. As is well known, this happened to Frege when
he developed his Basic Laws of Arithmetic. In brief, we are not logically omniscient.
Ceteris paribus imagination is modelled by a conditional: if an agent explicitly
conceives A to be the case, then B is part of the imagined scenario. In formal terms:
[A]B, where [∗] is a modal operator, defined by an accessibility relation on the set
of possible and impossible worlds. [A] B holds true if B is verified by all worlds
(possible and impossible ones) that are reachable from the actual world and in which
A holds true.
Having defined a worlds semantics of [A]B, Berto investigates which axioms
envisioned for variably strict conditionals remain valid for ceteris paribus imagina-
tion. Notably, [A ∧ ¬A]B fails to hold for arbitrary B. Imagining an inconsistent
scenario does not mean that we trivialize what we conceive. In this respect, the ceteris
paribus conditional behaves like a paraconsistent consequence relation.
Science is full of inconsistencies: first, we have scientific theories that are internally
inconsistent and thus imply a contradiction. Second, we have scientific theories that
make assumptions inconsistent with other accepted scientific theories. Third, we have
numerous approximations and idealizations that are known to be inconsistent with
what we strictly believe about the respective theoretical entities. Fourth, scientific
theories are often times inconsistent with certain predecessor theories, while pre-
serving many of their empirical predictions. These inconsistencies strongly suggest
the need for a paraconsistent treatment of scientific reasoning.
Bryson Brown attempts to provide methodological foundations for a paraconsis-
tent approach to scientific reasoning. His proposal is to view reliability-in place of
truth-as the property to be preserved by proper scientific reasoning, as well as in the
Paraconsistent Reasoning in Science and Mathematics: Introduction 11
replacement of earlier scientific theories by new ones. The main focus of Brown’s
paper is on reliable inference patterns in the history of science, including Planck’s
treatment of black body radiation and Bohr’s theory of the hydrogen atom; work
by Nancy Cartwright and Bas C. van Fraassen is also discussed, leading up to an
account of a modestly paraconsistent approach to scientific reasoning.
This paper discusses the question whether truth value gluts (both true and false)
should be designated in an analysis of mathematical and scientific reasoning. Prac-
tically speaking the question is whether one should assert sentences that are true
and false and whether they should be used as basis for decisions and actions and
as premises of arguments. The traditional paraconsistent view is that there are truth
value gluts and that they should be designated. In some sense the converse goes
against the very basic starting point of paraconsistency: a non-designated glut will
not block the Explosion rules.
Kapsner defends the view that it is often, but not always, unreasonable to assert
glutted statements. He presents a clear case: if two costumer reviews contradict each
other on the quality of a product, one should not assert the contradicting information
obtained by reading the reviews. Subsequently he presents some cases from the
12 H. Andreas and P. Verdée
history of science (the infinitesimal calculus and the Darwin–Kelvin debate on the
age of the earth) to indicate that also in these case it may be more reasonable not to
designate gluts.
This paper concerns the often heard argument that paraconsistent negation is not
a real negation because a sentence and its negation should never be true together.
The author attacks the argument by showing that it could also be used to show that
classical logic’s negation is by the same standards not a real negation either.
Classical logic has certain unavoidable non-intended models. Carnap was the first
to point out that adding a trivial model (in which all formulas are true) to the semantics
of classical logic does not affect the set of valid consequences. In such a model of
course formulas and their negations are both true. It seems thus that it is impossible
even in classical logic to exclude the possibility that a formula and its negation are
both true.
The history of the paradoxes and attempted solutions thereof shows many cases
where a certain solution falls prey to another, more refined variant of the original
paradox. The revenge liar is the most famous instance of such cases. Martin Pleitz
adds another chapter to this history of attempted solutions and recurrent paradoxes.
The focus is on a recent proposal by Graham Priest to solve the semantic and
set-theoretic paradoxes using a biconditional that does not detach, i.e., that fails to
satisfy modus ponens. A detachable truth schema, however, is needed for what has
been described as blind endorsement. For example, if one holds that everything that
the Bible says is true, one blindly endorses all the claims made in the Bible. To
solve this problem, Priest entertains the idea of introducing a detachable conditional,
together with an expression predicate that allows us to say that certain propositions
are expressed by certain sentences.
Martin Pleitz formulates a very reasonable principle that an expression operator,
licensing blind endorsements, should satisfy: any meaningful sentence should be
synonymous with itself. Based on an axiomatic formulation of this principle, he
shows that variants of the Liar and the Curry paradox can be formulated. Hence,
we have a contradiction and a way to trivialize the system envisioned by Priest. As
triviality is unbearable even in a paraconsistent setting, this casts serious doubt on
Priest’s proposed solution.
The very idea of motion seems to be contradictory: if we say that an object is moving,
we imply that it is at different places at different times. So far, things are consistent.
If, however, we want to say that an object is moving right now, we seem to ascribe
the property of changing positions to a specific time point. At a specific time point,
however, an object can only be at one place. Drawing on Zeno’s paradox of the arrow
and assuming that only the present time point has reality, we can thus argue that no
object is really moving. Motion is not part of reality. Likewise, the flow of time is an
unreal phenomenon.
Alternatively, we can accept that motion and time are contradictory but real,
thereby embracing some form dialetheism. This alternative is investigated and sym-
pathetically entertained by Corry Shores in his contribution. Besides the work of
Zeno, he draws on Husserl’s phenomenology and subsequent phenomenological
research to motivate a dialetheist account of change and time. Dialetheist ideas about
the phenomenology of time are thus brought together with recent work in theoretical
psychology.
14 H. Andreas and P. Verdée
In this paper two of the most popular arguments (by Beall resp. Priest) in favour of
the inconsistency of (informal) mathematics (and so the need to formalize it with a
paraconsistent logic) are discussed. A first argument is based on what is sometimes
called Gödel’s paradox, i.e. a sentence expressing that it is not provable. Accepting
the existence of such a sentence leads to a contradiction in mathematics. The second
argument is based on the incompatibility of completeness and consistency estab-
lished by Gödel’s incompleteness theorems. Arguing in favour of the completeness
of informal mathematics, thus also forms an argument against the consistency of
mathematics.
Tanswell argues against these arguments that the necessary distinctions between
formality and informality are often ignored. The author also points at problems with
the assumption of the unity of informal mathematics.
the desiderata of a paraconsistent logic that have been suggested by Priest and Rout-
ley [23]. Finally, Wansing and Odintsov sketch a universal approach to constructing
a paraconsistent logic for a given reference logic that may well not be classical logic.
This paper concerns the application of paraconsistent logic and dialetheism to theo-
retic computer science. The question is asked whether there are algorithms which are
essentially paraconsistent, in the sense that only paraconsistent logic can recognize
them. While the question may seem counterintuitive, it is clear that certain objects
can exists in paraconsistent mathematics which cannot exist otherwise (for example
the Russell set or the set of all ordinals). So it is not unlikely that also the concept of an
algorithm should be reconsidered in a paraconsistent setting in order for classically
unknowable but useful objects to be recognized and studied.
The author argues in favour of the existence of such properly paraconsistent com-
putations. Arguments by Sylvan and Copeland, Routley, and Priest support this view.
One of the arguments goes as follows: in view of a straightforward diagonalization,
the algorithm that enumerates all algorithms (intuitively) is but at the same time
cannot be an algorithm. If it is an algorithm (and it sure seems to be one) it has to be
an inconsistent algorithm.
Subsequently Weber investigates the ways in which one could formulate para-
consistent algorithms in a dialetheic mathematical metalanguage. He discusses the
properties of so called dialetheic machines and their relation with finiteness and the
halting problem.
References
9. Besnard, P., & Hunter, A. (1995). Quasi-classical logic: Non-trivializable classical reason-
ing from inconsistent information. Symbolic and quantitative approaches to reasoning and
uncertainty (pp. 44–51). Heidelberg: Springer.
10. Carnap, R. (1958). Beobachtungssprache und theoretische Sprache. Dialectica, 12, 236–248.
11. Carnielli, W. A., Coniglio, M. E., & Marcos, J. (2007). Logics of formal inconsistency. In D.
Gabbay & F. Guenthner (Eds.), Handbook of philosophical logic (Vol. 14, pp. 1–93). Heidel-
berg: Springer.
12. Church, A. (1951). The weak theory of implication. In: A. Menne, A. Wilhemy & H. Angsil
(Eds.), Kontrolliertes Denken. Untersuchungen zum Logikkalkül und zur Logik der Einzelwis-
senschaften (pp. 22–37). Karl Alber, München. (abstract: JSL, 16, 1951, p. 239).
13. da Costa, N. C. (1963). Calculs propositionnels pour les systèmes formels inconsistants.
Comptes rendus de l’Académie des sciences de Paris, 259, 3790–3792.
14. Dunn, J. M. (1976). Intuitive semantics for first-degree entailments and ‘coupled trees’. Philo-
sophical Studies, 29(3), 149–168.
15. Ertola, R., Esteva, F., Flaminio, T., Godo, L., & Noguera, C. (2015). Paraconsistency properties
in degree-preserving fuzzy logics. Soft Computing, 19(3), 531–546.
16. Goodman, N. D. (1981). The logic of contradiction. Mathematical Logic Quarterly, 27(8–10),
119–126. doi:10.1002/malq.19810270803.
17. Jaśkowski, S. (1969). Propositional calculus for contradictory deductive systems. Studia Log-
ica, 24, 243–257.
18. Mccall, S. (1966). Connexive implication. The Journal of Symbolic Logic, 31, 415–433. doi:10.
2307/2270458. http://journals.cambridge.org/article_S0022481200066822.
19. Meheus, J. (2000). An extremely rich paraconsistent logic and the adaptive logic based on it.
In [7] (pp. 189–201).
20. Priest, G. (1979). The logic of paradox. Journal of Philosophical Logic, 8, 219–241.
21. Priest, G. (1991). Minimally inconsistent LP. Studia Logica, 50, 321–331.
22. Priest, G. (2006). In contradiction. A study of the transconsistent (2nd ed.). Oxford: Oxford
University Press. (first edition 1987).
23. Priest, G., & Routley, R. (1989). Systems of paraconsistent logic. In F. Priest, R. Routley, &
J. Norman (Eds.), Paraconsistent logic: Essays on the inconsistent (pp. 142–155). Munich:
Philosophia Verlag.
24. Urbaniak, R., & Siniło, P. (2014). The inapplicability of (selected) paraconsistent logics. Jour-
nal of Applied Non-Classical Logics, 24(4), 368–383.
25. Verdée, P. (2009). Adaptive logics using the minimal abnormality strategy are 11 -complex.
Synthese, 167, 93–104.
26. Zadeh, L. (1965). Fuzzy sets. Information. Control, 8, 338–353.
Adaptive Proofs for Networks
of Partial Structures
As is well known, some axiomatic theories remain in use despite the observation
of classical inconsistencies. Axiomatic theories of truth and naive set theory are
prominent examples. Furthermore, there are well established axiomatic theories in
the natural sciences that are not fully consistent with the empirical data or not con-
sistent with certain other well established theories. The postulates of Bohr’s atomic
theory, for example, are not consistent with the set of Maxwell equations. Moreover,
we have internally inconsistent theories in the natural sciences, such as classical
electrodynamics.1 When scientists observe such inconsistencies, they do not always
abandon the scientific theory in question.
How do we reason with such inconsistent theories? Various logics and inference
systems have been devised to answer this question. The present approach builds upon
H. Andreas (B)
University of British Columbia, Kelowna, Canada
e-mail: [email protected]
P. Verdée
Université catholique de Louvain, Louvain-la-Neuve, Belgium
e-mail: [email protected]
2 The term consolidation is borrowed from belief revision theory (see, e.g., [9].).
3 Cf.[17]. For a critical discussion of this doctrine, see H. Wansing et al.: On the methodology of
paraconsistent logic (this volume).
4 See [6] for a related strategy of dealing with inconsistencies.
5 See [8, Chap. 2] for a detailed exposition of this inconsistency.
Adaptive Proofs for Networks of Partial Structures 19
We shall use partial structures to represent the semantics of the instances of universal
axioms. This notion is adopted from the framework of partial structures and partial
6 Thispart is based on [1], which develops the network formalism as a paraconsistent semantics of
theoretical terms.
20 H. Andreas and P. Verdée
A = A, Rk k∈K ,
where A is the domain of interpretation, Rk are partial relations, and K an index set.
A thus encodes a partial interpretation of some language L. Partiality of an n-ary
relation Rk is to be understood as follows. Suppose we have an n-tuple a1 , . . . , an
(where a1 , . . . , an ∈ A) such that a1 , . . . , an ∈
/ Rk . On the semantics of partial truth,
this does not imply that Rk (a1 , . . . , an ) is false.
Partiality of a relation is more precisely accounted for by distinguishing between
the positive extension Rk+ , the negative extension Rk− , and the “neutral” extension
Rk0 . For simplicity, we assume that Rk+ = Rk and Rk− = ∅. On these two assumptions,
there is no need to notationally distinguish between the positive, the negative, and
the neutral extension of a relation symbol Rk in a partial structure. This has the
consequence that Rk (a1 , . . . , an ) being false is not expressible by a partial structure.
Extensions of partial structures are understood in the standard way:
Definition 1 (Extension) Let A = A, Rk k∈K be a partial structure. Let (Rk )A denote
the relation Rk of the partial structure A. A structure B = A, Rk k∈K of L is an
extension of A iff for all k ∈ K, (Rk )A ⊆ (Rk )B .
Da Costa and French [7] also consider structures with two domains of interpreta-
tion, where one domain contains observable and the other unobservable entities.
Such distinctions between different domains of interpretation can easily be intro-
duced without requiring substantial modifications of the subsequent definitions and
explanations.
7 Unlike a simple pragmatic structure in [7], a partial structure does not contain a set P of sentences
that are taken to be true in the correspondence sense.
Adaptive Proofs for Networks of Partial Structures 21
of gravitation is given by a pair of bodies, both of which have a distinct place in space.
Such semantic counterparts of the instances of universal axioms can be represented
by set-theoretic structures, as has been shown in the work of the structuralist school
[2, 15]. We adopt this idea and shall assume that any instance of a universal axiom
has a corresponding partial structure
A = A1 , A2 , Rk k∈K ,
The core idea of the networks formalism may be described in terms of a modu-
lar semantics. Such a semantics is obtained by two operations upon the standard
semantics: (i) the descriptive vocabulary V of the axiomatic theory T is divided into
subvocabularies according to the axioms of T , and (ii) these subvocabularies in turn
are interpreted by partial structures that represent applications of the correspond-
ing axiom. Let α1 , . . . , αn be the axioms of T with corresponding subvocabularies
V (α1 ), . . . , V (αn ). The partial structure Ai,j represents the application j of the axiom
αi . We assume that there can only be countably many partial structures, a constraint
that should be acceptable since in a finitary language there can only be countably
many instances of a universal axiom. This being said, we can graphically illustrate
the basic idea of a modular semantics for axiomatic theories as follows:
22 H. Andreas and P. Verdée
Let us now go further into the details of a modular semantics for axiomatic theories.
Each axiom has a set of applications to empirical or abstract systems of entities. Each
application of an axiom is represented by a partial structure Ai,j , where i indicates
the axiom αi and j the particular application of that axiom:
Ai,j = Aj , Am , R1 , . . . , Rk .
The second domain Am is introduced for properties that are expressed by mathemat-
ical objects. This domain is optional.
The structuralists describe the result of applying an axiom α to a system of entities
in terms of constraints upon the (model-theoretic) extensions of a given intended
application, i.e., a partial structure.8 We adopt this idea by defining a set of “local
worlds” of an application:
8 Partial structures are used here as a generalization of intended applications. An intended application
[219]
[228]
“Effert uxores Fabius, Christilla maritos,
Funereamque toris quassat uterque facem.
Victores committe, Venus, quos iste manebit
Exitus, una duos ut Libitina ferat.”
THE
ARCHÆOLOGY OF ROME,
BY
JOHN HENRY PARKER, C.B.
Hon. M.A. Oxon., F.S.A. Lond.;
PART VII.
OXFORD:
JAMES PARKER AND CO.
LONDON:
JOHN MURRAY, ALBEMARLE-STREET.
1876.
*** END OF THE PROJECT GUTENBERG EBOOK THE ARCHÆOLOGY
OF ROME, PART 7 ***
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
textbookfull.com