This tutorial is for beginners wanting to learn the basics of propositional logic; the simplest of the formal systems of logic. Leslie Allan introduces students to the nature of arguments, validity, formal proofs, logical operators and rules of inference. With many examples, Allan shows how these concepts are employed through the application of three different methods for proving the formal validity of arguments.

In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds to modern formulations of the logic of “not”, “and”, “or”, and “if…then…”. Along the way we prove a number of novel results about the system of propositional logic found in Grundgesetze, and the broader system obtained (...) by including identity. In particular, we show that the propositional connectives that are definable in terms of Frege’s horizontal, negation, and conditional are exactly the connectives that fuse with the horizontal, and we show that the logical operators that are definable in terms of the horizontal, negation, the conditional, and identity are exactly the operators that are invariant with respect to permutations on the domain that leave the truth-values fixed. We conclude with some general observations regarding how Frege understood his logic, and how this understanding differs from modern views. (shrink)

Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for (...) groups of formulas whose top rows differ. For them I provide (i) a tree-style system of ‘row tree proofs’, which is shown to be sound and complete, and (ii) an alternative, re-writing strategy. (shrink)

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented (...) in various ways can be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (shrink)

Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, (...) focussing primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic ("Post-") and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional (...) logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by (...) means of growing computational resources, and converge towards classical propositional logic. The underlying claim is that this hierarchy can be used to represent increasing levels of “depth” or “informativeness” of Boolean reasoning. Special attention is paid to the most basic logic in this hierarchy, the pure “intelim logic”, which satisfies all the requirements of a natural deduction system (allowing both introduction and elimination rules for each logical operator) while admitting of a feasible (quadratic) decision procedure. We argue that this logic is “analytic” in a particularly strict sense, in that it rules out any use of “virtual information”, which is chiefly responsible for the combinatorial explosion of standard classical systems. As a result, analyticity and tractability are reconciled and growing degrees of computational complexity are associated with the depth at which the use of virtual information is allowed. (shrink)

In this paper we propose an non-machine learning artificial intelligence (AI) based approach for telecom data analysis, with a special focus on clique detection. Clique detection can be used to identify households, which is a major challenge in telecom data analysis and predictive analytics. Our approach does not use any form of machine learning, but another type of algorithm: satisfiability for propositional logic. This is a neglected approach in modern AI, and we aim to demonstrate that for certain (...) tasks, it may be a good alternative to machine learning-based approaches. We have used a simple DPLL satisfiability solver over an artificially generated telecom dataset (due to GDPR regulations), but our approach can be implemented on any telecom data by following the SAT encoding we have developed, and the DPLL solver can be substituted by a more advanced alternative such as CDCL. This paper extends the method presented in [1] for banking logs to data containing caller information, and proposes a more efficient encoding. -/- . (shrink)

Basic Argument forms Modus Ponens , Modus Tollens , Hypothetical Syllogism and Dilemma contains ‘If –then’ conditions. Conclusions from the Arguments containing ‘If –then’ conditions can be deduced very easily without any significant memorization by applying Raval’s method. Method: In Raval’s method If P then Q is written as P (2$) – Q (1$) and viewed numerically, in currency form i.e. P is viewed as 2$ and Q is viewed as 1$ and implications from this notations are valid conclusions. If (...) one has 2$ then he definitely have 1$. If one do not have 2$, he may not have 1$. If one is having 1$, he may not have 2$. If one do not have 1$, he definitely doesn’t have 2$. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the (...) approach can be naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.

The five English words—sentence, proposition, judgment, statement, and fact—are central to coherent discussion in logic. However, each is ambiguous in that logicians use each with multiple normal meanings. Several of their meanings are vague in the sense of admitting borderline cases. In the course of displaying and describing the phenomena discussed using these words, this paper juxtaposes, distinguishes, and analyzes several senses of these and related words, focusing on a constellation of recommended senses. One of the purposes of this (...) paper is to demonstrate that ordinary English properly used has the resources for intricate and philosophically sound investigation of rather deep issues in logic and philosophy of language. No mathematical, logical, or linguistic symbols are used. Meanings need to be identified and clarified before being expressed in symbols. We hope to establish that clarity is served by deferring the extensive use of formalized or logically perfect languages until a solid “informal” foundation has been established. Questions of “ontological status”—e.g., whether propositions or sentences, or for that matter characters, numbers, truth-values, or instants, are “real entities”, are “idealizations”, or are “theoretical constructs”—plays no role in this paper. As is suggested by the title, this paper is written to be read aloud. -/- I hope that reading this aloud in groups will unite people in the enjoyment of the humanistic spirit of analytic philosophy. (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)

In my book Logical Form I outline some reasons for thinking that, in the sense of «logical form» that matters to logic, logical form is determined by truth conditions. This paper compares three theories of propositions that might be employed to substantiate the underlying notion of truth conditions: the naturalized propositions theory, the truthmaker theory, and the classificatory theory. Its aim is to show that, while the naturalized propositions theory and the truthmaker theory accord equally well with the idea (...) that logical form is determined by truth conditions, the classificatory theory is more problematic in some respects. (shrink)

In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...) propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) (...) can be computed from the calculus. (shrink)

This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...) numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching! (shrink)

Proposition are the material of our reasoning. Proposition are the basic building blocks of the world/thought. Proposition have intense relation with the world. World is a series of atomic facts and these facts are valued by the proposition although sentences explain the world of reality but can’t have any truth values, only proposition have truth values to describe the world in terms of assertions. Propositions are truth value bearers, the only quality of proposition is truth & falsity, that they are (...) either true or false. Proposition mirrors the world and explains how world is arranged in an orderly manner. It scans the world(object) and are composed of atomic facts experienced and can be analyzed into propositions. Propositions are the basic units of logic. The truth (affirm) and falsity (nego) are the qualities of the propositions and universality (generality) and Particularity are the quantities of the propositions. There are propositions which are neither true nor false, they are called Pseudo-Propositions and their quality are ipso-facto i.e meaningless. Propositions are used in computers with the modifications brought by the modern logicians in the form of statements or logical sentences. The truth table of the logical gates and binary operations (1,s or 0,s are due to the revolution of the modern logic or mathematical logic. It is a fact that proposition cannot change the word but it shows the relation between the object and of the word. Objectives: The objectives of this research is to explore the importance and need of propositions in logic. It also shows the analysis of propositions and how a philosopher thoughts in terms of propositions or concepts. In this research problem it is shown that propositions had been described in many ways by most of the philosophers and logicians from Aristotle to contemporary philosophers. It also analysis the contribution of the philosophers towards proposition and its relation to the world of reality. This research also describes the definition and nature of proposition. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary (...) quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

In previous work, I introduced a complete axiomatization of classical non-tautologies based essentially on Łukasiewicz’s rejection method. The present paper provides a new, Hilbert-type axiomatization (along with related systems to axiomatize classical contradictions, non-contradictions, contingencies and non-contingencies respectively). This new system is mathematically less elegant, but the format of the inferential rules and the structure of the completeness proof possess some intrinsic interest and suggests instructive comparisons with the logic of tautologies.

We present two defeasible logics of norm-propositions (statements about norms) that (i) consistently allow for the possibility of normative gaps and normative conflicts, and (ii) map each premise set to a sufficiently rich consequence set. In order to meet (i), we define the logic LNP, a conflict- and gap-tolerant logic of norm-propositions capable of formalizing both normative conflicts and normative gaps within the object language. Next, we strengthen LNP within the adaptive logic framework for non-monotonic reasoning in (...) order to meet (ii). This results in the adaptive logics LNPr and LNPm, which interpret a given set of premises in such a way that normative conflicts and normative gaps are avoided ‘whenever possible’. LNPr and LNPm are equipped with a preferential semantics and a dynamic proof theory. (shrink)

Propositional identity is not expressed by a predicate. So its logic is not given by the ordinary first order axioms for identity. What are the logical axioms governing this concept, then? Some axioms in addition to those proposed by Arthur Prior are proposed.

In he Problems of Philosophy and other works of the same period, Russell claims that every proposition must contain at least one universal. Even fully general propositions of logic are claimed to contain “abstract logical universals”, and our knowledge of logical truths claimed to be a species of a priori knowledge of universals. However, these views are in considerable tension with Russell’s own philosophy of logic and mathematics as presented in Principia Mathematica. Universals generally are qualities and relations, (...) but if, for example, PM’s disjunction (∨) is a relation, what is it a relation between? There is no obvious answer to this given Russell’s other philosophical commitments at this time, although hints are left in some of the pre-PM manuscripts. In this paper, I explore this tension in Russell's philosophy and relate it to developments both before and after Problems. (shrink)

Proposition and sentence are two separate entities indicating their specific purposes, definitions and problems. A proposition is a logical entity. A proposition asserts that something is or not the case, any proposition may be affirmed or denied, all proportions are either true (1’s) or false (0’s). All proportions are sentences but all sentences are not propositions. Propositions are factual contains three terms: subject, predicate and copula and are always in indicative or declarative mood. While sentence is a grammatical entity, a (...) unit of language that expresses a complete thought; a sentence may express a proposition, but is distinct from the proposition it may be used to express: categories, declarative sentences, exclamatory, imperative and interrogative sentences. Not all sentences are propositions, propositions express sentence. Sentence is a proposition only in condition when it bears truth values i.e. true or false. We use English sentences governed by imprecise rule to state the precise rules of proposition. In logic we use sentence as logical entity having propositional function but grammatical sentences are different from logical sentences while the former are having only two divisions namely subject and predicate and may express wishes, orders, surprise or facts and also have multiple subjects and predicates and the latter must be in a propositional form which states quantity of the subject and the quality of the proposition and multiple subjects and multiple predicate make the proposition multiple. (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)

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)

The addition of "actually" operators to modal languages allows us to capture important inferential behaviours which cannot be adequately captured in logics formulated in simpler languages. Previous work on modal logics containing "actually" operators has concentrated entirely upon extensions of KT5 and has employed a particular modeltheoretic treatment of them. This paper proves completeness and decidability results for a range of normal and nonnormal but quasi-normal propositional modal logics containing "actually" operators, the weakest of which are conservative extensions of (...) K, using a novel generalisation of the standard semantics. (shrink)

This paper argues that the theory of structured propositions is not undermined by the Russell-Myhill paradox. I develop a theory of structured propositions in which the Russell-Myhill paradox doesn't arise: the theory does not involve ramification or compromises to the underlying logic, but rather rejects common assumptions, encoded in the notation of the $\lambda$-calculus, about what properties and relations can be built. I argue that the structuralist had independent reasons to reject these underlying assumptions. The theory is given both (...) a diagrammatic representation, and a logical representation in a novel language. In the latter half of the paper I turn to some technical questions concerning the treatment of quantification, and demonstrate various equivalences between the diagrammatic and logical representations, and a fragment of the $\lambda$-calculus. (shrink)

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). (...) It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in (...) Sections 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

This paper offers an analysis of a hitherto neglected text on insoluble propositions dating from the late XiVth century and puts it into perspective within the context of the contemporary debate concerning semantic paradoxes. The author of the text is the italian logician Peter of Mantua (d. 1399/1400). The treatise is relevant both from a theoretical and from a historical standpoint. By appealing to a distinction between two senses in which propositions are said to be true, it offers an unusual (...) solution to the paradox, but in a traditional spirit that contrasts a number of trends prevailing in the XiVth century. It also counts as a remarkable piece of evidence for the reconstruction of the reception of English logic in italy, as it is inspired by the views of John Wyclif. Three approaches addressing the Liar paradox (Albert of Saxony, William Heytesbury and a version of strong restrictionism) are first criticised by Peter of Mantua, before he presents his own alternative solution. The latter seems to have a prima facie intuitive justification, but is in fact acceptable only on a very restricted understanding, since its generalisation is subject to the so-called revenge problem. (shrink)

The dogma that the propositional logic of metaphysical modality is S5 is rebutted. The author exposes fallacies in standard arguments supporting S5, arguing that propositional metaphysical modal logic is weaker even than both S4 and B, and is instead the minimal and weak metaphysical-modal logic T.

Fichte’s Foundations of the Entire Wissenschaftslehre 1794 is one of the most fundamental books in classical German philosophy. The use of laws of thought to establish foundational principles of transcendental philosophy was groundbreaking in the late eighteenth and early nineteenth century and is still crucial for many areas of theoretical philosophy and logic in general today. Nevertheless, contemporaries have already noted that Fichte’s derivation of foundational principles from the law of identity is problematic, since Fichte lacked the tools to (...) correctly present the formal parts of Foundations. In this paper, however, we argue that Fichte’s approach intuitively offers an important contribution to transcendental philosophy, and especially to philosophy of logic. We first point out the difficulties of Fichte’s logic in the Foundations and improve it in a second part on the basis of a formal system in which both propositional logic and syllogistic are combined. (shrink)

This book treats ancient logic: the logic that originated in Greece by Aristotle and the Stoics, mainly in the hundred year period beginning about 350 BCE. Ancient logic was never completely ignored by modern logic from its Boolean origin in the middle 1800s: it was prominent in Boole’s writings and it was mentioned by Frege and by Hilbert. Nevertheless, the first century of mathematical logic did not take it seriously enough to study the ancient (...) class='Hi'>logic texts. A renaissance in ancient logic studies occurred in the early 1950s with the publication of the landmark Aristotle’s Syllogistic by Jan Łukasiewicz, Oxford UP 1951, 2nd ed. 1957. Despite its title, it treats the logic of the Stoics as well as that of Aristotle. Łukasiewicz was a distinguished mathematical logician. He had created many-valued logic and the parenthesis-free prefix notation known as Polish notation. He co-authored with Alfred Tarski’s an important paper on metatheory of propositional logic and he was one of Tarski’s the three main teachers at the University of Warsaw. Łukasiewicz’s stature was just short of that of the giants: Aristotle, Boole, Frege, Tarski and Gödel. No mathematical logician of his caliber had ever before quoted the actual teachings of ancient logicians. -/- Not only did Łukasiewicz inject fresh hypotheses, new concepts, and imaginative modern perspectives into the field, his enormous prestige and that of the Warsaw School of Logic reflected on the whole field of ancient logic studies. Suddenly, this previously somewhat dormant and obscure field became active and gained in respectability and importance in the eyes of logicians, mathematicians, linguists, analytic philosophers, and historians. Next to Aristotle himself and perhaps the Stoic logician Chrysippus, Łukasiewicz is the most prominent figure in ancient logic studies. A huge literature traces its origins to Łukasiewicz. -/- This Ancient Logic and Its Modern Interpretations, is based on the 1973 Buffalo Symposium on Modernist Interpretations of Ancient Logic, the first conference devoted entirely to critical assessment of the state of ancient logic studies. (shrink)

This is a review of "Properties and Propositions: The Metaphysics of Higher-Order Logic" by Robert Trueman. Following an overview of the main themes of the book, I discuss the metaphysical presuppositions of Trueman's Fregean notation for predicate abstraction and evaluate his argument for strict typing.

We introduce now for the first time the neutrosophic modal logic. The Neutrosophic Modal Logic includes the neutrosophic operators that express the modalities. It is an extension of neutrosophic predicate logic and of neutrosophic propositional logic.

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of (...) adding critical $\varepsilon $ - and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a (...) nice topological interpretation. This constitutes a new proof of S4 as being "the logic of topological spaces", but now under the perspective of paraconsistency. (shrink)

W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due in (...) large measure to developments stemming from Carnap’s studies and culminating in the work of Kripke, Hintikka, and Bayart. These developments undermined Quine’s crusade against intensions on two fronts. First, in the context of possible world semantics, intensions could after all be given rigorous identity conditions by defining them (in the simplest case) as functions from worlds to appropriate extensions, a fact exploited to powerful and influential effect in logic and linguistics by the likes of Kaplan, Montague, Lewis, and Cresswell. Second, the rise of possible world semantics fueled a strong resurgence of metaphysics in contemporary analytic philosophy that saw properties and propositions widely, fruitfully, and unabashedly adopted as ontological primitives in their own right. This resurgence — happily, in my view — continues into the present day. -/- For a time, at any rate, Quine experienced somewhat better success with his second thesis: that higher-order logic is, at worst, confused and, at best, a quirky notational alternative to standard first-order logic. However, Quine notwithstanding, a great deal of recent work in formal metaphysics transpires in a higher-order logical framework in which properties and propositions fall into an infinite hierarchy of types of (at least) every finite order. Initially, the most philosophically compelling reason for embracing such a framework since Russell first proposed his simple theory of types was simply that it provides a relatively natural explanation of the paradoxes. However, since the seminal work of Prior there has been a growing trend to consider higher-order logic to be the most philosophically natural framework for metaphysical inquiry, many of the contributors to this volume being among the most important and influential advocates of this view. Indeed, this is now quite arguably the dominant view among formal metaphysicians. -/- In this paper, and against the current tide, I will argue in §1 that there are still good reasons to think that Quine’s second battle is not yet lost and that the correct framework for logic is first-order and type-free — properties and propositions, logically speaking, are just individuals among others in a single domain of quantification — and that it arises naturally out of our most basic logical and semantical intuitions. The data I will draw upon are not new and are well-known to contemporary higher-order metaphysicians. However, I will try to defend my thesis in what I believe is a novel way by suggesting that these basic intuitions ground a reasonable distinction between “pure” logic and non-logical theory, and that Russell-style semantic paradoxes of truth and exemplification arise only when we move beyond the purely logical and, hence, do not of themselves provide any strong objection to a type-free conception of properties and propositions. -/- Most of my arguments in §1 are largely independent of any specific account of the nature of properties and propositions beyond their type-freedom. However, I will in addition argue that there are good reasons to take propositions, at least, to be very fine-grained. My arguments are thus bolstered significantly if it can be shown that there are in fact well-defined examples of logics that are not only type-free but which comport with such a conception of propositions. It is the purpose of §2 to lay out a logic of this sort in some detail, drawing especially upon work by George Bealer and related work of my own. With the logic in place, it will be possible to generalize the line of argument noted above regarding Russell-style paradoxes and, in §3, apply it to two propositional paradoxes — the Prior-Kaplan paradox and the Russell-Myhill paradox — that are often taken to threaten the sort of account developed here. (shrink)

ABSTRACT: A detailed presentation of Stoic logic, part one, including their theories of propositions (or assertibles, Greek: axiomata), demonstratives, temporal truth, simple propositions, non-simple propositions(conjunction, disjunction, conditional), quantified propositions, logical truths, modal logic, and general theory of arguments (including definition, validity, soundness, classification of invalid arguments).

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus (...) seen as the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)

In the present paper we propose a system of propositional logic for reasoning about justification, truthmaking, and the connection between justifiers and truthmakers. The logic of justification and truthmaking is developed according to the fundamental ideas introduced by Artemov. Justifiers and truthmakers are treated in a similar way, exploiting the intuition that justifiers provide epistemic grounds for propositions to be considered true, while truthmakers provide ontological grounds for propositions to be true. This system of logic is (...) then applied both for interpreting the notorious definition of knowledge as justified true belief and for advancing a new solution to Gettier counterexamples to this standard definition. (shrink)

// tl;dr A Proposition is a Way of Thinking // -/- This chapter is about type-theoretic approaches to propositional content. Type-theoretic approaches to propositional content originate with Hintikka, Stalnaker, and Lewis, and involve treating attitude environments (e.g. "Nate thinks") as universal quantifiers over domains of "doxastic possibilities" -- ways things could be, given what the subject thinks. -/- This chapter introduces and motivates a line of a type-theoretic theorizing about content that is an outgrowth of the recent literature (...) on epistemic modality, according to which contentful thought is broadly "informational" in its nature and import. The general idea here is that an object of thought is not a way *the world* could be, but rather a way *one's perspective* could be (with respect to a relevant representational question). I will spend the middle part of this chapter motivating and developing a version of this strategy that is, I’ll argue, well-suited to explaining clear phenomena concerning the attribution of perspectival attitudes -- in particular, attitudes towards loosely information-sensitive propositions -- with which extant approaches struggle. My overarching goal here will be to motivate a distinctive version of the "informational" approach -- the "Flexible Types" approach, which is based on the theory proposed in Charlow (2020). According to the Flexible Types approach, propositional attitude verbs are quantifiers over sets of possibilities, but a possibility is a type-flexible notion -- sometimes a possible world, sometimes a perspective, sometimes a set of possible worlds, sometimes a set of perspectives. -/- After introducing the Flexible Types approach, this chapter circles back to more traditional concerns for the analysis of propositions as types of possibilities -- Frege's Puzzle and the problem of Logical Omniscience. Here too the Flexible Types approach bears fruit. Although there are certainly significant differences -- I note some in the concluding section -- the gist of this theory is Hinitkkan or Lewisian in spirit (if not quite in letter). We can make progress on addressing the challenges for the analysis of propositional content in terms of types of possibilities, through empirically driven refinement of our notion of what kind of thing a "doxastic possibility" is. (shrink)

Building on the notational principles of C. S. Peirce’s graphical logic, Pietarinen has tried to develop a propositional logic unfolding in the medium of sound. Apart from its intrinsic interest, this project serves as a concrete test of logic’s range. However, I argue that Pietarinen’s inaugural proposal, while promising, has an important shortcoming, since it cannot portray double-negation without thereby portraying a contradiction.

forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), symbolizing English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as modal logic, soundness, and functional (...) completeness. Exercises with solutions are available. It is provided in PDF (for screen reading, printing, and a special version for dyslexics), HTML, and in LaTeX source code. (shrink)

Gillian Russell has recently proposed counterexamples to such elementary argument forms as Conjunction Introduction and Identity. These purported counterexamples involve expressions that are sensitive to linguistic context—for example, a sentence which is true when it appears alone but false when embedded in a larger sentence. If they are genuine counterexamples, it looks as though logical nihilism—the view that there are no valid argument forms—might be true. In this paper, I argue that the purported counterexamples are not genuine, on the grounds (...) that they equivocate. Having defused the threat of logical nihilism, I argue that the kind of linguistic context sensitivity at work in Russell’s purported counterexamples, if taken seriously, far from leading to logical nihilism, reveals new, previously undreamt-of valid forms. By way of proof of concept I present a simple logic, Solo-Only Propositional Logic, designed to capture some of them. Along the way, some interesting subtleties about the fallacy of equivocation are revealed. (shrink)

In this paper I argue against Michael Morris’ claim, that the Tractatus view involves holding that the possibility of truth-functional combination is prior to the possibility for sentential constituents to combine with one another. I provide an alternative interpretation in which I deny the presence of any distinction in the Tractatus between these two possibilities. I then turn to Adrian Moore’s ‘disjunctivist’ account of sentencehood, itself inspired by the Tractatus view. I argue that Moore’s account need not involve a commitment (...) to the kind of priority Morris describes, and that it need not involve a commitment to transcendental idealism. (shrink)