Mark Balaguer argues for full blooded platonism (FBP), and argues that FBP alone can solve Benacerraf's familiar epistemic challenge. I note that if FBP really can solve Benacerraf's epistemic challenge, then FBP is not alone in its capacity so to solve; RFBP—really full blooded platonism—can do the trick just as well, where RFBP differs from FBP by allowing entities from inconsistent mathematics. I also argue briefly that there is positive reason for endorsing RFBP.

The paper essentially shows that the paraconsistent logicDR satisfies the depth relevance condition. The systemDR is an extension of the systemDK of [7] and the non-triviality of a dialectical set theory based onDR has been shown in [3]. The depth relevance condition is a strengthened relevance condition, taking the form: If DR- AB thenA andB share a variable at the same depth, where the depth of an occurrence of a subformulaB in a formulaA is roughly the number of nested ''s (...) required to reach the occurrence ofB inA. The method of proof is to show that a model structureM consisting of {M 0 , M1, ..., M}, where theM i s are all characterized by Meyer''s 6-valued matrices (c. f, [2]), satisfies the depth relevance condition. Then, it is shown thatM is a model structure for the systemDR. (shrink)

B. H. Slater has argued that there cannot be any truly paraconsistent logics, because it's always more plausible to suppose whatever negation symbol is used in the language is not a real negation, than to accept the paraconsistent reading. In this paper I neither endorse nor dispute Slater's argument concerning negation; instead, my aim is to show that as an argument against paraconsistency, it misses (some of) the target. A important class of paraconsistent logics — the preservationist logics — are (...) not subject to this objection. In addition I show that if we identify logics by means of consequence relations, at least one dialetheic logic can be reinterpreted in preservationist (non-dialetheic) terms. Thus the interest of paraconsistent consequence relations — even those that emerge from dialetheic approaches — does not depend on the tenability of dialetheism. Of course, if dialetheism is defensible, then paraconsistent logic will be required to cope with it. But the existence (and interest) of paraconsistent logics does not depend on a defense of dialetheism. (shrink)

The aim of this paper is two-fold: (1) To contribute to a better knowledge of the method of the Argentinean mathematicians Lia Oubifia and Jorge Bosch to formulate category theory independently of set theory. This method suggests a new ontology of mathematical objects, and has a profound philosophical significance (the underlying logic of the resulting category theory is classical iirst—order predicate calculus with equality). (2) To show in outline how the Oubina-Bosch theory can be modified to give rise to a (...) strong paraconsistent category theory; strong enough to be taken as the basis for a paraconsistent mathematics which encompasses all classical mathematical results. (shrink)

particular alternative logic could be relevant to another one? The most important part of a response to this question is to remind the reader of the fact that independence friendly (IF) logic is not an alternative or “nonclassical” logic. (See here especially Hintikka, “There is only one logic”, forthcoming.) It is not calculated to capture some particular kind of reasoning that cannot be handled in the “classical” logic that should rather be called the received or conventional logic. No particular epithet (...) should be applied to it. IF logic is not an alternative to our generally used basic logic, the received first-order logic, aka quantification theory or predicate calculus. It replaces this basic logic in that it is identical with this “classical” first-order logic except that certain important flaws of the received first-order logic have been corrected. But what are those flaws and how can they be corrected? To answer these questions is to explain the basic ideas of IF logic. Since this logic is not as well known as it should be, such explanation is needed in any case. I will provide three different but not unrelated motivations for IF logic. (shrink)

A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. A tableau (...) system with labels, signs, and suffixes is defined, extending the basic language $\mathscr{L}_{\mathbf{QB}}$ by quasiformulas (to express the denotations of predicates). The proposed logical system is paraconsistent since $\phi \wedge \neg\phi$ does not ``explode'' with arbitrary syntactic consequences. (shrink)

On the ground of Kant’s reformulation of the principle of con- tradiction, a non-classical logic KC and its extension KC+ are constructed. In KC and KC+, \neg(\phi \wedge \neg\phi),  \phi \rightarrow (\neg\phi \rightarrow \phi), and  \phi \vee \neg\phi are not valid due to specific changes in the meaning of connectives and quantifiers, although there is the explosion of derivable consequences from {\phi, ¬\phi} (the deduc- tion theorem lacking). KC and KC+ are interpreted as fragments of an S5-based first-order (...) modal logic M. The quantification in M is combined with a “subject abstraction” device, which excepts predicate letters from the scope of modal operators. Derivability is defined by an appropriate labelled tableau system rules. Informally, KC is mainly ontologically motivated (in contrast, for example, to Jaśkowski’s discussive logic), relativizing state of affairs with respect to conditions such as time. (shrink)

We show how some model-theoretical devices (local reasoning, modes of presentation, an additional accessibility relation) can be combined in first-order modal logic to formalize the consequence relation that includes de dicto and de re contradictory beliefs. Instead of special ``sense objects'', appearances of objects in an agent's belief are introduced and presented as ordered pairs consisting of an object and an individual constant. A non-classical identity relation is applied. A relation S on the set of possible worlds is introduced, which (...) models possible distortions in an agent's picture of a (real) world. The application of such models in deontic logic is illustrated by a characteristic example. , , , , , , , ,. (shrink)

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right (...) set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

This paper argues that Graham Priest’s story Sylvan’s Box has an attractive, consistent reading. Priest’s hope to use that story as an example of a non-trivial “essentially inconsistent” story is thus threatened. The paper then makes some observations about the role Sylvan’s Box might play in a theory of unreliable narrators.

The present paper introduces a belief merging procedure by majority using the standard format of Adaptive Logics. The core structure of the logic ADM c (Adaptive Doxastic Merging by Counting) consists in the formulation of the conflicts arising from the belief bases of the agents involved in the procedure. A strategy is then defined both semantically and proof-theoretically which selects the consistent contents answering to a majority principle. The results obtained are proven to be equivalent to a standard majority operator (...) for bases with partial support. (shrink)

American-plan semantics with 4 values 1, 0, { {1, 0}} {{}}, interpretable as True, False, Both and Neither, are furnished for a range of logics, including relevant affixing systems. The evaluation rules for extensional connectives take a classical form: in particular, those for negation assume the form 1 (A, a) iff 0 (A, a) and 0 (A, a) iff 1 (A, a), so eliminating the star function *, on which much criticism of relevant logic semantics has focussed. The cost of (...) these classical features is a further relation (or operation), required in evaluating falsity assignments of implication formulae.Two styles of 4 valued relational semantics are developed; firstly a semantics using notions of double truth and double validity for basic relevant systemB and some extensions of it; and secondly, since the first semantics makes heavy weather of validating negation principles such as Contraposition, a reduced semantics using more complex implicational rules for relevant systemC and various of its extensions. To deal satisfactorily with elite systemsR,E andT, however, further complication is inevitable; and a relation of mateship (suggested by the Australian plan) is introduced to permit cross-over from 1 to 0 values and vice versa. (shrink)

The goals of this paper are two-fold: I wish to clarify the Aristotelian conception of the law of non-contradiction as a metaphysical rather than a semantic or logical principle, and to defend the truth of the principle in this sense. First I will explain what it in fact means that the law of non-contradiction is a metaphysical principle. The core idea is that the law of non-contradiction is a general principle derived from how things are in the world. For example, (...) there are certain constraints as to what kind of properties an object can have, and especially: some of these properties are mutually exclusive. Given this characterisation, I will advance to examine what kind of challenges the law of non-contradiction faces; the main opponent here is Graham Priest. I will consider these challenges and conclude that they do not threaten the truth of the law of non-contradiction understood as a metaphysical principle. (shrink)

Since its first appearance in 1966, the notion of a supervaluation has been regarded by many as a powerful tool for dealing with semantic gaps. Only recently, however, applications to semantic gluts have also been considered. In previous work I proposed a general framework exploiting the intrinsic gap/glut duality. Here I also examine an alternative account where gaps and gluts are treated on a par: although they reflect opposite situations, the semantic upshot is the same in both cases--the value of (...) some expressions is not uniquely defined. Other strategies for generalizing supervaluations are considered and some comparative facts are discussed. (shrink)