Although logical consistency is desirable in scientific research, standard statistical hypothesis tests are typically logically inconsistent. To address this issue, previous work introduced agnostic hypothesis tests and proved that they can be logically consistent while retaining statistical optimality properties. This article characterizes the credal modalities in agnostic hypothesis tests and uses the hexagon of oppositions to explain the logical relations between these modalities. Geometric solids that are composed of hexagons of oppositions illustrate the conditions for these modalities (...) to be logically consistent. Prisms composed of hexagons of oppositions show how the credal modalities obtained from two agnostic tests vary according to their threshold values. Nested hexagons of oppositions summarize logical relations between the credal modalities in these tests and prove new relations. (shrink)

Simultaneous hypothesis tests can fail to provide results that meet logical requirements. For example, if A and B are two statements such that A implies B, there exist tests that, based on the same data, reject B but not A. Such outcomes are generally inconvenient to statisticians (who want to communicate the results to practitioners in a simple fashion) and non-statisticians (confused by conflicting pieces of information). Based on this inconvenience, one might want to use tests that satisfy (...) class='Hi'>logical requirements. However, Izbicki and Esteves shows that the only tests that are in accordance with three logical requirements (monotonicity, invertibility and consonance) are trivial tests based on point estimation, which generally lack statistical optimality. As a possible solution to this dilemma, this paper adapts the above logical requirements to agnostic tests, in which one can accept, reject or remain agnostic with respect to a given hypothesis. Each of the logical requirements is characterized in terms of a Bayesian decision theoretic perspective. Contrary to the results obtained for regular hypothesis tests, there exist agnostic tests that satisfy all logical requirements and also perform well statistically. In particular, agnostic tests that fulfill all logical requirements are characterized as region estimator-based tests. Examples of such tests are provided. (shrink)

In this paper I present a new way of understanding Dutch Book Arguments: the idea is that an agent is shown to be incoherent iff he would accept as fair a set of bets that would result in a loss under any interpretation of the claims involved. This draws on a standard definition of logical inconsistency. On this new understanding, the Dutch Book Arguments for the probability axioms go through, but the Dutch Book Argument for Reflection fails. The question (...) of whether we have a Dutch Book Argument for Conditionalization is left open. (shrink)

Moral conflicts are real, and while a deontic logic containing a modified "agglomeration rule" may be able to accommodate this fact, even the most sophisticated logic will still overlook much of what everyday normative reasoning involves.

The Swiss psychologist Jean Piaget contends that children below the age of 12 see no necessity for the logical law of non-contradiction. I argue this view is problematic. First of all, Piaget's dialogues with children which are considered supportive of this position are not clearly so. Secondly, Piaget underestimates the necessary nature of following the logical law of non-contradiction in everyday discourse. The mere possibility of saying something significant and informative at all presupposes that the law of non-contradiction (...) is enforced. (shrink)

Review of the book "Paraconsistent Logic: Consistency, Contradiction, and Negation by Water Carnielli and Marcelo Coniglio.

A fundamental question asked in modal logic is whether a given theory is consistent. But consistent with what? A typical way to address this question identifies a choice of background knowledge axioms (say, S4, D, etc.) and then shows the assumptions codified by the theory in question to be consistent with those background axioms. But determining the specific choice and division of background axioms is, at least sometimes, little more than tradition. This paper introduces generic theories for propositional modal logic (...) to address consistency results in a more robust way. As building blocks for background knowledge, generic theories provide a standard for categorical determinations of consistency. We argue that the results and methods of this paper help to elucidate problems in epistemology and enjoy sufficient scope and power to have purchase on problems bearing on modalities in judgement, inference, and decision making. (shrink)

Imperatives cannot be true or false, so they are shunned by logicians. And yet imperatives can be combined by logical connectives: "kiss me and hug me" is the conjunction of "kiss me" with "hug me". This example may suggest that declarative and imperative logic are isomorphic: just as the conjunction of two declaratives is true exactly if both conjuncts are true, the conjunction of two imperatives is satisfied exactly if both conjuncts are satisfied—what more is there to say? Much (...) more, I argue. "If you love me, kiss me", a conditional imperative, mixes a declarative antecedent ("you love me") with an imperative consequent ("kiss me"); it is satisfied if you love and kiss me, violated if you love but don't kiss me, and avoided if you don't love me. So we need a logic of three -valued imperatives which mixes declaratives with imperatives. I develop such a logic. (shrink)

In this paper, I set out some basic elements of a deontic logic with an implementation appropriate for handling conflicting legal obligations for purposes of programming autonomous machine agents. Kantian justice demands that the prescriptive system of enforceable public laws be consistent, yet statutes or case holdings may often describe legal obligations that contradict; moreover, even fundamental constitutional rights may come into conflict. I argue that a deontic logic of the law should not try to work around such conflicts but, (...) instead, identify and expose them so that the rights and duties that generate inconsistencies in public law can be explicitly qualified and the conflicts resolved. I then argue that a credulous, non-monotonic deontic logic can describe inconsistent legal obligations while meeting Kant’s demand for consistency in the prescriptive system of public law. Finally, I propose an implementation of this logic via a modified form of “answer set programming,” which I demonstrate with some simple examples. (shrink)

We present a philosophical motivation for the logics of formal inconsistency, a family of paraconsistent logics whose distinctive feature is that of having resources for expressing the notion of consistency within the object language. We shall defend the view according to which logics of formal inconsistency are theories of logical consequence of normative and epistemic character. This approach not only allows us to make inferences in the presence of contradictions, but offers a philosophically acceptable account of paraconsistency.

“Trends in Logic XVI: Consistency, Contradiction, Paraconsistency, and Reasoning - 40 years of CLE” is being organized by the Centre for Logic, Epistemology and the History of Science at the State University of Campinas (CLEUnicamp) from September 12th to 15th, 2016, with the auspices of the Brazilian Logic Society, Studia Logica and the Polish Academy of Sciences. The conference is intended to celebrate the 40th anniversary of CLE, and is centered around the areas of logic, epistemology, philosophy and history (...) of science, while bringing together scholars in the fields of philosophy, logic, mathematics, computer science and other disciplines who have contributed significantly to what Studia Logica is today and to what CLE has achieved in its four decades of existence. It intends to celebrate CLE’s strong influence in Brazil and Latin America and the tradition of investigating formal methods inspired by, and devoted to, philosophical views, as well as philosophical problems approached by means of formal methods. The title of the event commemorates one of the three main areas of CLE, what has been called the “Brazilian school of paraconsistency”, combining such a pluralist view about logic and reasoning. (shrink)

In this review I briefly analyse the main elements of each chapter of the book centred in the general areas of logic, epistemology, philosophy and history of science. Most of them are developed around a fine-grained investigation on the principle of non-contradiction and the concept of consistency, inquired mainly into the broad area of paraconsistent logics. The book itself is the result of a work that was initiated on the Studia Logica conference "Trends in Logic XVI: Consistency, Contradiction, (...) Paraconsistency and Reasoning - 40 years of CLE", held at the State University of Campinas (Unicamp), Brazil, between September 12-15, 2016. (shrink)

(...) However, whether we chose a weak or strong approximation, the set would not make any sense at all, if (once more) this choice would not be justified in either temporal or spatial sense or given the context of possible applicability of the set in different circumstances. This would obviously represent a dualism in itself as we would (for instance) posit and apply a full identity-equality-equivalence of x and y when applying Newtonian physics to certain observations we make (it would (...) be the case of neural correlates), and we would posit and apply a non - identity-equality-equivalence of x and y when applying Quantum mechanics to other observations. Following this dualism in and of theories, the same sate would need to be slightly modified: U2:(x~y)∪(x≈y); U3:(x~y)∩(x≈y); U4a:(x~y)⊆(x≈y) vs. U4b:(x~y)⊇(x≈y). (shrink)

A rational man’s beliefs are not logically consistent, and he does not believe all the logical consequences of his beliefs. This is because in any situational context, we only accept certain believed sentences. Within that context, we insist that sentences be logically consistent, and we accept the logical consequences of the other sentences we accept in that context. But such sentences do not have to be consistent with sentences we accept in other contexts, nor will we always accept (...) in that context the logical consequences of sentences that we accept in other contexts. We go through many different situational contexts in the course of a day. For example, in trying to start a car with a dead battery, explaining why the car won’t start may form one context, while explaining how to start it may form a different context; sentences we accept in the first context may be logically inconsistent with sentences we accept in the second. (shrink)

Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have (...) been expanded by the development of sophisticated methods to study the properties of such systems using proof and model theory. In parallel with this evolution of logical formalisms as tools for articulating mathematical theories (broadly speaking), much progress has been made in the quest for a mechanization of logical inference and the investigation of its theoretical limits, culminating recently in the development of new foundational frameworks for mathematics with sophisticated computer-assisted proof systems. In addition, logical formalisms developed by logicians in mathematical and philosophical contexts have proved immensely useful in describing theories and systems of interest to computer scientists, and to some degree, vice versa. Three examples of the influence of logic in computer science are automated reasoning, computer verification, and type systems for programming languages. (shrink)

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency (...) operator ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

NOTE TO THE READER - December, 2021 ●●●●● -/- After a long period of time devoted to research in other areas, the author returned to the subject of this paper in a book-length study, CRITIQUE OF IMPURE REASON: Horizons of Possibility and Meaning. In this book (Chapter 11, “The Metalogic of Meaning”), the position developed in the 1982 paper, "Referential Consistency as a Criterion of Meaning", has been substantively revised and several important corrections made. It is recommended that readers (...) read the revised and corrected version that appears in the book, CRITIQUE OF IMPURE REASON. ●●●●● -/- The book is available in a printed edition, ISBN 978-0-578-88646-6, from online booksellers such as Barnes & Noble, Amazon, and through independent bookstores. The book is also available as a freely downloadable _corrected second edition_ eBook, DOI: 10.5281/zenodo.5458352, through PhilSci, PhilPapers, HAL, and other online archives. ●●●●● -/- In addition to the above-mentioned book, readers may find "A Primer on Bartlett's CRITIQUE OF IMPURE REASON" to be useful as a guide to the nearly 900-page CRITIQUE. The primer is available as a free download through PhilPapers. ●●●●● -/- "Referential Consistency as a Criterion of Meaning" describes a logically compelling criterion of meaning — that is, a necessary condition of meaning, one which is non-arbitrary and compelling. One cannot _not_ accept the proposed criterion without self-referential inconsistency. This “metalogical” variety of self-referential inconsistency is new, opening a third category beyond semantical and pragmatical forms of self-referential inconsistency. ●●●●● -/- It is argued that such a criterion of meaning can serve as an instrument of internal criticism for any theoretical framework that permits reference to a class of objects. The paper combines the concern of the logical empiricists to formulate a rigorous meaning criterion, with the analytical interest in identifying and eliminating self-defeating statements through an analysis of the referential structure of theories. ●●●●● -/- The paper is followed by a list of other publications by the author that further develop and extend the ideas presented here. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural dual (...) of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

In this paper, I examine Quine's views on the epistemology of logic. According to Quine's influential holistic account, logic is central in the “web of belief” that comprises our overall theory of the world. Because of this, revisions to logic would have devastating systematic consequences, and this explains why we are loath to make such revisions. In section1, I clarify this idea and thereby show that Quine actually takes the web of belief to have asymmetrical internal structure. This raises two (...) puzzles. First, as I show in section 2, Quine's mature thoroughly naturalized view has it that logic is simply obvious, and this is explains why we do not typically consider revising it. While Quine presents this naturalized view as a way to make good on his earlier metaphor of centrality in a web of belief, I argue that the resources of Quine's naturalized epistemology cannot adequately explain why we are reluctant to revise logic. And, Quine seems to recognize this point himself. In light of this, I explain in section 3 how Quine can allow that our overall scientific theory has systematic structure in a way that is consistent with his naturalistic strictures. Second, the asymmetrical internal structure of the web of belief seems to be inconsistent with its being a holistic web at all. I defuse this problem in section 4 by showing how Quine distinguishes between structural and confirmational considerations. I close by using this distinction to show how Quine's view can evade Michael Friedman’s criticisms, and allow for important methodological distinctions between areas of the web of belief. (shrink)

As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell’s Paradox being derivable in it.This system is, except for minor differ...

This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? Once the question has been properly formulated, the answer turns out to be about as elegant as one could want: Adding a theory of truth to a finitely axiomatized theory T is more or less equivalent to (...) a kind of abstract consistency statement. A large part of the interest of the paper lies in the way syntactic theories are 'disentangled' from object theories. (shrink)

We explore the view that Frege's puzzle is a source of straightforward counterexamples to Leibniz's law. Taking this seriously requires us to revise the classical logic of quantifiers and identity; we work out the options, in the context of higher-order logic. The logics we arrive at provide the resources for a straightforward semantics of attitude reports that is consistent with the Millian thesis that the meaning of a name is just the thing it stands for. We provide models to show (...) that some of these logics are non-degenerate. (shrink)

An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages (...) containing the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles of propositional logic; 4. (...) Stoic modal logic; 5. Stoic theory of arguments: two premisses requirement; validity and soundness; 6. Stoic syllogistic or theory of formally valid arguments: a reconstruction of the Stoic deductive system, which consisted of accounts of five types of indemonstrable syllogisms, which function as nullary argumental rules that identify indemonstrables or axioms of the system, and four deductive rules (themata) by which certain complex arguments can be reduced to indemonstrables and thus shown to be formally valid themselves; 7. arguments that were considered as non-syllogistically valid (subsyllogistic and unmethodically concluding arguments). Their validity was explained by recourse to formally valid arguments. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

The paper provides an argument for the thesis that an agent’s degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem. The latter says that an agent’s belief set is and will always be consistent and deductively closed iff her degrees of entrenchment satisfy the ranking axioms and are updated according to the ranktheoretic update rules.

The doctrine of the Trinity is central to mainstream Christianity. But insofar as it posits “three persons” (Father, Son and Holy Spirit), who are “one God,” it appears as inconsistent as the claim that 1+1+1=1. -/- Much of the literature on “The Logical Problem of the Trinity,” as this has been called, attacks or defends Trinitarianism with little regard to the fourth century theological controversies and the late Hellenistic and early Medieval philosophical background in which it took shape. I (...) argue that this methodol- ogy, which I call “the Puzzle Approach,” produces obviously invalid arguments, and it is unclear how to repair it without collapsing into my preferred method- ology, “the Historical Approach,” which sees history as essential to the debate. I also discuss “mysterianism,” arguing that, successful or not, it has a different goal from the other approaches. I further argue that any solution from the His- torical Approach satisfies the concerns of the Puzzle Approach and mysterianism anyway. -/- I then examine the solution to the Logical Problem of the Trinity found in St. Gregory of Nyssa’s writings, both due to his place in the history of the doctrine, and his clarity in explicating what I call “the metaphysics of synergy.” I recast his solution in standard predicate logic and provide a formal proof of its consistency. I end by considering the possibilities for attacking the broader philosophical context of his defense and conclude that the prospects for doing so are dim. In any case, if there should turn out to be any problem with the doctrine of the Trinity at all, it will not be one of mere logical inconsistency in saying that “These Three are One.”. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved (...) and either its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

We present an abstract model of rationality that focuses on structural properties of attitudes. Rationality requires coherence between your attitudes, such as your beliefs, values, and intentions. We define three 'logical' conditions on attitudes: consistency, completeness, and closedness. They parallel the familiar logical conditions on beliefs, but contrast with standard rationality conditions like preference transitivity. We establish a formal correspondence between our logical conditions and standard rationality conditions. Addressing John Broome's programme 'rationality through reasoning', we formally (...) characterize how you can (not) become more logical by reasoning. Our analysis connects rationality with logic, and enables logical talk about multi-attitude psychology. (shrink)

The consistent histories reformulation of quantum mechanics was developed by Robert Griffiths, given a formal logical systematization by Roland Omn\`{e}s, and under the label `decoherent histories', was independently developed by Murray Gell-Mann and James Hartle and extended to quantum cosmology. Criticisms of CH involve issues of meaning, truth, objectivity, and coherence, a mixture of philosophy and physics. We will briefly consider the original formulation of CH and some basic objections. The reply to these objections, like the objections themselves, involves (...) a mixture of physics and philosophy. These replies support an evaluation of the CH formulation as a replacement for the measurement, or orthodox, interpretation. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth‐conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the ‘logicality of language’, accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter‐examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is ‘blind’ to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non‐classical—indeed quite exotic—kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis‐á‐vis its open class terms and employs a deductive system that is basically classical. (shrink)

This paper briefly outlines some advancements in paraconsistent logics for modelling knowledge representation and reasoning. Emphasis is given on the so-called Logics of Formal Inconsistency (LFIs), a class of paraconsistent logics that formally internalize the very concept(s) of consistency and inconsistency. A couple of specialized systems based on the LFIs will be reviewed, including belief revision and probabilistic reasoning. Potential applications of those systems in the AI area of KRR are tackled by illustrating some examples that emphasizes the importance (...) of a fine-tuned treatment of consistency in modelling reputation systems, preferences, argumentation, and evidence. (shrink)

The categoricity problem for a system of logic reveals an asymmetry between the model-theoretic and the proof-theoretic resources of that logic. In particular, it reveals prima facie that the proof-theoretic instruments are insufficient for matching the envisaged model-theory, when the latter is already available. Among the proposed solutions for solving this problem, some make use of new proof-theoretic instruments, some others introduce new model-theoretic constrains on the proof-systems, while others try to use instruments from both sides. On the proof-theoretical side, (...) two main approaches for solving the categoricity problem for propositional classical logic consist in the enforcement of the formal systems of this logic by introducing rules of inference of a new kind. A multiple-conclusions logic allows rules of inference with more than one conclusion, while a bilateralist system contains rules of inference formulated in terms of assertion and rejection. Both these approaches reveal interesting formal features of logical reasoning. This paper analyses some of the advantages and limitations of these two approaches as solutions for a full formalization of logic, i.e., for a categorical formalization. (shrink)

Logical pluralism is the view that there is more than one correct logic. A key objection to logical pluralism is that it collapses into monism. The core of the Collapse Objection is that only the pluralist’s strongest logic does any genuine normative work; since a logic must do genuine normative work, this means that the pluralist is really a monist, who is committed to her strongest logic being the one true logic. This paper considers a neglected question in (...) the collapse debate: what is it for a logic to do genuine normative work? As well as having wider upshot for the connection between logic and normativity, grappling with this question provides a new response to the Collapse Objection on behalf of the pluralist. I suggest that we should allow logics to generate pro tanto reasons in a way that bears not just on combinations of attitudes but on how an agent’s attitudes are based on one another. This motivates adopting normative principles that allow the pluralist’s weaker logics to earn their normative keep. Rather than being ad hoc, these principles capture a sense in which good reasoning goes beyond the consistency of an agent’s attitudes. Good reasoning is also concerned with how an agent’s attitudes are based on one another. (shrink)

This paper aims to achieve a better understanding of what Socrates means by “sumfvne›n” in the sections of the Phaedo in which he uses the word, and how its use contributes both to the articulation of the hypothetical method and the proof of the soul’s immortality. Section I sets out the well-known problems for the most obvious readings of the relation, while Sections II and III argue against two remedies for these problems, the first an interpretation of what the sumfvne› (...) n relation consists in, the second an interpretation of what sorts of thing the relation is meant to relate. My positive account in Section IV argues that we should take the musical connotations of the term seriously, and that Plato was thinking of a robust analogy between the way pitches form unities when related by certain intervals, and the way theoretical claims form unities when related by explanatory co-dependence. Section V surveys the work of IV from the point of view of the initial difficulties and suggests further consequences for the hypothetical method, including the logical relation between the sumfvne›n and diafvne›n relations, and the need for care in ordering the results of a hypothesis. -/- “But anyhow I proceeded in this way: on each occasion hypothesising the lÒgow which I judged to be strongest, I put down as true the things that seem to me to sumfvne›n with it – both about a causal account and any of the other things that are – but those things that did not I put down as false.” (Phaedo 100a3-7). -/- “But if someone clung to the hypothesis itself, you would bid him goodbye and wouldn’t answer him until you had examined its results, whether according to you they sumfvne› or diafvne› with one another.” (Phaedo 101d3-5). (shrink)

The main objective o f this descriptive paper is to present the general notion of translation between logical systems as studied by the GTAL research group, as well as its main results, questions, problems and indagations. Logical systems here are defined in the most general sense, as sets endowed with consequence relations; translations between logical systems are characterized as maps which preserve consequence relations (that is, as continuous functions between those sets). In this sense, logics together with (...) translations form a bicomplete category of which topological spaces with topological continuous functions constitute a full subcategory. We also describe other uses of translations in providing new semantics for non-classical logics and in investigating duality between them. An important subclass of translations, the conservative translations, which strongly preserve consequence relations, is introduced and studied. Some specific new examples of translations involving modal logics, many-valued logics, para- consistent logics, intuitionistic and classical logics are also described. (shrink)

In this paper a propositional logic of viewpoints is presented. The language of this logic consists of the usual modal operatorsL (of necessity) andM (of possibility) as well as of two new operatorsA andR. The intuitive interpretations ofA andR are from all viewpoints and from some viewpoint, respectively. Semantically the language is interpreted by using Kripke models augmented with sets of viewpoints and with a new alternativeness relation for the operatorA. Truth values of formulas are evaluated with respect to a (...) world and a viewpoint. Various axiomatizations of the logic of viewpoints are presented and proved complete. Finally, some applications are given. (shrink)

This paper considers the question of what knowing a logical rule consists in. I defend the view that knowing a logical rule is having propositional knowledge. Many philosophers reject this view and argue for the alternative view that knowing a logical rule is, at least at the fundamental level, having a disposition to infer according to it. To motivate this dispositionalist view, its defenders often appeal to Carroll’s regress argument in ‘What the Tortoise Said to Achilles’. I (...) show that this dispositionalist view, and the regress that supposedly motivates it, operate with the wrong picture of what is involved in knowing a logical rule. In particular I show that it gives us the wrong picture of the relation between knowing a logical rule and actions of inferring according to it, as well as of the way in which knowing a logical rule might be a priori. (shrink)

Does rationality require logical omniscience? Our best formal theories of rationality imply that it does, but our ordinary evaluations of rationality seem to suggest otherwise. This paper aims to resolve the tension by arguing that our ordinary evaluations of rationality are not only consistent with the thesis that rationality requires logical omniscience, but also provide a compelling rationale for accepting this thesis in the first place. This paper also defends an account of apriori justification for logical beliefs (...) that is designed to explain the rational requirement of logical omniscience. On this account, apriori justification for beliefs about logic has its source in logical facts, rather than psychological facts about experience, reasoning, or understanding. This account has important consequences for the epistemic role of experience in the logical domain. In a slogan, the epistemic role of experience in the apriori domain is not a justifying role, but rather an enabling and disabling role. (shrink)

It is well known that systems of action deontic logic emerging from a standard analysis of permission in terms of possibility of doing an action without incurring in a violation of the law are subject to paradoxes. In general, paradoxes are acknowledged as such if we have intuitions telling us that things should be different. The aim of this paper is to introduce a paradox-free deontic action system by (i) identifying the basic intuitions leading to the emergence of the paradoxes (...) and (ii) exploiting these intuitions in order to develop a consistent deontic framework, where it can be shown why some phenomena seem to be paradoxical and why they are not so if interpreted in a correct way. (shrink)

This paper presents four key results. Firstly, it distinguishes between _partial_ and _consistent_ assertion of a sentence, and introduces the concept of an _equivocal_ sentence, which is both partially asserted and partially denied. Secondly, it proposes a novel definition of truth, stating that _a true sentence is one that is consistently asserted_. This definition is immune from the Liar paradox, does not restrict classical logic, and can be applied to declarative sentences in the language used by any particular person. Thirdly, (...) the paper introduces an epistemic model of language, known as _assertional language_, which is used to formalize the definition of truth. Finally, it provides an argument for the falsity of so-called Liar sentences. The paper also discusses Tarski's solution to the Liar paradox and argues for the abandonment of the Tarski Scheme: _'p' is true if and only if p_, in the context of everyday language. The proposed definition of truth can be viewed as a formal account of the correspondence theory. The epistemic model is a powerful concept on its own that allows for combining different languages in a meaningful way. This model is uniquely capable of reflecting on epistemic inconsistencies, such as logical paradoxes, in a consistent manner. (shrink)

Hyperlogic is a hyperintensional system designed to regiment metalogical claims (e.g., “Intuitionistic logic is correct” or “The law of excluded middle holds”) into the object language, including within embedded environments such as attitude reports and counterfactuals. This paper is the first of a two-part series exploring the logic of hyperlogic. This part presents a minimal logic of hyperlogic and proves its completeness. It consists of two interdefined axiomatic systems: one for classical consequence (truth preservation under a classical interpretation of the (...) connectives) and one for “universal” consequence (truth preservation under any interpretation). The sequel to this paper explores stronger logics that are sound and complete over various restricted classes of models as well as languages with hyperintensional operators. (shrink)

We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social choice theory and judgment aggregation show. The proposed logics for modelling collective attitudes are based on a substructural propositional logic that allows for circumventing inconsistent outcomes. Individual and collective propositional attitudes, such as beliefs, desires, obligations, are then modelled by means of minimal modalities (...) to ensure a number of basic principles. In this way, a viable consistent modelling of collective attitudes is obtained. (shrink)

Sorensen (1992) has provided two modal-logical schemas to reconstruct the logical structure of two types of destructive thought experiments: the Necessity Refuter and the Possibility Refuter. The schemas consist of five propositions which Sorensen claims but does not prove to be inconsistent.We show that the five propositions, as presented by Sorensen, are not inconsistent, but by adding a premise (and a logical truth), we prove that the resulting sextet of premises is inconsistent. Häggqvist (2009) has provided a (...) different modal-logical schema (Counterfactual Refuter), which is equivalent to four premises, again claimed to be inconsistent. We show that this schema also is not inconsistent, for similar reasons. Again, we add another premise to achieve inconsistency. The conclusion is that all three modal-logical reconstructions of the arguments that accompany thought experiments, two by Sorensen and one by Häggqvist, have now been made rigorously correct. This may inaugurate new avenues to respond to destructive thought experiments. (shrink)

This piece explores the meaning of the following quote from Charles Peirce (1902), ". . . the main reason logic is unsettled is that thirteen different opinions are current as to the true aim of the science. Now this is not a logical difficulty, but an ethical difficulty; for ethics is the science of aims. Secondly, it is true that ethics has been, and always must be, a theatre of discussion for the reason that its study consists in the (...) gradual development of a distinct recognition of a satisfactory aim. It is a science of subtleties, no doubt; but it is not logic, but the development of the ideal, which really creates and resolves the problems of ethics.". (shrink)

Future Logic is an original, and wide-ranging treatise of formal logic. It deals with deduction and induction, of categorical and conditional propositions, involving the natural, temporal, extensional, and logical modalities. Traditional and Modern logic have covered in detail only formal deduction from actual categoricals, or from logical conditionals (conjunctives, hypotheticals, and disjunctives). Deduction from modal categoricals has also been considered, though very vaguely and roughly; whereas deduction from natural, temporal and extensional forms of conditioning has been all but (...) totally ignored. As for induction, apart from the elucidation of adductive processes (the scientific method), almost no formal work has been done. This is the first work ever to strictly formalize the inductive processes of generalization and particularization, through the novel methods of factorial analysis, factor selection and formula revision. This is the first work ever to develop a formal logic of the natural, temporal and extensional types of conditioning (as distinct from logical conditioning), including their production from modal categorical premises. Future Logic contains a great many other new discoveries, organized into a unified, consistent and empirical system, with precise definitions of the various categories and types of modality (including logical modality), and full awareness of the epistemological and ontological issues involved. Though strictly formal, it uses ordinary language, wherever symbols can be avoided. Among its other contributions: a full list of the valid modal syllogisms (which is more restrictive than previous lists); the main formalities of the logic of change (which introduces a dynamic instead of merely static approach to classification); the first formal definitions of the modal types of causality; a new theory of class logic, free of the Russell Paradox; as well as a critical review of modern metalogic. But it is impossible to list briefly all the innovations in logical science — and therefore, epistemology and ontology — this book presents; it has to be read for its scope to be appreciated. (shrink)

The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part of a (...) larger work on causal logic, which additionally treats volition and allied cause-effect relations (2004). The Logic of Causation deals with the main technicalities relating to reasoning about causation. Once all the deductive characteristics of causation in all its forms have been treated, and we have gained an understanding as to how it is induced, we are able to discuss more intelligently its epistemological and ontological status. In this context, past theories of causation are reviewed and evaluated (although some of the issues involved here can only be fully dealt with in a larger perspective, taking volition and other aspects of causality into consideration, as done in Volition and Allied Causal Concepts). Phase I: Macroanalysis. Starting with the paradigm of causation, its most obvious and strongest form, we can by abstraction of its defining components distinguish four genera of causation, or generic determinations, namely: complete, partial, necessary and contingent causation. When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation, or specific determinations, remain conceivable. The concept of causation thus gives rise to a number of positive and negative propositional forms, which can be studied in detail with relative ease because they are compounds of conjunctive and conditional propositions whose properties are already well known to logicians. The logical relations (oppositions) between the various determinations (and their negations) are investigated, as well as their respective implications (eductions). Thereafter, their interactions (in syllogistic reasoning) are treated in the most rigorous manner. The main question we try to answer here is: is (or when is) the cause of a cause of something itself a cause of that thing, and if so to what degree? The figures and moods of positive causative syllogism are listed exhaustively; and the resulting arguments validated or invalidated, as the case may be. In this context, a general and sure method of evaluation called ‘matricial analysis’ (macroanalysis) is introduced. Because this (initial) method is cumbersome, it is used as little as possible – the remaining cases being evaluated by means of reduction. Phase II: Microanalysis. Seeing various difficulties encountered in the first phase, and the fact that some issues were left unresolved in it, a more precise method is developed in the second phase, capable of systematically answering most outstanding questions. This improved matricial analysis (microanalysis) is based on tabular prediction of all logically conceivable combinations and permutations of conjunctions between two or more items and their negations (grand matrices). Each such possible combination is called a ‘modus’ and is assigned a permanent number within the framework concerned (for 2, 3, or more items). This allows us to identify each distinct (causative or other, positive or negative) propositional form with a number of alternative moduses. This technique greatly facilitates all work with causative and related forms, allowing us to systematically consider their eductions, oppositions, and syllogistic combinations. In fact, it constitutes a most radical approach not only to causative propositions and their derivatives, but perhaps more importantly to their constituent conditional propositions. Moreover, it is not limited to logical conditioning and causation, but is equally applicable to other modes of modality, including extensional, natural, temporal and spatial conditioning and causation. From the results obtained, we are able to settle with formal certainty most of the historically controversial issues relating to causation. Phase III: Software Assisted Analysis. The approach in the second phase was very ‘manual’ and time consuming; the third phase is intended to ‘mechanize’ much of the work involved by means of spreadsheets (to begin with). This increases reliability of calculations (though no errors were found, in fact) – but also allows for a wider scope. Indeed, we are now able to produce a larger, 4-item grand matrix, and on its basis find the moduses of causative and other forms needed to investigate 4-item syllogism. As well, now each modus can be interpreted with greater precision and causation can be more precisely defined and treated. In this latest phase, the research is brought to a successful finish! Its main ambition, to obtain a complete and reliable listing of all 3-item and 4-item causative syllogisms, being truly fulfilled. This was made technically feasible, in spite of limitations in computer software and hardware, by cutting up problems into smaller pieces. For every mood of the syllogism, it was thus possible to scan for conclusions ‘mechanically’ (using spreadsheets), testing all forms of causative and preventive conclusions. Until now, this job could only be done ‘manually’, and therefore not exhaustively and with certainty. It took over 72’000 pages of spreadsheets to generate the sought for conclusions. This is a historic breakthrough for causal logic and logic in general. Of course, not all conceivable issues are resolved. There is still some work that needs doing, notably with regard to 5-item causative syllogism. But what has been achieved solves the core problem. The method for the resolution of all outstanding issues has definitely now been found and proven. The only obstacle to solving most of them is the amount of labor needed to produce the remaining (less important) tables. As for 5-item syllogism, bigger computer resources are also needed. (shrink)

A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...) means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism in the final analysis. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. Thus the problem which of the two mathematics is more relevant to our being is discussed. An information interpretation of the Schrödinger equation is involved to illustrate the above problem. (shrink)

The Symbolic Logic Study Guide is designed to accompany the widely used symbolic logic textbook Language, Proof and Logic (LPL), by Jon Barwise and John Etchemendy (CSLI Publications 2003). The guide has two parts. The first part contains condensed, essential lecture notes, which streamline and systematize the first fourteen chapters of the book into seven teaching sections, and thus provide a clear, well-designed roadmap for the understanding of the text. The second part consists of twelve sample quizzes and solutions. The (...) Symbolic Logic Study Guide is essential for all instructors and students who use LPL in their symbolic logic classes. (shrink)