Logic and Philosophy of Logic

Ālāpa Paddhati, composed by Ācārya Devasena (c. tenth century, Vikrama Samvat) is a Jaina text primarily on the topics of the standpoints (naya) and the secondary-standpoints (upanaya). It also delves into the substances (dravya), their qualities or attributes (guṇa), modes (paryāya), and nature (svabhāva). It is true that without appreciating the import and applicability of the individual standpoints (naya), one may get lost in the complex maze of the standpoints and cause great harm to one’s understanding, and even to one’s (...) mental balance. Ālāpa Paddhati is essential reading for every serious reader of the Dravyānuyoga that spreads the light of right (scriptural) knowledge by illuminating the Reality of substances – soul (jīva) and non-soul (ajīva), merit (puṇya) and demerit (pāpa), bondage (bandha) and liberation (mokṣa), including influx (āsrava), stoppage (saṃvara), and gradual dissociation (nirjarā). The book has a useful Appendix that explains the doctrines of non-absolutism (anekāntavāda) and conditional predication (syādvāda). This slim volume needs to be read over and over again to internalize the underlying concepts fully. (shrink)

The parallel research is contemporary to analyse processes and localisation in artificial intelligence (AI) associated with connexionism and learning algorithms. In machine learning, the perceptron (or McCulloch-Pitts neuron) is an algorithm for Boolean functions of binary classifiers. A binary classifier is a function which can decide whether or not an input, represented by a vector of numbers, belongs to some specific class. With a pattern N we use the calculator in synthesis applying polynomial advanced systems.

It is astonishing that we humans are able to have, act on and express moral beliefs. This dissertation aims to provide a better philosophical understanding of why and how this is possible especially when we assume metaethical expressivism. Metaethical expressivism is the combination of expressivism and noncognitivism. Expressivism is the view that the meaning of a sentence is explained by the mental state it is conventionally used to express. Noncognitivism is the view that the mental state expressed by a moral (...) sentence is a noncognitive, desire-like state. The central question of this dissertation is this: "How can metaethical expressivists explain that we are able to express moral beliefs?" The shortest answer this dissertation will give is the following: "by becoming `dispositional expressivists´." Dispositional expressivists hold that moral beliefs are dispositions to be in certain mental states that resemble desires. More precisely, a central thesis of this study is that to hold a moral belief is to be disposed to be in a desire-like, noncognitive state where this state has some specific structure. This dissertation arrives at and justifies this thesis by making a number of steps. It starts with preparing the ground by developing a general theory of what it is for a sentence to express a mental state. Roughly, this theory states that for a sentence to express a mental state is for that sentence to be conventionally used to perform a speech act which counts as sincere only if the user or speaker is in that mental state. This theory of expressing satisfies all the constraints that must be satisfied for it to be compatible with the purposes of metaethical expressivism. The next step is to provide a solution to the most notorious semantic problem confronting metaethical expressivism, the problem of explaining how sentences containing moral words can have compositional meaning and stand in logical relations also known as the Frege-Geach or embedding problem. Building on the research of Mark Schroeder, a new expressivist semantics, called `Attitude Semantics´, will be developed for a first-order language. The motivating idea underlying attitude semantics is that expressivists can avoid the problematic feature of so-called `biforcation´ if they treat the structures of the mental states expressed by moral sentences as well as that expressed by non-moral sentences as being isomorphic. In order to give those structures a philosophically interesting interpretation, it will be suggested that we treat sentences as expressing dispositional states. As a toy example we will treat the sentence `murder is wrong´ as expressing the disposition to be for blaming for murder. After dealing with the Frege-Geach problem, I turn to the metaethical expressivists' project of quasi-realism. Two major goals of this project are to explain how moral sentence can be truth-apt and how the states expressed by them can be regarded as moral beliefs. In order to establish those goals I critically examine a number of theories of truth-aptness by providing counterexamples to them. I then present my own theory which says that a sentence is truth-apt iff and because there is a conventional way to use it to express a belief. What is new about this theory is that it treats expressing a belief as being explanatorily more basic than being truth-apt. Belief, according to this theory, explains truth-aptness, not vice versa. This has the important consequence that it shows that what I call the `orthodox strategy´ of quasi-realists is mistaken and needs to be inverted: expressivists must `earn the right´ to moral belief before they can establish that moral sentences are truth-apt, and not the other way round. The second part of this dissertation is then concerned with the question of what it is to hold a moral belief and how they can figure in rational reasoning. In short: it is concerned with earning the right to moral belief. After discussing the major problems confronting a noncognitivist theory of belief, most importantly what I call the `tightrope problem´, I argue for a dispositional form of noncognitivism about moral belief that combines elements from Eric Schwitzgebel's dispositionalism about belief and Sebastian Köhler's `conceptual role expressivism´. This dispositional noncognitivism perfectly matches and justifies the dispositionalist interpretation of the expressivist semantics developed before. In order to fully earn the right to moral belief, however, metaethical expressivists must also deal with several epistemological objections concerning the rationality of moral belief. The first objection I deal with comes from Derek Baker and is directed against Mark Schroeder's specific development of expressivism. I deal with this objection because my own theory bears close resemblance to Schroeder's theory and so it might be worried that it confronts the same issues. Fortunately, we will see that Baker's objection rest on a number of mistaken assumptions and so neither applies to Schroeder's expressivism nor to the version which I defend in this study. The other epistemological objection to metaethical expressivism I deal with is Cian Dorr's famous wishful-thinking objection. In contrast to previous replies to this objection I attack it by directly questioning the central assumption on which it rests, namely that reasoners can never be justified in basing a factual belief on a desire-like state. I argue that this is false, and that under certain conditions reasoning from desire-like mental states to factual beliefs is justified. My argument shows that even if holding a moral belief is being in a desire-like noncognitive state, basing factual belief on a moral belief can give one an epistemic reason for the factual belief. Hence, even if moral thoughts are wishes, moral thinking is not wishful thinking. I take my arguments to earn the dispositional expressivist the right to moral belief. By the previously defended theory of truth-aptness in terms of belief, this allows the dispositional expressivists to conclude that moral sentences are also truth-apt. This finishes the quasi-realist project of this dissertation. In the last part of this dissertation I switch gears and present two unnoted problems for metaethical expressivists having to do with explaining moral motivation. Both arguments are surprisingly simple. The first one is this: if motivation requires a belief as well as a desire (Humeanism), and moral judgments motivate by themselves (internalism), then moral judgments cannot be desires only. If this argument is sound, it shows that the famous `motivation argument´ not only entails the falsity of cognitivism, but also the falsity of noncognitivism. The second argument is the following: moral judgments when combined with suitable external desires motivate to act (externalism), but if motivation requires belief as well as desire (Humeanism), then moral judgments cannot be desires only. I discuss several ways in which noncognitivists might want to deal with those problems, but leave it as an open question whether those solutions will ultimately be viable. Overall, this dissertation makes serious contributions to the research program of metaethical expressivism. It makes proposals for how to solve a number of notorious problems, such as the Frege-Geach problem in semantics and the wishful-thinking problem in epistemology. Besides this, however, it also raises two new problems for metaethical expressivism in the philosophy of action. For those reasons this dissertation will be of interest for anyone who wants to defend or criticize expressivism in metaethics, and more generally, anyone who wants to better understand our astonishing ability to express moral beliefs. (shrink)

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

We present tableau proof systems for the annotated version of propositional justification logics, that is, justification logics which are formulated using annotated application operators. We show that the tableau systems are sound and complete with respect to Mkrtychev models, and some tableau systems are analytic and provide a decision procedure for the annotated justification logics. We further show Craig’s interpolation property and Beth’s definability theorem for some annotated justification logics.

In 2008, Graff Fara presented relative-sameness semantics, a semantics for a first-order modal and temporal language with the explicit aim of being able to render true certain contingent/temporary identity claims (relative to certain contexts). Graff Fara achieves this aim by abandoning a straightforward analysis of de re modal/temporal claims in terms of identity. Instead, such a claim is analyzed in terms of her relative-sameness relations (which need not be the identity relation), with the relevant relative-sameness relations in play determined by (...) context and individual terms occurring in the claim. However, there is a significant problem for relative-sameness semantics concerning (i) iterated modality/temporality, and (ii) existence that renders it an inappropriate account of our modal and temporal talk. In this paper, I present that problem and a solution to it. (shrink)

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A statement φ is possible in a structure (written φ) if φ is true in some extension of that structure, and φ is necessary (written φ) if it is true in all extensions of the structure. A principal case for us will be the class Mod(T) (...) of all models of a given theory T—all graphs, all groups, all fields, or what have you—considered under the substructure relation. In this article, we aim to develop the resulting modal model theory. The class of all graphs is a particularly insightful case illustrating the remarkable power of the modal vocabulary, for the modal language of graph theory can express connectedness, k-colorability, finiteness, countability, size continuum, size ℵ1, ℵ2, ℵω, ℶω, first ℶ-fixed point, first ℶ-hyper-fixed point, and much more. A graph obeys the maximality principle φ(a)→φ(a) with parameters if and only if it satisfies the theory of the countable random graph, and it satisfies the maximality principle for sentences if and only if it is universal for finite graphs. (shrink)

In epistemic logic, the beliefs of an agent are modeled in a way very similar to knowledge, except that they are fallible. Thus, the pattern of an agent’s true beliefs is an interesting subject to study. In this paper, we conduct a systematic study on a novel modal logic with the bundled operator ⊡ϕ:=□ϕ∧ϕ as the only primitive modality, where ⊡ captures the notion of true belief. With the help of a novel notion of ⊡-bisimulation, we characterize the expressivity of (...) this new language on relational models, and offer various completeness results. We also discuss some interesting connections between our work and previous works on reflexive-insensitive logics and the so-called boxdot conjecture. Finally, we study two generalizations of the ⊡-operator: one is the iterated true belief operator □nϕ:=ϕ∧□ϕ∧⋯∧□nϕ, the other is the neighborhood semantics for the ⊡-operator. (shrink)

Den här boken är en inledning till den s.k. modallogiken. Modallogiken studerar argument vars giltighet beror på modala ord såsom ”måste”, ”kan” och ”omöjlig”. Boken innehåller fem kapitel. Det första kapitlet är en kort inledning till modallogik. Kapitel 2 handlar om syntax. Det tar upp flera modallogiska språk; det beskriver hur dessa är uppbyggda och hur de förhåller sig till olika naturliga språk. Kapitel 3 handlar om semantik. Vad betyder olika symboliska tecken? Vad har olika satser för sanningsvillkor? Kapitel 4 (...) handlar om bevisteori. Det går bl.a. igenom hur man kan avgöra om ett argument är modallogiskt giltigt eller inte i olika modala system. Det nämner tre olika bevismetoder/härledningsmetoder: axiomatiska system, naturlig deduktion och semantiska tablåer. Kapitlet innehåller många exempel. Om man vill lära sig mer om logik, kan det vara bra att veta någonting om alla dessa olika metoder. Kapitel 5 innehåller viss allmän information om modallogiken och fler övningar. Boken tar upp information både om propositionell modallogik, som är en utvidgning av den s.k. satslogiken, och kvantifierad modallogik, som bygger vidare på den s.k. predikatlogiken. Grunderna till satslogiken beskrivs bl.a. i boken Satslogik: En Introduktion. Grunderna till predikatlogiken beskrivs bl.a. i boken Predikatlogik: En Introduktion. För att förstå materialet i den här boken bör läsaren först ha studerat dessa eller liknande böcker. Modallogik: En Introduktion innehåller en stor mängd övningar som kan hjälpa läsaren att öva upp sina logiska förmågor. (shrink)

In Kantian philosophy, the term “condition of possibility” is central, but carries the following ambiguity. According to one reading, “condition of possibility” merely means “necessary condition”. However, it is demonstrated that a deeper interpretation of the term “possibility” proves to be more fruitful. This reading allows us to reconstruct an important background assumption of Kant: Every condition of the possibility of experience holds necessarily, provided that experience is possible. Or more generally: All conditions of the possibility hold necessarily as long (...) as the conditioned is actually possible. -/- This conclusion is understood through the axiomatic system S5. Therefore I argue by referencing the schematism chapter that Kant’s notion of modal terms can be formalized through S5. (shrink)

The aim of this paper is threefold. Firstly, §1 and §2 introduce the novel concept logical akrasia by analogy to epistemic akrasia. If successful, the initial sections will draw attention to an interesting akratic phenomenon which has not received much attention in the literature on akrasia (although it has been discussed by logicians in different terms). Secondly, §3 and §4 present a dilemma related to logical akrasia. From a case involving the consistency of Peano Arithmetic and Gödel’s Second Incompleteness Theorem (...) it’s shown that either we must be agnostic about the consistency of Peano Arithmetic or akratic in our arithmetical theorizing. If successful, these sections will underscore the pertinence and persistence of akrasia in arithmetic (by appeal to Gödel’s seminal work). Thirdly, §5 concludes by suggesting a way of translating the dilemma of arithmetical akrasia into a case of regular epistemic akrasia; and further how one might try to escape the dilemma when it’s framed this way. (shrink)

An algebraization of the notion of topology has been proposed more than 70 years ago in a classical paper by McKinsey and Tarski, leading to an area of research still active today, with connections to algebra, geometry, logic and many applications, in particular, to modal logics. In McKinsey and Tarski’s setting the model theoretical notion of homomorphism does not correspond to the notion of continuity. We notice that the two notions correspond if instead we consider a preorder relation \( \sqsubseteq (...) \) defined by \(a \sqsubseteq b\) if _a_ is contained in the topological closure of _b_, for _a_, _b_ subsets of some topological space. A _specialization poset_ is a partially ordered set endowed with a further coarser preorder relation \( \sqsubseteq \). We show that every specialization poset can be embedded in the specialization poset naturally associated to some topological space, where the order relation corresponds to set-theoretical inclusion. Specialization semilattices are defined in an analogous way and the corresponding embedding theorem is proved. Specialization semilattices have the amalgamation property. Some basic topological facts and notions are recovered in this apparently very weak setting. The interest of these structures arises from the fact that they also occur in many rather disparate contexts, even far removed from topology. (shrink)

Belnap–Dunn’s relevance logic, \(\textsf{BD}\), was designed seeking a suitable logical device for dealing with multiple information sources which sometimes may provide inconsistent and/or incomplete pieces of information. \(\textsf{BD}\) is a four-valued logic which is both paraconsistent and paracomplete. On the other hand, De and Omori, while investigating what classical negation amounts to in a paracomplete and paraconsistent four-valued setting, proposed the expansion \(\textsf{BD2}\) of the four valued Belnap–Dunn logic by a classical negation. In this paper, we introduce a four-valued expansion (...) of BD called \({\textsf{BD}^\copyright }\), obtained by adding an unary connective \({\copyright }\,\ \) which is a consistency operator (in the sense of the Logics of Formal Inconsistency, _LFI_s). In addition, this operator is the unique one with the following features: it extends to \(\textsf{BD}\) the consistency operator of LFI1, a well-known three-valued _LFI_, still satisfying axiom _ciw_ (which states that any sentence is either consistent or contradictory), and allowing to define an undeterminedness operator (in the sense of Logic of Formal Undeterminedness, _LFU_s). Moreover, \({\textsf{BD}^\copyright }\) is maximal w.r.t. LFI1, and it is proved to be equivalent to BD2, up to signature. After presenting a natural Hilbert-style characterization of \({\textsf{BD}^\copyright }\) obtained by means of twist-structures semantics, we propose a first-order version of \({\textsf{BD}^\copyright }\) called \({\textsf{QBD}^\copyright }\), with semantics based on an appropriate notion of four-valued Tarskian-like structures called \(\textbf{4}\) -structures. We show that in \({\textsf{QBD}^\copyright }\), the existential and universal quantifiers are interdefinable in terms of the paracomplete and paraconsistent negation, and not by means of the classical negation. Finally, a Hilbert-style calculus for \({\textsf{QBD}^\copyright }\) is presented, proving the corresponding soundness and completeness theorems. (shrink)

\(\nabla \) -algebra is a natural generalization of Heyting algebra, unifying many algebraic structures including bounded lattices, Heyting algebras, temporal Heyting algebras and the algebraic presentation of the dynamic topological systems. In a series of two papers, we will systematically study the algebro-topological properties of different varieties of \(\nabla \) -algebras. In the present paper, we start with investigating the structure of these varieties by characterizing their subdirectly irreducible and simple elements. Then, we prove the closure of these varieties under (...) the Dedekind-MacNeille completion and provide the canonical construction and the Kripke representation for \(\nabla \) -algebras by which we establish the amalgamation property for some varieties of \(\nabla \) -algebras. In the sequel of the present paper, we will complete the study by covering the logics of these varieties and their corresponding Priestley-Esakia and spectral duality theories. (shrink)

The aim of this paper is to define a partial Propositional Type Theory. Our system is partial in a double sense: the hierarchy of (propositional) types contains partial functions and some expressions of the language, including formulas, may be undefined. The specific interpretation we give to the undefined value is that of Kleene’s strong logic of indeterminacy. We present a semantics for the new system and prove that every element of any domain of the hierarchy has a name in the (...) object language. Finally, we provide a proof system and a (constructive) proof of completeness. (shrink)

This expository paper presents an application, to the modal logic S4, of the valuation semantics technique proposed by Loparić for the basic normal modal logic K. In previous works we presented a valuation semantics for the minimal temporal logic Kt and several other systems modal and temporal logic. How to deal with S4, however, was left as an open problem—although we arrived at a working definition of \(A_1,\ldots,A_n\) -valuations, we were not able to prove an important lemma for correctness. In (...) this paper we solve this, presenting valuations for S4. (shrink)

In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules. A key aim is to show completeness of the proof rules without any requirement for formal models. Establishing this for propositional intuitionistic logic raises some technical and conceptual issues. We relate Sandqvist’s (complete) base-extension semantics of intuitionistic propositional logic to categorical proof theory in presheaves, reconstructing categorically the soundness and (...) completeness arguments, thereby demonstrating the naturality of Sandqvist’s constructions. This naturality includes Sandqvist’s treatment of disjunction that is based on its second-order or elimination-rule presentation. These constructions embody not just validity, but certain forms of objects of justifications. This analysis is taken a step further by showing that from the perspective of validity, Sandqvist’s semantics can also be viewed as the natural disjunction in a category of sheaves. (shrink)

A non-Fregean framework aims to provide a formal tool for reasoning about semantic denotations of sentences and their interactions. Extending a logic to its non-Fregean version involves introducing a new connective $$\equiv $$ ≡ that allows to separate denotations of sentences from their logical values. Intuitively, $$\equiv $$ ≡ combines two sentences $$\varphi $$ φ and $$\psi $$ ψ into a true one whenever $$\varphi $$ φ and $$\psi $$ ψ have the same semantic correlates, describe the same situations, or (...) have the same content or meaning. The paper aims to compare non-Fregean paraconsistent Grzegorczyk’s logics (Logic of Descriptions $$\textsf{LD}$$ LD, Logic of Descriptions with Suszko’s Axioms $$\textsf{LDS}$$ LDS, Logic of Equimeaning $$\textsf{LDE}$$ LDE ) with non-Fregean versions of certain well-known paraconsistent logics (Jaśkowski’s Discussive Logic $$\textsf{D}_2$$ D 2, Logic of Paradox $$\textsf{LP}$$ LP, Logics of Formal Inconsistency $$\textsf{LFI}{1}$$ LFI 1 and $$\textsf{LFI}{2}$$ LFI 2 ). We prove that Grzegorczyk’s logics are either weaker than or incomparable to non-Fregean extensions of $$\textsf{LP}$$ LP, $$\textsf{LFI}{1}$$ LFI 1, $$\textsf{LFI}{2}$$ LFI 2. Furthermore, we show that non-Fregean extensions of $$\textsf{LP}$$ LP, $$\textsf{LFI}{1}$$ LFI 1, $$\textsf{LFI}{2}$$ LFI 2, and $$\textsf{D}_2$$ D 2 are more expressive than their original counterparts. Our results highlight that the non-Fregean connective $$\equiv $$ ≡ can serve as a tool for expressing various properties of the ontology underlying the logics under consideration. (shrink)

In this paper, we use the concept of very true operator to pre-semi-Nelson algebras and investigate the properties of very true pre-semi-Nelson algebras. We study the very true N-deductive systems and use them to establish the uniform structure on very true pre-semi-Nelson algebras. We obtain some properties of this topology. Finally, the corresponding logic very true semi-intuitionistic logic with strong negation is constructed and algebraizable of this logic is proved based on very true semi-Nelson algebras.

As Classical Propositional Logic finds its algebraic counterpart in Boolean algebras, the logic of Quantum Mechanics, as outlined within G. Birkhoff and J. von Neumann’s approach to Quantum Theory (Birkhoff and von Neumann in Ann Math 37:823–843, 1936) [see also (Husimi in I Proc Phys-Math Soc Japan 19:766–789, 1937)] finds its algebraic alter ego in orthomodular lattices. However, this logic does not incorporate time dimension although it is apparent that the propositions occurring in the logic of Quantum Mechanics are depending (...) on time. The aim of the present paper is to show that tense operators can be introduced in every logic based on a complete lattice, in particular in the logic of quantum mechanics based on a complete orthomodular lattice. If the time set is given together with a preference relation, we introduce tense operators in a purely algebraic way. We derive several important properties of such operators, in particular we show that they form dynamic pairs and, altogether, a dynamic algebra. We investigate connections of these operators with logical connectives conjunction and implication derived from Sasaki projections in an orthomodular lattice. Then we solve the converse problem, namely to find for given time set and given tense operators a time preference relation in order that the resulting time frame induces the given operators. We show that the given operators can be obtained as restrictions of operators induced by a suitable extended time frame. (shrink)

In this paper we study the variety \(\textsf{WL}\) of bounded distributive lattices endowed with an implication, called weak Lewis distributive lattices. This variety corresponds to the algebraic semantics of the \(\{\vee,\wedge,\Rightarrow,\bot,\top \}\) -fragment of the arithmetical base preservativity logic \(\mathsf {iP^{-}}\). The variety \(\textsf{WL}\) properly contains the variety of bounded distributive lattices with strict implication, also known as weak Heyting algebras. We introduce the notion of WL-frame and we prove a representation theorem for WL-lattices by means of WL-frames. We extended (...) this representation to a topological duality by means of Priestley spaces endowed with a special neighbourhood relation between points and closed upsets of the space. These results are applied in order to give a representation and a topological duality for the variety of weak Heyting–Lewis algebras, i.e., for the algebraic semantics of the arithmetical base preservativity logic \(\textsf{iP}^{-}\). (shrink)

Even though the strong relationship between proof-theoretic and model-theoretic notions in one’s logical theory can be shown by soundness and completeness proofs, whether we can define the model-theoretic notions by means of the inferences in a proof system is not at all trivial. For instance, provable inferences in a proof system of classical logic in the logical framework do not determine its intended models as shown by Carnap (Formalization of logic, Harvard University Press, Cambridge, 1943), i.e., there are non-Boolean models (...) that satisfy its provable inferences. In the literature, this is known as the Categoricity problem or Carnap’s problem. In this paper, we will discuss the Categoricity problem (or Carnap’s problem) for three-valued logics K3 and LP. We will provide three different restrictions on admissible models that will deliver us categoricity results, some of which draw from the solutions provided for the Categoricity problem for classical logic in Belnap and Massey (Stud Log 49(1):67–82, 1990) and Bonnay and Westerståhl (Erkenntis 81(4):721–739, 2016). We will then argue that two of those solutions are philosophically well-motivated: (1) restricting the admissible models where negation is interpreted as a Strong Kleene truth-function, and (2) restricting the admissible models where a complex formula is assigned the third value when its immediate subformulas are assigned the third value. (shrink)

In this paper, I examine Ruth Barcan Marcus's early formal work on modal systems and the deduction theorem, both for the material and the strict conditional. Marcus proved that the deduction theorem for the material conditional does not hold for system S2 but holds for S4. This last result is at odds with the recent claim that without proper restrictions the deduction theorem fails also for S4. I explain where the contrast stems from. For the strict conditional, Marcus proved the (...) deduction theorem for S4 though restricted to arguments with necessary premises. I discuss Marcus's result and analyze her philosophical position on the significance of the deduction theorem for modal systems designed to express the notion of deducibility. (shrink)

A unified and modular falsification-aware single-succedent Gentzen-style framework is introduced for classical, paradefinite, paraconsistent, and paracomplete logics. This framework is composed of two special inference rules, referred to as the rules of explosion and excluded middle, which correspond to the principle of explosion and the law of excluded middle, respectively. Similar to the cut rule in Gentzen’s LK for classical logic, these rules are admissible in cut-free LK. A falsification-aware single-succedent Gentzen-style sequent calculus fsCL for classical logic is formalized based (...) on the proposed framework. The calculus fsCL is obtained from the existing falsification-aware single-succedent Gentzen-style sequent calculus GN4 for Nelson’s paradefinite (or paraconsistent) four-valued logic N4 by adding the rules of explosion and excluded middle. A falsification-aware single-succedent Gentzen-style sequent calculus GN3 for Nelson’s paracomplete three-valued logic N3 is also obtained from GN4 by adding the rule of explosion. The cut-elimination theorems for fsCL, GN3, and some of their neighbors as well as the Glivenko theorem for fsCL are proved. (shrink)

We develop some of Williamson’s ideas regarding how propositional calculus aids in comprehending Aristotelian logic. Specifically, we enhance the utilisation of truth tables to examine the structure of opposition diagrams. Using ‘conditioned truth tables’, we establish logical dependency relationships between the truth values of different propositions. This approach proves effective in interpreting various texts of the Organon concerning the doctrine of opposition.

A famous mathematical theorem says that the sum of an infinite series of numbers can depend on the order in which those numbers occur. Suppose we interpret the numbers in such a series as representing instances of some physical quantity, such as the weights of a collection of items. The mathematics seems to lead to the result that the weight of a collection of items can depend on the order in which those items are weighed. But that is very hard (...) to believe. A puzzle then arises: How do we interpret the metaphysical significance of this mathematical theorem? I first argue that prior solutions to the puzzle lead to implausible consequences. Then I develop my own solution, where the basic idea is that the weight of a collection of items is equal to the limit of the weights of its finite subcollections contained within ever-expanding regions of space. I show how my solution is intuitively plausible and philosophically motivated, how it reveals an underexplored line of metaphysical inquiry about quantities and locations, and how it elucidates some classic puzzles concerning supertasks. (shrink)

I propose an approach to liar and Curry paradoxes inspired by the work of Roger Swyneshed in his treatise on insolubles (1330-1335). The keystone of the account is the idea that liar sentences and their ilk are false (and only false) and that the so-called ''capture'' direction of the T-schema should be restricted. The proposed account retains what I take to be the attractive features of Swyneshed's approach without leading to some worrying consequences Swyneshed accepts. The approach and the resulting (...) logic (called ''Swynish Logic'') are non-classical, but are consistent and compatible with many elements of the classical picture including modus ponens, modus tollens, and double-negation elimination and introduction. It is also compatible with bivalence and contravalence. My approach to these paradoxes is also immune to an important kind of revenge challenge that plagues some of its rivals. (shrink)

The prologue of the Sophistici elenchi is as close an Aristotelian text gets to dealing with language as a subject matter in its own right, only in reverse. Language and its features bear consideration to the extent that they account for some major predicaments discursive reasoning is prone to, both as a separate and as a common endeavour. That being said, the linguistic pitfalls that trick us into thinking that whatever is the case for words and word-compounds is also the (...) case for the things and facts linguistic items stand for reveal as much about good linguistic habits and sound argumentation as they themselves are revealed by the principles and rules our argumentation goes by. In this connection, Aristotle resorted to a curious (or not so curious) analogy between words and counters which played a major role in explaining why language is such a powerful source of illusion and deception. As it happens, Aristotle accounting analogy is a case in point for showcasing the level of sophistication medieval Latin literature on fallacies achieved as early as the first half of the twelfth century. As a matter of fact, Western commentators managed to build compelling cases both in favour of and against the understanding that was to become and still is the standard story – which, of course, speaks volumes about their exegetical proficiency and technical expertise. On the one hand, trusting implicitly Boethius’ translation and well aware of his views on disputational hazards as opposed to computational reliability, they usually understood Aristotle’s comparison as if it was an analogy in name only. On the other hand, despite Boethius’ translation put them at a considerable disadvantage, Latin commentators were able to construe Aristotle’s analogy as bringing together two sets of symbolic variables (words and counters) that are neither entirely free nor entirely bound – which expose them to subtle but critical shifts in value and meaning. (shrink)

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

In this paper I provide an analysis of an anonymous text which appeared at Sondershausen and Mühlhausen in 1687: Initiatio philosophi sive Dubitatio Cartesiana, ad indubiam philosophiam viam monstrans, iuxta mentem Renati des Cartes, Nobilis Galli, utraque methodo explicata, titled after Johannes Clauberg’s homonymous 1655 treatise. It consisted of (1) an abridgement of his Paraphrasis in Renati Des Cartes Meditationes (1658), and (2) a demonstration more geometrico of the necessity of methodical doubt as the beginning of philosophy, partially based on (...) Clauberg’s own 1655 Initiatio. I place the publication of the 1687 text in the context of the attacks on Cartesianism taking place in German areas especially after 1677 and the appearance of Spinoza’s texts, focusing on the ways in which Clauberg’s philosophy was adapted to the rebuking of such attacks and to the re-establishment of a Cartesian presence in Germany. (shrink)

It is usually maintained that a subject with manifestly contradictory beliefs is irrational. How can we account, then, for the intuitive rationality of dialetheists, who believe that some manifest contradictions are true? My paper aims to answer this question. Its ultimate goal is to determine a characterization of (or rather a constraint for) rational belief approvable by both the theorists of Dialetheism and its opponents. In order to achieve this goal, a two-step strategy will be adopted. First, a characterization of (...) rational belief applicable to non-dialetheist believers will be determined; this characterization will involve the semantic apparatus of Nathan Salmon’s Millian Russellianism but will get rid of the problematic and obscure notion of mode of presentation (guise in his own terminology), replacing it with a couple of novel devices, belief subsystems and cognitive coordination. Second, using ideas from Graham Priest, the leading proponent of Dialetheism, such a characterization will be modified, so as to devise a new one able to account for the intuitive rationality of both dialetheist and non-dialetheist believers. (shrink)

When looking up at the starry sky, Socrates, the famous ancient Greek philosopher, raised three ultimate philosophical questions: "Who am I?" "Where am I from?" and "Where am I going?". For thousands of years, human beings have tried their best to think, research and explore it, involving various disciplines such as philosophy, medicine, psychology, physics, biology, and neurology, but they have not been widely recognized. This paper expounds the concept of "center" from the perspective of cosmology, world outlook and scientific (...) outlook for "I", and answers the question of "who am I?":"I am the center, the center is me". At the same time, it expounds the origin, essence, and attributes of consciousness, and answered the questions of "where do I come from?"："I come from dust" and "where do I go?"："I will return to dust". (shrink)

This paper challenges the negative attitudes towards labelled proof systems, usually referred to as semantic pollution, by arguing that such critiques overlook the full potential of labelled calculi. The overarching objective is to develop a practice-based philosophical analysis of labelled calculi to provide insightful considerations regarding their proof-theoretic and philosophical value. To achieve this, successful applications of labelled calculi and related results will be showcased, and comparisons with other relevant works will be discussed. The paper ends by advocating for a (...) more practice-based approach towards the philosophical understanding of proof systems and their role in structural proof theory. (shrink)

Drawing on recently published correspondence as well as on a survey of Polish and international philosophical activity published in 1937 and details concerning the publisher and bookseller Aleksander Mazzucato, I provide evidence that, contrary to some recent assertions (but in line with older bibliographical entries), Tarski's ‘Der Wahrheitsbegriff in den formalisierten Sprachen’ was not published in journal form until 1936, although preprints, lacking two corrections and a small addendum, were likely available in the late months of 1935.

What does ‘Smith knows that it might be raining’ mean? Expressivism here faces a challenge, as its basic forms entail a pernicious type of transparency, according to which ‘Smith knows that it might be raining’ is equivalent to ‘it is consistent with everything that Smith knows that it is raining’ or ‘Smith doesn’t know that it isn’t raining’. Pernicious transparency has direct counterexamples and undermines vanilla principles of epistemic logic, such as that knowledge entails true belief and that something can (...) be true without one knowing it might be. I re-frame the challenge in precise terms and propose a novel expressivist formal semantics that meets it by exploiting (i) the topic-sensitivity and fragmentation of knowledge and belief states and (ii) the apparent context-sensitivity of epistemic modality. The resulting form of assertibility semantics advances the state of the art for state-based bilateral semantics by combining attitude reports with context-sensitive modal claims, while evading various objectionable features. In appendices, I compare the proposed system to Beddor and Goldstein’s ‘safety semantics’ and discuss its analysis of a modal Gettier case due to Moss. (shrink)

The problem of precise characterisation of traditional forms of reasoning applied in mathematics was independently investigated and successfully resolved by Jaśkowski and Gentzen in 1934. However, there are traces of earlier interests in this field exhibited by the members of the Lvov-Warsaw School. We focus on the results obtained by Jaśkowski and Leśniewski. Jaśkowski provided the first formal system of natural deduction in 1926. Leśniewski also demonstrated in some of his papers how to construct proofs in accordance with intuitively correct (...) principles. (shrink)

David Hilbert sought to secure the epistemic foundations of mathematics by providing consistency proofs of axiomatized mathematical theories from within the finite standpoint. This standpoint requires concrete constructions without reference to completed infinities. In 1938, Gerhardt Gentzen proved the consistency of first-order Peano Arithmetic relying on the well-ordering of certain ordinal notations. This was thought by Gentzen and Paul Bernays to be finitistically acceptable. However, a finitistically acceptable proof of the relevant well-ordering was not available until Gaisi Takeuti’s proof in (...) 1978. Beginning with the proposition that Takeuti’s proof conforms to the finite standpoint, this chapter explores the limits of a finitism based on the methods of Gentzen and Takeuti. It is argued that the upper limit is the Feferman-Schütte ordinal, and thus that finitism may be extended to strong subsystems of second-order arithmetic-systems strong enough to provide a theory of the ordinals for which Gentzen employed notations. (shrink)

LK is much more difficult than NK, and to make matters worse, Gentzen's intention is still unclear when it comes to that system (LK). -/- The second and third volumes of the series titled What is LK? conduct the detailed survey of each inference-figure in a toe-to-toe way, as it were, which most mathematicians looked through. -/- The present volume, Vol.3, looks deeper into those operational inference-figures which concerns propositional logic.

Justification of theorems plays a vital role in any rational human activity. It is indispensable in science. The deductive method of justifying theorems is used in all sciences and it is the only method of justifying theorems in deductive disciplines. It is based on the notion of proof, thus it is a method of proving theorems. In the Warsaw School of Logic (WSL) – the famous branch of the Lvov-Warsaw School (LWS) – two types of the method: axiomatic deduction method (...) and natural deduction method were developed and practiced. In this paper, both of these methods are briefly discussed with an emphasis on their historical, groundbreaking significance for logic. The axiomatic method by means of rejection (proposed by Jan Łukasiewicz – a co-creator of the WSL), which is the method of the so-called rejection proof (rejection/refutation method) in logical systems and the proving method of generalized natural deduction, which is a hybrid deduction–refutation method of proving theorems, are also outlined in the paper. The author discusses their historical significance. This paper also contains a brief mention of the most significant results which the application of the discussed methods introduced into contemporary scientific research, not only logical one. (shrink)

Let serious propositional contingentism (SPC) be the package of views which consists in (i) the thesis that propositions expressed by sentences featuring terms depend, for their existence, on the existence of the referents of those terms, (ii) serious actualism—the view that it is impossible for an object to exemplify a property and not exist—and (iii) contingentism—the view that it is at least possible that some thing might not have been something. SPC is popular and compelling. But what should we say (...) about possible worlds, if we accept SPC? Here, I first show that a natural view of possible worlds, well-represented in the literature, in conjunction with SPC is inadequate. Though I note various alternative ways of thinking about possible worlds in response to the first problem, I then outline a second more general problem—a master argument—which generally shows that any account of possible worlds meeting very minimal requirements will be inconsistent with compelling claims about mere possibilia which the serious propositional contingentist should accept. (shrink)

A solid foundation of modal logic requires a clear conception of the notion of modality. Modern modal logic treats modality as a propositional operator. I shall present an alternative according to which modality applies primarily to illocutionary force, that is, to the force, or mood, of a speech act. By a first step of internalization, modality applied at this level is pushed to the level of speech-act content. By a second step of internalization, we reach a propositional operator validating the (...) modal logic S4. After a brief discussion of problematic modality and possibility, the article concludes with an extension of the account that identifies modality with illocutionary force. Throughout, close attention is paid to the intended interpretation of the formalism. All of the rules stipulated will be justified on the basis of this interpretation. (shrink)

The concept of topic-neutrality, though central to contemporary characterisations of logic, lacks a standard formal definition. I propose a formal reconstruction of topic-neutrality in terms of a topical partition of atoms and its applicability across consequence relations. I explore the implications of this reconstruction for logical pluralism and monism, distinguishing between topic-neutral and topic-specific variants of each. I argue that while topic-neutral pluralism posits various applicable consequence relations across domains, topic-specific pluralism holds that some relations are applicable only to specific (...) domains. (shrink)