We discuss the interpolation property on some important families of non classical logics, such as intuitionistic, modal, fuzzy, and linear logics. A special paragraph is devoted to a generalization of the interpolation property, uniform interpolation.

This chapter contains sections titled: Introduction Paraconsistent Logic and Latin America Thinking about Logic The Nature of Paraconsistent Logic A History of Paraconsistent Logic Philosophical Aspects of Paraconsistent Logic References Further Reading.

Although the theory of definability had many important antecedents—such as the descriptive set theory initiated by the French semi-intuitionists in the early 1900s—the main ideas were first laid out in precise mathematical terms by Alfred Tarski beginning in 1929. We review here the basic notions of languages, explicit definability, and grammatical complexity, and emphasize common themes in the theories of definability for four important languages underlying, respectively, descriptive set theory, recursive function theory, classical pure logic, and finite-universe (...) class='Hi'>logic. We review the history of previous studies of the similarities and differences in the theories of definability of the first three of these four languages. A seminal role leading toward unification of the theories has been played by the separation principles introduced by Nikolai Luzin in 1927. Emphasizing analogies and driving toward further unification embracing finite-universe logic we concentrate on a simple example—the first and second separation principles for existential-universal first-order sentences . Using this as a test case for the fundamental problem of how to “finitize” arguments in classical pure logic to the finite-universe case, we are led to the analogous negative solution by using the theory of certain special graphs: a graph is - special for any positive integers m , n , p , q iff it is bipartite with m red points and n blue points and for every p -tuple of red points there is a blue point to which they are all connected . As an aside we introduce for further study a natural “Ramseyesque” increasing sequence A of positive integers, where A is the least positive integer n for which an -special graph exists. (shrink)

An important obstacle to lawhood in the special sciences is the worry that such laws would require metaphysically extravagant conspiracies among fundamental particles. How, short of conspiracy, is this possible? In this paper we'll review a number of strategies that allow for the projectibility of special science generalizations without positing outlandish conspiracies: non-Humean pluralism, classical MRL theories of laws, and Albert and Loewer's theory. After arguing that none of the above fully succeed, we consider the conspiracy problem (...) through the lens of our preferred view of laws, an elaboration of the MRL view that we call the Better Best System (BBS) theory. BBS offers a picture on which, although all events supervene on a fundamental level, there is no one unique locus of projectibility; rather there are a large number of loci corresponding to the different areas (ecology, economics, solid-state chemistry, etc.) in which there are simple and strong generalizations to be made. While we expect that some amount of conspiracy-fear-inducing special science projectibility is inevitable given BBS, we'll argue that this is unobjectionable. It follows from BBS that the laws of any particular special or fundamental science amount to a proper subset of the laws. From this vantage point, the existence of projectible special science generalizations not guaranteed by the fundamental laws is not an occasion for conspiracy fantasies, but a predictable fact of life in a complex world. (shrink)

In 1936, G. Birkhoff and J. v. Neumann published an article with the title The logic of quantum mechanics'. In this paper, the authors demonstrated that in quantum mechanics the most simple observables which correspond to yes-no propositions about a quantum physical system constitute an algebraic structure, the most important proper ties of which are given by an orthocomplemented and quasimodular lattice Lq. Furthermore, this lattice of quantum mechanical proposi tions has, from a formal point of view, many similarities (...) with a Boolean lattice L8 which is known to be the lattice of classical propositional logic. Therefore, one could conjecture that due to the algebraic structure of quantum mechanical observables a logical calculus Q of quantum mechanical propositions is established, which is slightly different from the calculus L of classical propositional logic but which is applicable to all quantum mechanical propositions. This calculus has sometimes been called 'quan tum logic'. However, the statement that propositions about quantum physical systems are governed by the laws of quantum logic, which differ from ordinary classical logic and which are based on the empirically well-established quantum theory, is exposed to two serious objec tions: Logic is a theory which deals with those relationships between various propositions that are valid independent of the content of the respective propositions. Thus, the validity of logical relationships is not restricted to a special type of proposition, e. g. to propositions about classical physical systems. (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)

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)

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)

This volume includes the complete texts of two of John Stuart Mill's most important works, Utilitarianism and On Liberty, and selections from his other writings, including the complete text of his Remarks on Bentham's Philosophy. The selection from Mill's A System of Logic is of special relevance to the debate between those who read Mill as an Act-Utilitarian and those who interpret him as a Rule-Utilitarian. Also included are selections from the writings of Jeremy Bentham, founder of modern (...) Utilitarianism and mentor of John Stuart Mill. Bentham's _Principles of Morals and Legislation_ had important effects on political and legal reform in his own time and continues to provide insights for political theorists and philosophers of law. Seven chapters of Bentham's _Principles_ are here in their entirety, together with a number of shorter selections, including one in which Bentham repudiates the slogan often used to characterize his philosophy: The Greatest Happiness of the Greatest Number. John Troyer's Introduction presents the central themes and arguments of Bentham and Mill and assesses their relevance to current discussions of Utilitarianism. The volume also provides indexes, a glossary, and notes. (shrink)

According to Peirce one of the most important philosophical problems is continuity. Consequently, he set forth an innovative and peculiar approach in order to elucidate at once its mathematical and metaphysical challenges through proper non-classical logical reasoning. I will restrain my argument to the definition of the different types of discrete collections according to Peirce, with a special regard to the phenomenon called ?premonition of continuity? (Peirce, 1976, Vol. 3, p. 87, c. 1897).

Foreword to Special issue on Logics for Multi-agent Systems.

Many students ask, 'What is the point of learning formal logic?' This book gives them the answer. Using the methods of deductive logic, Nelson Lande introduces each new element in exquisite detail, as he takes students through example after example, proof after proof, explaining the thinking behind each concept. Shaded areas and appendices throughout the book provide explanations and justifications that go beyond the main text, challenging those students who wish to delve deeper, and giving instructors the option (...) of confining their course to the basics, or expanding it, when they wish, to more rigorous levels. Lande encourages students to think for themselves, while at the same time providing them with the level of explanation they need to succeed. It is a rigorous approach presented in a style that is informal, engaging, and accessible. Students will come away with a solid understanding of formal logic and why it is not only important, but also interesting and sometimes even fun. It is a text that brings the human element back into the teaching of logic. --Hans Halvorson, Princeton University. (shrink)

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, (...) paraconsistent, intuitionistic and quantum logics, can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (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)

We investigate mathematical structures that provide natural semantics for families of (quantified) non-classical logics featuring special unary connectives, known as recovery operators, that allow us to ‘recover’ the properties of classical logic in a controlled manner. These structures are known as topological Boolean algebras, which are Boolean algebras extended with additional operations subject to specific conditions of a topological nature. In this study, we focus on the paradigmatic case of negation. We demonstrate how these algebras are (...) well-suited to provide a semantics for some families of paraconsistent Logics of Formal Inconsistency and paracomplete Logics of Formal Undeterminedness. These logics feature recovery operators used to earmark propositions that behave ‘classically’ when interacting with non-classical negations. Unlike traditional semantical investigations, which are carried out in natural language (extended with mathematical shorthand), our formal meta-language is a system of higher-order logic (HOL) for which automated reasoning tools exist. In our approach, topological Boolean algebras are encoded as algebras of sets via their Stone-type representation. We use our higher-order meta-logic to define and interrelate several transformations on unary set operations, which naturally give rise to a topological cube of opposition. Additionally, our approach enables a uniform characterization of propositional, first-order and higher-order quantification, including restrictions to constant and varying domains. With this work, we aim to make a case for the utilization of automated theorem proving technology for conducting computer-supported research in non-classical logics. All the results presented in this paper have been formally verified, and in many cases obtained, using the Isabelle/HOL proof assistant. (shrink)

The paper uses the theory of generalized quantifiers to discuss existential import and its implications for Aristotelian logic, namely the square of opposition, conversions and the assertoric syllogistic, as well as for more recent generalizations to intermediate quantifiers like “most”. While this is a systematic discussion of the semantic background one should assume in order to obtain the inferences and oppositions Aristotle proposed, it also sheds some light on the interpretation of his writings. Moreover by applying tools from modern (...) formal semantics to the investigation of classical Aristotelian logic and its extensions, we combine different approaches to the logic of quantification. We will present variants of quantifiers that are associated to the four corners of the square of opposition with and without existential import and discuss their role for the logical square, conversions and the syllogistic. It will turn out that there is no way to ascribe existential import that validates all inferences and relations which one is willing to hold in Aristotelian logic. Two options, however, provide reasonable results. Existential import should either be ascribed only to affirmative statements or only be ascribed to universal quantification. The former option is preferable for a mere reconstruction of the classical Aristotelian logic while the latter option is more attractive if Aristotelian logic is generalized to intermediate quantifiers. (shrink)

Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof. Providing a convincing proof-net counterpart to proofs in the classical sequent calculus is thus an important step in understanding classical sequent calculus proofs. By convincing, we mean that there should be a canonical function from sequent proofs to proof nets, it should be possible to check the correctness of (...) a net in polynomial time, every correct net should be obtainable from a sequent calculus proof, and there should be a cut-elimination procedure which preserves correctness.Previous attempts to give proof-net-like objects for propositional classical logic have failed at least one of the above conditions. In Richard McKinley [22], the author presented a calculus of proof nets satisfying and ; the paper defined a sequent calculus corresponding to expansion nets but gave no explicit demonstration of . That sequent calculus, called LK⁎LK⁎ in this paper, is a novel one-sided sequent calculus with both additively and multiplicatively formulated disjunction rules. In this paper [22]), we give a full proof of for expansion nets with respect to LK⁎LK⁎, and in addition give a cut-elimination procedure internal to expansion nets – this makes expansion nets the first notion of proof-net for classical logic satisfying all four criteria. (shrink)

One of the classical systems of Indian Philosophy is specially concerned with the problems of logic c This system is called Nyaya which has a long history of about two thousand years. In the extent of the literature it has produced and in the depth of the philosophical problems it discusses, it is of considerable interest and importance. However, the spirit of pure rationality in which Nyaya discusses these problems and the techniques it makes use of in (...) handling them are quite different from other systems of Indian thought and at once renders it a unique achievement of the Indian mind. The term Nyaya means the method of coming to a conclusion with certainty and the system of Indian philosophy in which philosophical problems are discussed according to this method came to be called Nyayadarsana or just Nyaya. Nyaya has been sedulously cultivated in restricted circles of traditional learning. Nyaya and in particular, Navyanyaya studies with unparalleled rigour and exactitude the nature, the dimensions and conditions of human knowledge. And by common consent the philosophical problem par excellence is the problem of knowledge. With rare insight, both the old and modern Nyaya analyse the problems connected with human knowledge and sets forth in detail the exact conditions in which valid knowledge is possible. This essay highlights the nature and scope of Nyaya logic comparing and contrasting it with other systems of logic especially the Buddhist and Aristotelian. (shrink)

One of the classical systems of Indian Philosophy is specially concerned with the problems of logic c This system is called Nyaya which has a long history of about two thousand years. In the extent of the literature it has produced and in the depth of the philosophical problems it discusses, it is of considerable interest and importance. However, the spirit of pure rationality in which Nyaya discusses these problems and the techniques it makes use of in (...) handling them are quite different from other systems of Indian thought and at once renders it a unique achievement of the Indian mind. The term Nyaya means the method of coming to a conclusion with certainty and the system of Indian philosophy in which philosophical problems are discussed according to this method came to be called Nyayadarsana or just Nyaya. Nyaya has been sedulously cultivated in restricted circles of traditional learning. Nyaya and in particular, Navyanyaya studies with unparalleled rigour and exactitude the nature, the dimensions and conditions of human knowledge. And by common consent the philosophical problem par excellence is the problem of knowledge. With rare insight, both the old and modern Nyaya analyse the problems connected with human knowledge and sets forth in detail the exact conditions in which valid knowledge is possible. This essay highlights the nature and scope of Nyaya logic comparing and contrasting it with other systems of logic especially the Buddhist and Aristotelian. (shrink)

This monograph presents a general theory of weakly implicative logics, a family covering a vast number of non-classical logics studied in the literature, concentrating mainly on the abstract study of the relationship between logics and their algebraic semantics. It can also serve as an introduction to algebraic logic, both propositional and first-order, with special attention paid to the role of implication, lattice and residuated connectives, and generalized disjunctions. Based on their recent work, the authors develop a powerful (...) uniform framework for the study of non-classical logics. In a self-contained and didactic style, starting from very elementary notions, they build a general theory with a substantial number of abstract results. The theory is then applied to obtain numerous results for prominent families of logics and their algebraic counterparts, in particular for superintuitionistic, modal, substructural, fuzzy, and relevant logics. The book may be of interest to a wide audience, especially students and scholars in the fields of mathematics, philosophy, computer science, or related areas, looking for an introduction to a general theory of non-classical logics and their algebraic semantics. (shrink)

The paper gives a survey of results related to a problem of automatic recognizing important properties of non-classical logics.

Carnap in the 1930s discovered that there were non-normal interpretations of classical logic - ones for which negation and conjunction are not truth-functional so that a statement and its negation could have the same truth value, and a disjunction of two false sentences could be true. Church ar-gued that this did not call for a revision of classical logic. More recent writers seem to disa-gree. We provide a definition of "non-normal interpretation" and argue that Church was (...) right, and in fact, the existence of non-normal interpretations tells us something important about the condi-tions of extensionality of the classical logical operators. (shrink)

In this article the author shows Harthorne's important contribution to the revival of modern interest in the proofs of God's existence. He gives a short exposition of Harthorne's philosophy as far as that is relevant to our understanding of the superiority of the neo-classical concept of God (in comparison with classical theories) to face critical questions as to the validity of the ontological argument. The author analyses Harthorne's ontological argument and examines the following points of critique : (i) (...) Existence is not a predicate. (ii) The concept of a perfect being as well as the concept of a greatest number is meaningless. (iii) In the ontological argument the logical type fallacy is committed : Just as the universal ‘humanity’ is not human so ‘perfection’ is not perfect. (iv) In the ontological argument the paradox of the abstractness of the necessary is present. (v) The ontological argument forces us to accept an objectionable Aristotelian essentialism. (vi) The ontological argument jumps incorrectly from a de dicto modality to a de re modality. The author shows that these objections can be answered satisfactorily in Harthorne's neo-classical metaphysics. He discusses further a modal reconstruction of the cosmological argument (of his own) and shows that this establishes an argument for Harthorne's God conception. Finally he asks two critical questions. Hartshorne does not sufficiently acknowledges the fact that there are more than one logical system so that a choice must be made, which brings in an ‘existential’ moment in philosophy. Further he wonders as to whether Harthorne's temporal interpretation of modalities is correct. In an appendix written in English the author discusses modern reconstructions of the ontological and cosmological argument with the help of modern symbolic logic. (shrink)

There exist valuable methods for theorem proving in non classical logics based on translation from these logics into first-order classical logic (abbreviated henceforth FOL). The key notion in these approaches istranslation from aSource Logic (henceforth abbreviated SL) to aTarget Logic (henceforth abbreviated TL). These methods are concerned with the problem offinding a proof in TL by translating a formula in SL, but they do not address the very important problem ofpresenting proofs in SL via a (...) backward translation. We propose a framework for presenting proofs in SL based on a partial backward translation of proofs obtained in a familiar TL: Order-Sorted Predicate Logic. The proposed backward translation transfers some formulasF TL belonging to the proof in TL into formulasF SL , such that the formulasF SL either (a) belong to a corresponding deduction in SL (in the best case) or, (b) are semantically related in some precise way, to formulas in the corresponding deduction in SL (in the worst case). The formulasF TL andF SL can obviously be considered aslemmas of their respective proofs. Therefore the transfer of lemmas of TL gives at least a skeleton of the corresponding proof in SL. Since the formulas of a proof keep trace of the strategy used to obtain the proof, clearly the framework can also help in solving another fundamental and difficult problem:the transfer of strategies from classical to non classical logics. We show how to apply the proposed framework, at least to S5, S4(p), K, T, K4. Two conjectures are stated and we propose sufficient (and in general satisfactory) conditions in order to obtain formulas in the proof in SL. Two particular cases of the conjectures are proved to be theorems. Three examples are treated in full detail. The main lines of future research are given. (shrink)

This paper reviews the impact of Rasiowa's well-known book on the evolution of algebraic logic during the last thirty or forty years. It starts with some comments on the importance and influence of this book, highlighting some of the reasons for this influence, and some of its key points, mathematically speaking, concerning the general theory of algebraic logic, a theory nowadays called Abstract Algebraic Logic. Then, a consideration of the diverse ways in which these key points (...) can be generalized allows us to survey some issues in the development of the field in the last twenty to thirty years. The last part of the paper reviews some recent lines of research that in some way transcend Rasiowa's approach. I hope in this way to give the reader a general view of Rasiowa's key position in the evolution of Algebraic Logic during the twentieth century. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

Logical Options introduces the extensions and alternatives to classical logic which are most discussed in the philosophical literature: many-sorted logic, second-order logic, modal logics, intuitionistic logic, three-valued logic, fuzzy logic, and free logic. Each logic is introduced with a brief description of some aspect of its philosophical significance, and wherever possible semantic and proof methods are employed to facilitate comparison of the various systems. The book is designed to be useful for (...) philosophy students and professional philosophers who have learned some classical first-order logic and would like to learn about other logics important to their philosophical work. (shrink)

This special issue of Logica Universalis (Springer) deals with the relations between logic and religion, broadly conceived. It contains the following articles: Logic and Religion, by Jean-Yves Beziau and Ricardo Silvestre; Thinking Negation in Early Hinduism and Classical Indian Philosophy, by Purushottama Bilimoria; Karma Theory, Determinism, Fatalism and Freedom of Will, by Ricardo Sousa Silvestre; From Logic in Islam to Islamic Logic, by Musa Akrami; Leibniz’s Ontological Proof of the Existence of God and the (...) Problem of Impossible Objects, by Wolfgang Lenzen; A Logical Analysis of the Anselm’s Unum Argumentum (from Proslogion), by Jean-Pierre Desclés; Monotonic and Non-monotonic Embeddings of Anselm’s Proof, by Jacob Archambault; Computer-Assisted Analysis of the Anderson–Hájek Ontological Controversy, by C. Benzmüller, L. Weber and B. Woltzenlogel Paleo. (shrink)

The novel notion of importing logics is introduced, subsuming as special cases several kinds of asymmetric combination mechanisms, like temporalization [8, 9], modalization [7] and exogenous enrichment [13, 5, 12, 4, 1]. The graph-theoretic approach proposed in [15] is used, but formulas are identified with irreducible paths in the signature multi-graph instead of equivalence classes of such paths, facilitating proofs involving inductions on formulas. Importing is proved to be strongly conservative. Conservative results follow as corollaries for temporalization, modalization and (...) exogenous enrichment. (shrink)

A new direction in philosophy Between 1920 and 1940 logical empiricism reset the direction of philosophy of science and much of the rest of Anglo-American philosophy. It began as a relatively organized movement centered on the Vienna Circle, and like-minded philosophers elsewhere, especially in Berlin. As Europe drifted into the Nazi era, several important figures, especially Carnap and Neurath, also found common ground in their liberal politics and radical social agenda. Together, the logical empiricists set out to reform traditional philosophy (...) with a new set of doctrines more firmly grounded in logic and science. Criticism and decline Because of Nazi persecution, most of the European adherents of logical empiricism moved to the United States in the late 1930s. During the 1940s, many of their most cherished tenets became targets of criticism from outsiders as well as from within their own ranks. Philosophers of science in the late 1950s and 1960s rejected logical empiricism and, starting in the 1970s, presented such alternative programs such as scientific realism with evolutionary epistemology. A resurgence of interest During the early 1980s, philosophers and historians of philosophy began to study logical empiricism as an important movement. Unlike their predecessors in the 1960s-for whom the debate over logical empiricism now seems to have been largely motivated by professional politics-these philosopher no longer have to take positions for or against logical empiricism. The result has been a more balanced view of that movement, its achievements, its failures, and its influence. Hard-to-find core writings now available This collection makes available a selection of the most influential and representative writings of the logical empiricists, important contemporary criticisms of their doctrines, their responses, as well as the recent reappraisals. Introductions to each volume examine the articles in historical context and provide importantbackground information that is vital to a full understanding of the issues discussed. They outline prevalent trends, identifying leading figures and summarize their positions and reasoning, as well as those of opposing thinkers. (shrink)

We present a reconstruction of so-called classical, formal or Mendelian genetics using a notation which we believe is more legible than that of earlier accounts, and lends itself easily to computer implementation, for instance in PROLOG. By drawing from, and emending, earlier work of Balzer and Dawe (1986,1997), the present account presents the three most important lines of development of classical genetics: the so-called Mendel's laws, linkage genetics and gene mapping, in the form of a theory-net. This shows (...) that the set theoretic representation format used in the structuralist approach to the philosophy of science also applies to the domain of genetic theories. There construction is intended to lend more clarity to theme thodological, philosophical and didactical discussions of the foundations of genetics, and on the other hand to defend a formally, logically minded view of theories which seems to have become contested through the work of Feyerabend, Kuhn and Kitcher. (shrink)

The aim of this paper is to present a new logic-based understanding of the connection between classical kinematics and relativistic kinematics. We show that the axioms of special relativity can be interpreted in the language of classical kinematics. This means that there is a logical translation function from the language of special relativity to the language of classical kinematics which translates the axioms of special relativity into consequences of classical kinematics. We will (...) also show that if we distinguish a class of observers in special relativity and exclude the non-slower-than light observers from classical kinematics by an extra axiom, then the two theories become definitionally equivalent. Furthermore, we show that classical kinematics is definitionally equivalent to classical kinematics with only slower-than-light inertial observers, and hence by transitivity of definitional equivalence that special relativity theory extended with “Ether” is definitionally equivalent to classical kinematics. So within an axiomatic framework of mathematical logic, wee xplicitly show that the transition from classical kinematics to relativistic kinematics is the knowledge acquisition that there is no “Ether”, accompanied by a redefinition of the concepts of time and space. (shrink)

The explanatory power of logic is vast and therefore it has proved a valuable tool for many disciplines, including the building-blocks of cognitive science, such as philosophy, computer science, mathematics, artificial intelligence, and linguistics. Logic has a great track record in providing interesting insights by means of formalization, and as such it is very useful in disambiguating psychological theories. Logically formalized cognitive theories are not only the source of unequivocal experimental hypotheses, but they also lend themselves naturally to (...) computational modeling. Most importantly, modern logic has at its service a rich variety of tools to assess and compare such psychological theories. This toolbox can be utilized in evaluating cognitive models along the following dimensions:logical relationships, for example, incompatibility or identity of models;explanatory power, for example, what can be expressed by means of a model?computational plausibility, for example, a. (shrink)

The term ‘logical form’ has been called on to serve a wide range of purposes in philosophy, and it would be too ambitious to try to survey all of them in a single essay. Instead, I will focus on just one conception of logical form that has occupied a central place in the philosophy of language, and in particular in the philosophical study of linguistic meaning. This is what I will call the classical conception of logical form. The (...) class='Hi'>classical conception, as I will present it in section 1, has (either explicitly or implicitly) shaped a great deal of important philosophical work in semantic theory. But it has come under fire in recent decades, and in sections 2 and 3 I will discuss two of the recent challenges that I take to be most interesting and significant. (shrink)

RésuméDans cet article, je pose le problème suivant: quelles propositions ont un import dans la logique modale d'Avicenne? Lesquelles n'en ont pas? Partant de l'assomption que les propositions singulières et quantifiées ont un import si elles requièrent l'existence de leur sujet pour être vraies, j'analyse d'abord l'import des propositions absolues, ensuite celui des propositions modales en tenant compte des définitions d'Avicenne et des relations entre ces propositions. Cette analyse conduit aux résultats suivants: Avicenne défend l'opinion générale selon laquelle les affirmatives, (...) qu'elles soient modales ou assertoriques, ont un import alors que les négatives n'en ont pas. Il attribue un import aux propositions possibles affirmatives aussi bien dans l'interprétation externaliste que dans l'interprétation internaliste des logiciens post-Avicenniens, pourvu que le sujet ne soit pas impossible. Toutefois, la théorie n'est pas toujours claire, car Avicenne attribue un import aux propositions contenant ‘parfois non’ et aux nécessaires négatives contenant ‘tant qu'il est P’ malgré leur caractère négatif; les propositions nécessaires affirmatives contenant ‘tant qu'il est P’ sont considérées comme ayant un import alors qu'elles ne l'exigent pas. De plus, l'analyse qu'il donne des assertoriques spéciales E et O et de leurs contradictoires est erronée, ce qui ne permet pas de déterminer clairement leur import. Mais quand elles sont correctement analysées, ces propositions E et O n'ont pas d'import, alors que leurs contradictoires – les assertoriques spéciales I et A respectivement – ont un import. (shrink)

The papers in this special issue are based on presentations delivered at the conference Epistemic Aspects of Many-valued Logics, held at the Institute of Philosophy of the Academy of Sciences of the Czech Republic, in Prague, 2010. All papers consequently revolve around the application of non-classical logical tools—mathematical fuzzy logic and/or probability theory—to epistemological issues.Timothy Williamson employs a modal epistemic logic enriched with probabilities to generalize an argument against the KK-principle. He argues that we can know (...) a proposition even if our evidential probability for that proposition is low. In fact he argues that the evidential probability of a known proposition can be (arbitrarily) close to 0. The argument is first presented with a basic idealized model, which is then extended to much more complicated and realistic models. This then raises a problem for decision theory, since you can know that p, while your evidence tells you (strongly) that not p. Wil .. (shrink)

This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical (...) system---ST---that conservatively extends classical logic with a fully transparent truth predicate. This system is shown to allow for classical reasoning over the full (truth-involving) vocabulary, but to be non-transitive. Some special cases where transitivity does hold are outlined. ST is also shown to give rise to a familiar sort of model for non-classical logics: Kripke fixed points on the Strong Kleene valuation scheme. Finally, to give a theory of paradoxical sentences, a distinction is drawn between two varieties of assertion and two varieties of denial. On one variety, paradoxical sentences cannot be either asserted or denied; on the other, they must be both asserted and denied. The target theory is compared favourably to more familiar related systems, and some objections are considered. (shrink)

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section (...) 2 presents the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (shrink)

We take into account two areas of the logical research of the Lvov-Warsaw School. First, we consider a new approach to research in the history of logic introduced and practiced by Łukasiewicz and some of his followers. In this style of doing history of logic, the knowledge of original philosophical and logical texts was combined with competence in modern logic. This method resulted in many important discoveries both in history and in logic and philosophy. At the (...) same time, we pay attention to contemporary historical research devoted to the logic created by the School itself. In this context, we present an overview of the six papers included in the special issue ‘Logic and its History in the Lvov-Warsaw School’. These papers were presented at an international symposium, ‘History in/of the Lvov-Warsaw School’, held in October 2022 in Warsaw, and they cover various aspects of historical-logical and logical achievements of the School. They concern topics from history of ancient logic, history of modern proof theory, and the issues of applying logic to philosophy and theology in the same way as the one implemented at the Lvov-Warsaw School. (shrink)

Logics for generally were introduced for handling assertions with vague notions,such as generally, most, several, etc., by generalized quantifiers, ultrafilter logic being an interesting case. Here, we show that ultrafilter logic can be faithfully embedded into a first-order theory of certain functions, called coherent. We also use generic functions (akin to Skolem functions) to enable elimination of the generalized quantifier. These devices permit using methods for classical first-order logic to reason about consequence in ultrafilter logic.

Classical logic, of first or higher order, is extended with sentential operators and quantifiers, interpreted substitutionally over unrestricted substitution class. Operators mark a single layered, consistent metalanguage. Self-reference, arising from substitutional quantification over sentences, allows to express paradoxes which, unlike contradictions, do not lead to explosion. Semantics of the resulting language, using semi-kernels of digraphs, is non-explosive yet two-valued and has classical semantics as a special case for clasically consistent theories. A complete reasoning is obtained by (...) extending LK with two rules for sentential quantifiers. Adding (cut) yields a complete system for the explosive semantics. (shrink)

Supervenience is mostly conceived of as a purely philosophical concept. Nevertheless, I will argue, it played an important and very fruitful inferential role in classical genetics. Gregor Mendel assumed that phenotypic traits supervene on underlying factors, and this assumption allowed him to successfully predict and explain the phenotypical regularities he had experimentally discovered. Therefore it is interesting to explicate how we reason about supervenience relations. I will tackle the following two questions. Firstly, can a reliable method (a logic) (...) be found for infenfog supervenience claims from data? Secondly, can a reliable method (a logic) be found to empirically test supervenience claims? I will answer these questions within the framework of the adaptive logics programme. (shrink)

In this paper I develop a cross-cultural critique of contemporary critical thinking education in the United States, the United Kingdom, and those educational systems that adopt critical thinking education from the standard model used in the US and UK. The cross-cultural critique rests on the idea that contemporary critical thinking textbooks completely ignore contributions from non-western sources, such as those found in the African, Arabic, Buddhist, Jain, Mohist and Nyāya philosophical traditions. The exclusion of these traditions leads to the conclusion (...) that critical thinking educators, by using standard textbooks are implicitly sending the message to their students that there are no important contributions to the study of logic and argumentation that derive from non-western sources. As a case study I offer a sustained analysis of the so-called Hindu Syllogism that derives from the Nyāya School of classical Indian philosophy. I close with a discussion of why contributions from non-western sources, such as the Hindu Syllogism, belong in a Critical Thinking course as opposed to an area studies course, such as Asian Philosophy. (shrink)