I show that it is not possible to uniquely characterize classical logic when working within classical set theory. By building on recent work by Eduardo Barrio, Federico Pailos, and Damian Szmuc, I show that for every inferential level (finite and transfinite), either classical logic is not unique at that level or there exist intuitively valid inferences of that level that are not definable in modern classical set theory. The classical logician is thereby faced (...) with a three-horned dilemma: Give up uniqueness but preserve characterizability, give up characterizability and preserve uniqueness, or (potentially) preserve both but give up modern classical set theory. After proving the main result, I briefly explore this third option by developing an account of classical logic within a paraconsistent set theory. This account of classical logic ensures unique characterizability in some sense, but the non-classical set theory also produces highly non-classical meta-results about classical logic. (shrink)

In their recent article “A Hierarchy of Classical and Paraconsistent Logics”, Eduardo Barrio, Federico Pailos and Damien Szmuc present novel and striking results about meta-inferential validity in various three valued logics. In the process, they have thrown open the door to a hitherto unrecognized domain of non-classical logics with surprising intrinsic properties, as well as subtle and interesting relations to various familiar logics, including classical logic. One such result is that, for each natural number n, there (...) is a logic which agrees with classical logic on tautologies, inferences, meta-inferences, meta-meta-inferences, meta-meta-...-meta-inferences, but that disagrees with classical logic on n + 1-meta-inferences. They suggest that this shows that classical logic can only be characterized by defining its valid inferences at all orders. In this article, I invoke some simple symmetric generalizations of BPS’s results to show that the problem is worse than they suggest, since in fact there are logics that agree with classical logic on inferential validity to all orders but still intuitively differ from it. I then discuss the relevance of these results for truth theory and the classification problem. (shrink)

Classical logic is often characterized through certain laws such as bi-valence and sharpness of concepts, among others. My view is that its most fundamental feature is a commitment to an objective conception of truth, which goes together with a realistic metaphysical view. Truth is objective in that it derives from the nature of reality, and is not dependent on beliefs, theories, practices, and the like. Classical logic is a theory of logical properties, logical truths, and logical (...) states of affairs. (shrink)

In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, (...) paraconsistent and quantum logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages. (shrink)

Connexive logics are based on two ideas: that no statement entails or is entailed by its own negation (this is Aristotle’s thesis) and that no statement entails both something and the negation of this very thing (this is Boethius' thesis). Usually, connexive logics are contra-classical. In this note, I introduce a reading of the connexive theses that makes them compatible with classical logic. According to this reading, the theses in question do not talk about validity alone; rather, (...) they talk in part about (a property related to) the soundness of arguments. (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)

This revised and considerably expanded 2nd edition brings together a wide range of topics, including modal, tense, conditional, intuitionist, many-valued, paraconsistent, relevant, and fuzzy logics. Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, (...) and their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area. (shrink)

Weatherson argues that whoever accepts classical logic, standard mereology and the difference between vague objects and any others, should conclude that there are no vague objects. Barnes and Williams claim that a supporter of vague objects who accepts classical logic and standard mereology should recognize that the existence of vague objects implies indeterminate identity. Even though it is not clearly stated, they all seem to be committed to the assumption that reality is ultimately constituted by mereological (...) atoms. This assumption is not granted by standard mereology which instead remains silent on whether reality is atomic or gunky; therefore, I contend that whoever maintains classical logic, standard mereology and the difference between vague objects and any others, is not forced to conclude with Weatherson that there are no vague objects; nor is she compelled to revise her point of view according to Barnes and Williams’s proposal and to accept that the existence of vague objects implies indeterminate identity. (shrink)

Fractional semantics provides a multi-valued interpretation of a variety of logics, governed by purely proof-theoretic principles. This approach employs a method of systematic decomposition of formulas through a well-disciplined sequent calculus, assigning a fractional value that measures the “quantity of identity” (intuitively, “quantity of truth”) within a sequent. A key consequence of this framework is the breakdown of the traditional symmetry between truth and contradiction. In this paper, we explore the ramifications of this novel perspective on classical logic. (...) Specifically, we (i) introduce an alternative _paraconsistent_ consequence relation, and (ii) show how the gradual character of contradictions induces a corresponding characterization of tautologies, thereby obtaining a full-fledged informational refinement of classical logic. (shrink)

An account of the logic of bivalent languages with truth-value gaps is given. This account is keyed to the use of tables introduced by S. C. Kleene. The account has two guiding ideas. First, that the bivalence property insures that the language satisfies classical logic. Second, that the general concepts of a valid sentence and an inconsistent sentence are, respectively, as sentences which are not false in any model and sentences which are not true in any model. (...) What recommends this approach is (1) its relative simplicity, and (2) the fact that it leaves the fundamental features of classical logic intact. (shrink)

Recently, it has been proposed to understand a logic as containing not only a validity canon for inferences but also a validity canon for metainferences of any finite level. Then, it has been shown that it is possible to construct infinite hierarchies of ‘increasingly classical’ logics—that is, logics that are classical at the level of inferences and of increasingly higher metainferences—all of which admit a transparent truth predicate. In this paper, we extend this line of investigation by (...) taking a somehow different route. We explore logics that are different from classical logic at the level of inferences, but recover some important aspects of classical logic at every metainferential level. We dub such systems meta-classical non-classical logics. We argue that the systems presented deserve to be regarded as logics in their own right and, moreover, are potentially useful for the non-classical logician. (shrink)

We introduce Boolean-like algebras of dimension n ($$n{\mathrm {BA}}$$ n BA s) having n constants $${{{\mathsf {e}}}}_1,\ldots,{{{\mathsf {e}}}}_n$$ e 1, …, e n, and an $$(n+1)$$ ( n + 1 ) -ary operation q (a “generalised if-then-else”) that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of $$n{\mathrm {BA}}$$ n BA s share many remarkable properties with the variety of Boolean algebras and with primal varieties. The $$n{\mathrm {BA}}$$ n BA s provide the (...) algebraic framework for generalising the classical propositional calculus to the case of n–perfectly symmetric–truth-values. Every finite-valued tabular logic can be embedded into such a n-valued propositional logic, $$n{\mathrm {CL}}$$ n CL, and this embedding preserves validity. We define a confluent and terminating first-order rewriting system for deciding validity in $$n{\mathrm {CL}}$$ n CL, and, via the embeddings, in all the finite tabular logics. (shrink)

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in (...) the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad Absurdum, one obtains a proof system for orthologic; by adding both Reiteration and Reductio, one obtains a proof system for classical logic. Arguably neither Reiteration nor Reductio is as intimately related to the meaning of the connectives as the introduction and elimination rules are, so the base logic we identify serves as a more fundamental starting point and common ground between proponents of intuitionistic logic, orthologic, and classical logic. The algebraic semantics for the logic we motivate proof-theoretically is based on bounded lattices equipped with what has been called a weak pseudocomplementation. We show that such lattice expansions are representable using a set together with a reflexive binary relation satisfying a simple first-order condition, which yields an elegant relational semantics for the logic. This builds on our previous study of representations of lattices with negations, which we extend and specialize for several types of negation in addition to weak pseudocomplementation; in an appendix, we further extend this representation to lattices with implications. Finally, we discuss adding to our logic a conditional obeying only introduction and elimination rules, interpreted as a modality using a family of accessibility relations. (shrink)

One of the most fruitful applications of substructural logics stems from their capacity to deal with self-referential paradoxes, especially truth-theoretic paradoxes. Both the structural rules of contraction and the rule of cut play a crucial role in typical paradoxical arguments. In this paper I address a number of difficulties affecting noncontractive approaches to paradox that have been discussed in the recent literature. The situation was roughly this: if you decide to go substructural, the nontransitive approach to truth offers a lot (...) of benefits that are not available in the noncontractive account. I sketch a noncontractive theory of truth that has these benefits. In particular, it has both a proof- and a model-theoretic presentation, it can be extended to a first-order language, and it retains every classically valid inference. (shrink)

We offer a critical overview of two sorts of proof systems that may be said to characterize classical propositional logic indirectly (and non-standardly): refutation systems, which prove sound and complete with respect to classical contradictions, and rejection systems, which prove sound and complete with respect to the larger set of all classical non-tautologies. Systems of the latter sort are especially interesting, as they show that classical propositional logic can be given a paraconsistent characterization. In (...) both cases, we consider Hilbert-style systems as well as Gentzen-style sequent calculi and natural-deduction formalisms. (shrink)

We seek a better understanding of why an inferential semantics devised by Tor Sandqvist yields full classical logic, by providing and analysing a direct proof via a suitable maximality construction.

This paper shows how to conservatively extend theories formulated in non-classical logics such as the Logic of Paradox, the Strong Kleene Logic and relevant logics with Skolem functions. Translations to and from the language extended by Skolem functions into the original one are presented and shown to preserve derivability. It is also shown that one may not always substitute s=f(t) and A(t, s) even though A determines the extension of a function and f is a Skolem function (...) for A. (shrink)

In this paper, we make distinctions between Classical Logic (where the propositions are 100% true, or 100 false) and the Neutrosophic Logic (where one deals with partially true, partially indeterminate and partially false propositions) in order to respond to K. Georgiev’s criticism [1]. We recall that if an axiom is true in a classical logic system, it is not necessarily that the axiom be valid in a modern (fuzzy, intuitionistic fuzzy, neutrosophic etc.) logic system.

The purpose of this paper is to provide a new system of logic for existence and essence, in which the traditional distinctions between essential and accidental properties, abstract and concrete objects, and actually existent and possibly existent objects are described and related in a suitable way. In order to accomplish this task, a primitive relation of essential identity between different objects is introduced and connected to a first order existence property and a first order abstractness property. The basic idea (...) is that possibly existent objects are completely determinate and that essentially identical objects are just different individuations of the same individual essence. Accordingly, essential properties are defined as properties that are invariant with respect to this kind of identity, while abstract objects are determined by being characterized by essential properties only. Once such ideas are implemented, a number of classical intuitions about objects, their essence, and their way of existence can be consistently interpreted. (shrink)

By using the notions of exact truth and exact falsity, one can give 16 distinct definitions of classical consequence. This paper studies the class of relations that results from these definitions in settings that are paracomplete, paraconsistent or both and that are governed by the Strong Kleene schema. Besides familiar logics such as Strong Kleene logic, the Logic of Paradox and First Degree Entailment, the resulting class of all Strong Kleene generalizations of classical logic also (...) contains a host of unfamiliar logics. We first study the members of our class semantically, after which we present a uniform sequent calculus that is sound and complete with respect to all of them. Two further sequent calculi and \ calculus) will be considered, which serve the same purpose and which are obtained by applying general methods to construct sequent calculi for many-valued logics. Rules and proofs in the SK calculus are much simpler and shorter than those of the \ and the \ calculus, which is one of the reasons to prefer the SK calculus over the latter two. Besides favourably comparing the SK calculus to both the \ and the \ calculus, we also hint at its philosophical significance. (shrink)

The liar and kindred paradoxes show that we can derive contradictions when we reason in accordance with classical logic from the schema (T) about truth: S is true iff p, where ‘p’ is to be replaced with a sentence and ‘S’ with a name of that sentence. The paper presents two arguments to the effect that the blame lies not with (T) but with classical logic. The arguments derive contradictions using classical logic, but instead (...) of appealing to (T), they invoke semantic claims that seem even harder to reject. The first argument relies on two standard semantic principles that are not disquotational and on the claim that if there is such a thing as the property of being true, then ‘true’ expresses that property. The second argument relies on a schema about meaning: S means that p, where ‘S’ and ‘p’ are to be replaced as before. (shrink)

We present several alternative classical logic axiomatisations of the Event Calculus, a narrative based formalism for reasoning about actions and change. We indicate the range of applicability and key characteristics of each alternative formulation.

Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this (...) problem is to count formulas as maximal that are the conclusion of reductio and major premise of an elimination rule and to require their removability from deductions. The main part of the paper consists in a proof of a normalisation theorem for bilateral logic. The closing sections address philosophical concerns whether the proof provides a satisfactory solution to the problem at hand and confronts bilateralists with the dilemma that a bilateral notion of stability sits uneasily with the core bilateral thesis. (shrink)

We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to the first-degree entailment fragment of R. Epstein's Relatedness Logic, and that it is a non-transitive logic of the sort investigated by S. Frankowski and others. Furthermore, we provide a semantics and a calculus for this (...) class='Hi'>logic. The semantics is defined in terms of a \-matrix built on top of a 5-valued extension of the 3-element weak Kleene algebra, whereas the calculus is defined in terms of a Gentzen-style sequent system where the left and right negation rules are subject to linguistic constraints. (shrink)

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.

Semantic justifications of the classical rules of logical inference typically make use of a notion of bivalent truth, understood as a property guaranteed to attach to a sentence or its negation regardless of the prospects for speakers to determine it as so doing. For want of a convincing alternative account of classical logic, some philosophers suspicious of such recognition-transcending bivalence have seen no choice but to declare classical deduction unwarranted and settle for a weaker system; intuitionistic (...) logic in particular, buttressed by assertion-conditional semantics, is often considered to enjoy a degree of meaning-theoretical respectability unattainable by classical logic.The decision to forgo the classical inference rules is not always made lightly. Thus, Dummett: " In the resolution of the conflict between [the view that generally accepted classical modes of inference ought to be theoretically accommodated, and the demand that any such accommodation be achieved without recourse to bivalence] lies, as I see it, one of the most fundamental and intractable problems in the theory of meaning; indeed, in all philosophy. "The present article ventures to suggest that the conflict need not be irresoluble. Helping ourselves only to such conceptual resources as are standardly invoked by proponents of intuitionistic logic, we shall formulate a rudimentary meaning theory for a selection of logical constants, define a relation of valid inferability, and prove that the latter includes all of classical first-order logic. The result is essentially that reported in Sandqvist as Theorem 2.20.2. TheoryWe will be considering a standard-syntax first-order language with ⊃, ⊥ and ∀ as its only primitive logical constants. We assume countable supplies of individual constants, individual functors , and predicates , as well as a denumerably infinite set of individual variables. By a basic 1 formula we will mean one that …[Full Text of this Article]. (shrink)

This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying (...) judgement aggregation in logics that are weaker than classical logic, we investigate whether some well-known impossibility results, that were tailored for classical logic, still apply to those weak systems. (shrink)

Western (deductive) logic originated in Greek antiquity. It found its first expression in those works of the great philosopher Aristotle (384–322 BC) which have come to be known as the Organon, i.e., ‘instrument’. Aristotle’s logic, also known as syllogistics, was unsystematically concerned with patterns of reasoning and argumentation. It remained in this rudimentary state relatively unchanged and unchallenged until the second half of the nineteenth century. At that time, logic underwent a period of unprecedented reform and modernization, (...) due in large part to the German mathematician Gottlob Frege (1848– 1925) It thus became more and more a mathematical endeavor of studying the structure and peculiarities of artificial, formal languages. In this new form, logic gave rise in the twentieth century to disciplines such as theoretical informatics and programming languages, and transformed our lives through computation, information processing, and the Internet. A formal language consists, in effect, of a particular alphabet and some precise rules of forming, and transforming, strings over this alphabet. There exist several types of formal languages analyzed in logic. Depending on their structure, they are called first-order languages, second-order languages, and so on. Today a logic is considered a theory of such a language and is, correspondingly, referred to as a first-order logic, a second-order logic, and so on. In this chapter, we shall outline a first-order logic as a paragon of deductive logic. Its full name is: “Classical, first-order predicate logic with identity”. What all these expressions mean exactly, will become clear below. The logic we shall study first is termed classical logic because the idea to create such an instrument, or ‘organon’, is rooted in Greek antiquity. Owing to its origin, it is based on three time-honored Aristotelian doctrines. For these and several other reasons that we shall discuss later in this chapter, it is also called a logic of the Aristotelian style, or an Aristotelian logic for short. (shrink)

This article compares classical (or -like) and nonclassical (or -like) axiomatisations of the fixed-point semantics developed by Kripke (J Philos 72(19): 690–716, 1975). Following the line of investigation of Halbach and Nicolai (J Philos Logic 47(2): 227–257, 2018), we do not compare and qua theories of truth simpliciter, but rather qua axiomatisations of the Kripkean conception of truth. We strengthen the central results of Halbach and Nicolai (2018) and Nicolai (Stud Log 106(1): 101–130, 2018), showing that, on the (...) one hand, there is a stronger sense in which some variants of and some variants of can be taken to be, truth-theoretically, equivalent. On the other hand, we show that this truth-theoretical equivalence is not preserved by some other variants of and, arguing that the variants are more adequate axiomatisations of the fixed-point semantics than the corresponding variants. (shrink)

We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we (...) pinpoint the theorems of Fol that are needed in the proof. Using the insights gained from the proof, we show that there are four binary operators that each can serve as the only undefined logical constant for Fol . Finally, we show that from every n -ary connective that yields a functionally complete singleton set of connectives two Schönfinkel-type operators are definable, and all the latter are so definable. (shrink)

Intentionality is one of the most frequently discussed topics in contemporary phenomenology and analytic philosophy. This book investigates intentionality from the point of view of intentional objects. According to the classical approach to this concept, whatever can be consciously experienced is regarded as an intentional object. Thus, not only ordinary existing individuals but also various kinds of non-existents and non-individuals are considered as intentional. Alexius Meinong, an Austrian philosopher, is particularly well-known as the `inventor' of an abundant ontology of (...) objects among which even incomplete and impossible ones, like `the round square', find their place. Drawing inspirations from Meinong's ideas, the author develops a simple logic of intentional objects, M-logic. M-logic closely resembles classical first-order logic and, as opposed to the formally complicated contemporary theories of non-existent objects, it is much more friendly in apprehending and applications. However, despite this resemblance, the ontological content of M-logic far exceeds that of classical logic. In this book formal investigations are intertwined with philosophical analyses. On the one hand, M-logic is used as a tool for investigating formal features of intentional objects. On the other hand, the study of intentionality phenomena suggests further ways of extending and modifying M-logic. Audience: The book is addressed to logicians, cognitive scientists, philosophers of language and metaphysics with either a phenomenological or an analytic background. (shrink)

A complementary system for a given logic is a proof system whose theorems are exactly the formulas that are not valid according to the logic in question. This article is a contribution to the complementary proof theory of classical propositional logic. In particular, we present a complementary proof-net system, $$\textsf{CPN}$$ CPN, that is sound and complete with respect to the set of all classically invalid (one-side) sequents. We also show that cut elimination in $$\textsf{CPN}$$ CPN enjoys (...) strong normalization along with strong confluence (and, hence, uniqueness of normal forms). (shrink)

In this paper we introduce non-normal modal extensions of the sub-classical logics CLoN, CluN and CLaN, in the same way that S0.5 0 extends classical logic. The first modal system is both paraconsistent and paracomplete, while the second one is paraconsistent and the third is paracomplete. Despite being non-normal, these systems are sound and complete for a suitable Kripke semantics. We also show that these systems are appropriate for interpreting □ as “is provable in classical (...) class='Hi'>logic”. This allows us to recover the theorems of propositional classical logic within three sub-classical modal systems. (shrink)

We describe here a simple method in order to obtain programs from proofs in second-order classical logic. Then we extend to classical logic the results about storage operators proved by Krivine for intuitionistic logic. This work generalizes previous results of Parigot.

Dyadic semantics is a sort of non-truth-functional bivalued semantics introduced in Caleiro et al. Logica Universalis, Birkhäuser, Basel, pp 169–189, 2005). Here we introduce an algorithmic procedure for constructing conservative translations of logics characterised by dyadic semantics into classical propositional logic. The procedure uses fresh propositional variables, which we call hidden variables, to represent the indeterminism of dyadic semantics. An alternative algorithmic procedure for constructing conservative translations of any finite-valued logic into classical logic is also (...) introduced. In this alternative procedure hidden variables are also used, but in this case to represent the degree of true or falsehood of propositions. (shrink)

Classical propositional logic can be characterized, indirectly, by means of a complementary formal system whose theorems are exactly those formulas that are not classical tautologies, i.e., contradictions and truth-functional contingencies. Since a formula is contingent if and only if its negation is also contingent, the system in question is paraconsistent. Hence classical propositional logic itself admits of a paraconsistent characterization, albeit “in the negative”. More generally, any decidable logic with a syntactically incomplete proof theory (...) allows for a paraconsistent characterization of its set of theorems. This, we note, has important bearing on the very nature of paraconsistency as standardly characterized. (shrink)

In the present paper we give the first proof-theoretical example of an embedding of classical logic into a quantum-like logic. This is performed in the framework of basic logic, where a proof-theoretical approach to quantum logic is convenient. We consider basic orthologic, that corresponds to a sequential formulation of paraconsistent quantum logic, and which is given by basic orthologic added with weakening and contraction, in a language with Girard's negation. In the paper we first (...) consider a convenient cut-free calculus for classical logic, in the same language; then, in a language enriched with a new kind of literals, we introduce basic orthologic with a primitive modality, where classical logic is embeddable. Similarly to Girard's negation, our modality is not a connective but conceivable as an operator defined inductively on the set of formulae. This allows us to obtain a calculus which enjoys cut-elimination. (shrink)

In this paper, by suggesting a formal representation of science based on recent advances in logic-based Artificial Intelligence (AI), we show how three serious concerns around the realisation of traditional scientific realism (the theory/observation distinction, over-determination of theories by data, and theory revision) can be overcome such that traditional realism is given a new guise as ‘naturalised’. We contend that such issues can be dealt with (in the context of scientific realism) by developing a formal representation of science based (...) on the application of the following tools from Knowledge Representation: the family of Description Logics, an enrichment of classical logics via defeasible statements, and an application of the preferential interpretation of the approach to Belief Revision. (shrink)

The AGM theory of belief revision provides a formal framework to represent the dynamics of epistemic states. In this framework, the beliefs of the agent are usually represented as logical formulas while the change operations are constrained by rationality postulates. In the original proposal, the logic underlying the reasoning was supposed to be supraclassical, among other properties. In this paper, we present some of the existing work in adapting the AGM theory for non-classical logics and discuss their interconnections (...) and what is still missing for each approach. (shrink)