We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and non-modal linear logics, are all obtained as extensions in a uniform way and in a single framework. We isolate three properties, which characterize B positively: reflection, symmetry and visibility. A logical constant obeys to the principle of reflection if it is characterized semantically by (...) an equation binding it with a metalinguistic link between assertions, and if its syntactic inference rules are obtained by solving that equation. All connectives of basic logic satisfy reflection. To the control of weakening and contraction of linear logic, basic logic adds a strict control of contexts, by requiring that all active formulae in all rules are isolated, that is visible. From visibility, cut-elimination follows. The full, geometric symmetry of basic logic induces known symmetries of its extensions, and adds a symmetry among them, producing the structure of a cube. (shrink)

Four Basic Logical Issues: The paper addresses what we see as the four major issues in logic. The overriding issue is that of the choice of logic. We start with some discussion of the preliminary issue of whether there is such a 'one true logic,' but we reserve the main discussion for the first issue of 'classical logic versus nonclassical logic.' Here, we discuss the role of meaning and truth, the relation between classical (...) class='Hi'>logic and classical negation, and whether and, if so, how classical logic should reside at the base world. Given the argument in favor of an overall use of nonclassical logic, the second issue is that of the choice of nonclassical logic. Brady's logic MC of meaning containment is argued for, with some comparison made with other relevant logics. For the remaining two issues, we make a case for relevant deduction, in comparison with classical deduction, and we explore possibilities for the appropriate metalogic, comparing classical and nonclassical approaches. (shrink)

The difficulty to interpret the iteration of modalities, already ontic and still more deontic, incites to pay attention to the system B of basic modal logic that John L. Pollock proposed in 1967. The Pollock’s system brought all the theses which, in the classical ontic modal systems, from Sl to S5, contain no iteration of the modal functors. With this basic ontic system we characterize a basic deontic system, and a basic ontico-deontic system, the former (...) including all the theses of the first two. Each of the three systems is based axiomatically and assorted with a semantics for which the soundness and the completeness hold. (shrink)

This article is a discussion of E. K. Emilsson, Plotinus (London and New York, 2017). Three themes are selected: causation; the holistic account of intelligible being; the status of matter and body. The discussion ends with some remarks about Emilsson’s approach to Plotinus’ philosophy. Emilsson’s account of Plotinus’ causation is based on the transmission model, what Emilsson calls ‘the principle of prior possession’. Here it is argued that the transmission model requires qualifications in order to be applied to Plotinus’ account (...) of causation. The section on Plotinus’ holism focuses on two analogies: that of science and its theorems and that of craftsmanship. The section on matter and body addresses the issue of Plotinus’ dualism as different from Cartesian dualism. The final remarks assess Emilsson’s philosophical approach to Plotinus, his use of contemporary philosophical notions, and the problem of Plotinus’ philosophical mysticism. (shrink)

Fitch's basic logic is an untyped illative combinatory logic with unrestricted principles of abstraction effecting a type collapse between properties (or concepts) and individual elements of an abstract syntax. Fitch does not work axiomatically and the abstraction operation is not a primitive feature of the inductive clauses defining the logic. Fitch's proof that basic logic has unlimited abstraction is not clear and his proof contains a number of errors that have so far gone undetected. (...) This paper corrects these errors and presents a reasonably intuitive proof that Fitch's system K supports an implicit abstraction operation. Some general remarks on the philosophical significance of basic logic, especially with respect to neo-logicism, are offered, and the paper concludes that basic logic models a highly intensional form of logicism. (shrink)

At least some of us, at least some of the time—when not in the grip of radical sceptical doubt—are inclined to believe that we know, for example, that if we infer a conclusion from two true premises, one a conditional whose consequent is that conclusion and the other the antecedent of that conditional, then our conclusion must be true, or that we know similar things about other simple patterns of inference. If we do indeed have knowledge of this sort, it (...) is what I mean by logical knowledge. Logical knowledge is, roughly speaking, knowledge about logic—such as knowledge that a certain principle of inference necessarily preserves truth, or that every proposition of a certain form must be true—and so is not the same thing as knowledge that is gained by using logic, i.e. inferential knowledge. That is not to say, of course, that logical knowledge can't be inferential. On the contrary, it is barely open to question that—if there is any logical knowledge at all—there is a lot of inferential logical knowledge. For example, if we know that the introduction and elimination principles for the conditional are truth-preserving, we can surely get to know, by inference, that the principle of hypothetical syllogism is so too, not to mention other, less obvious and more recondite, examples of putative logical knowledge. (shrink)

In their Basic Logic, Sambin, Battilotti and Faggian give a foundation of logical inference rules by reference to certain reflection principles. We investigate the relationship between these principles and the principle of Definitional Reflection proposed by Hallnäs and Schroeder-Heister.

We present in this paper an axiomatization of Belnap and Perloff's stit theory (a logic of "seeing to it that") with a single agent. The idea of the proof is to apply the notion of companion sets--the same notion as used in another paper by the author that showed the decidability of stit theory with a single agent and Refref equivalence.

Anti-exceptionalism about logic is the thesis that logic is not special. In this paper, I consider, and reject, a challenge to this thesis. According to this challenge, there are basic logical principles, and part of what makes such principles basic is that they are epistemically exceptional. Thus, according to this challenge, the existence of basic logical principles provides reason to reject anti-exceptionalism about logic. I argue that this challenge fails, and that the exceptionalist positions (...) motivated by it are thus unfounded. I make this case by disambiguating two senses of ‘basic’ and showing that, once this disambiguation is taken into account, the best reason we have for thinking that there are basic principles actually implies that those principles do not require a special epistemology. Consequently, the existence of basic logical principles provides reason to accept, rather than reject, anti-exceptionalism concerning the epistemology of logic. I conclude by explaining how an abductivist, anti-exceptionalist approach to the epistemology of logic can accommodate the notion of basic logical principles. (shrink)

A sequential axiomatization is given for the 16-valued logic that has been proposed by Shramko-Wansing as a candidate for the basic logic of logical bilattices.

We characterize the first-order formulas with one free variable that are preserved under bisimulation and persistence or strong persistence over the class of Kripke models with transitive frames and unary persistent predicates.

The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with |$\wedge $|⁠, |$\vee $| and |$\sim $| as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B|$^{\textrm {d}}$|⁠. It is to be noted that Boolean negation (...) (so, classical propositional logic) is definable in the strongest element in the said class. (shrink)

Biographies of Kurt Gödel tell that he gave in 1939 an introductory lecture course on logic at the University of Notre Dame. In the early 1930s, Gödel took part and presented many of hi...

In the context of truth-functional propositional many-valued logics, Hájek’s Basic Fuzzy Logic BL [14] plays a major rôle. The completeness theorem proved in [7] shows that BL is the logic of all continuous t -norms and their residua. This result, however, does not directly yield any meaningful interpretation of the truth values in BL per se . In an attempt to address this issue, in this paper we introduce a complete temporal semantics for BL. Specifically, we show (...) that BL formulas can be interpreted as modal formulas over a flow of time, where the logic of each instant is Łukasiewicz, with a finite or infinite number of truth values. As a main result, we obtain validity with respect to all flows of times that are non-branching to the future, and completeness with respect to all finite linear flows of time, or to an appropriate single infinite linear flow of time. It may be argued that this reduces the problem of establishing a meaningful interpretation of the truth values in BL logic to the analogous problem for Łukasiewicz logic. (shrink)

_Logic: The Basics_ is an accessible introduction to several core areas of logic. The first part of the book features a self-contained introduction to the standard topics in classical logic, such as: · mathematical preliminaries · propositional logic · quantified logic · English and standard ‘symbolic translations’ · tableau procedures. Alongside comprehensive coverage of the standard topics, this thoroughly revised second edition also introduces several philosophically important nonclassical logics, free logics, and modal logics, and gives the (...) reader an idea of how they can take their knowledge further. With its wealth of exercises, _Logic: The Basics _is a useful textbook for courses ranging from the introductory level to the early graduate level, and also as a reference for students and researchers in philosophical logic. (shrink)

In this article, we present the positional logic that is suitable for the formalization of reasoning about social phenomena. It is the effect of extending the Minimal Realisation (MR) logic with new expressions. These expressions allow, inter alia, to consider different points of view of social entities (humanistic coefficient). In the article, we perform a metalogical analysis of this logic. Finally, we present some simple examples of its application.

To find more information about Rowman and Littlefield titles, please visit www.rowmanlittlefield.com.

Several investigations in probability theory and the theory of expert systems show that it is important to search for some reasonable generalizations of fuzzy logics (e.g. Łukasiewicz, Gödel or product logic) having a non-associative conjunction. In the present paper, we offer a non-associative fuzzy logic L CBA having as an equivalent algebraic semantics lattices with section antitone involutions satisfying the contraposition law, so-called commutative basic algebras. The class (variety) CBA of commutative basic algebras was intensively studied (...) in several recent papers and includes the class of MV-algebras. We show that the logic L CBA is very close to the Łukasiewicz one, both having the same finite models, and can be understood as its non-associative generalization. (shrink)

Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK (...) both worlds semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK. (shrink)

This is an introductory 2001 textbook on probability and induction written by one of the world's foremost philosophers of science. The book has been designed to offer maximal accessibility to the widest range of students and assumes no formal training in elementary symbolic logic. It offers a comprehensive course covering all basic definitions of induction and probability, and considers such topics as decision theory, Bayesianism, frequency ideas, and the philosophical problem of induction. The key features of this book (...) are a lively and vigorous prose style; lucid and systematic organization and presentation of ideas; many practical applications; a rich supply of exercises drawing on examples from such fields as psychology, ecology, economics, bioethics, engineering, and political science; numerous brief historical accounts of how fundamental ideas of probability and induction developed; and a full bibliography of further reading. (shrink)

Kritičko čitanje Alchourrónove i Bulyginove skupovnoteorijske defnicije normativnoga sustava pokazuje da njegova deduktivna zatvorenost nije neizbježno svojstvo. Slijedeći von Wrightovu pretpostavku da aksiomi standardne deontične logike opisuju svojstva savršenoga normativnog sustava, uvodi se algoritam za prevođenje iz modalnoga u skupovnoteorijski jezik. Prijevod nam otkriva da plauzibilnost pojedinih metanormativnih načela leži na različitim osnovama. Koristeći se metodološkim pristupom koji prepoznaje različite aktere u normama upravljanome međudjelovanju, pokazuje se da su metanormativna načela obveze drugoga reda upućene različitim ulogama. Poseban slučaj jest zahtjev (...) koji se odnosi na deduktivnu zatvorenost jer se pokazuje da je upućen ulozi koja primjenjuje, a ne onoj koja izdaje norme. Pristup je primijenjen i na slučaj čiste derogacije, što dovodi do novoga rezultata; svojstvo neovisnosti biva svojstvom savršenoga normativnog sustava u odnosu na moguću derogaciju. Ovaj članak na polemički način dodiruje nekoliko točaka iznesenih u Kristanovome nedavnom članku. (shrink)

Fuzzy logics are in most cases based on an ad-hoc decision about the interpretation of the conjunction. If they are useful or not can typically be found out only by testing them with example data. Why we should use a specific fuzzy logic can in general not be made plausible. Since the difficulties arise from the use of additional, unmotivated structure with which the set of truth values is endowed, the only way to base fuzzy logics on firm ground (...) is the development of alternative semantics to all of whose components we can associate a meaning. In this paper, we present one possible approach to justify ex post Łukasiewicz Logic as well as Basic Logic. The notion of ambiguity is central. Our framework consists of a Boolean or a Heyting algebra, respectively, endowed with an equivalence relation expressing ambiguity. The quotient set bears naturally the structure of an MV- or a BL-algebra, respectively, and thus can be used to interpret propositions of the mentioned logics. (shrink)

The basic quasi-Boolean negation expansions of relevance logics included in Anderson and Belnap’s relevance logic R are defined. We consider two types of QB-negation: H-negation and D-negation. The former one is of paraintuitionistic or superintuitionistic character, the latter one, of dual intuitionistic nature in some sense. Logics endowed with H-negation are paracomplete; logics with D-negation are paraconsistent. All logics defined in the paper are given a Routley-Meyer ternary relational semantics.

Nonmonotonic logics were created as an abstraction of some types of common sense reasoning, analogous to the way classical logic serves to formalize ideal reasoning about mathematical objects. These logics are nonmonotonic in the sense that enlarging the set of axioms does not necessarily imply an enlargement of the set of formulas deducible from these axioms. Such situations arise naturally, for example, in the use of information of different degrees of reliability. This book emphasizes basic concepts by outlining (...) connections between different formalisms of nonmonotonic logic, and gives a coherent presentation of recent research results and reasoning techniques. It provides a self-contained state-of-the-art survey of the area addressing researchers in AI lo. (shrink)

We define a Kripke semantics for a conditional logic based on the propositional logic $$\textsf{N4}$$ N 4, the paraconsistent variant of Nelson’s logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting logic, which we call $$\textsf{N4CK}$$ N 4 CK, shows strong connections both with the basic intuitionistic logic of conditionals $$\textsf{IntCK}$$ IntCK introduced earlier in (Olkhovikov, 2023) and with the $$\textsf{N4}$$ N 4 -based modal logic $$\textsf{FSK}^d$$ FSK (...) d introduced in (Odintsov and Wansing, 2004) as one of the possible counterparts to the classical modal system $$\textsf{K}$$ K. We map these connections by looking into the embeddings which obtain between the aforementioned systems. (shrink)

Critical examination of Alchourrón and Bulygin’s set-theoretic definition of normative system shows that deductive closure is not an inevitable property. Following von Wright’s conjecture that axioms of standard deontic logic describe perfection-properties of a norm-set, a translation algorithm from the modal to the set-theoretic language is introduced. The translations reveal that the plausibility of metanormative principles rests on different grounds. Using a methodological approach that distinguishes the actor roles in a norm governed interaction, it has been shown that metanormative (...) principles are directed second-order obligations and, in particular, that the requirement related to deductive closure is directed to the norm-applier role rather than to the norm-giver role. The approach has been applied to the case of pure derogation yielding a new result, namely, that an independence property is a perfection-property of a norm-set in view of possible derogation. This paper in a polemical way touches upon several points raised by Kristan in his recent paper. (shrink)

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these extensions (...) are often justified only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

In this paper, consistency is understood in the standard way, i.e. as the absence of a contradiction. The basic constructive logic BKc4, which is adequate to this sense of consistency in the ternary relational semantics without a set of designated points, is defined. Then, it is shown how to define a series of logics by extending BKc4 up to minimal intuitionistic logic. All logics defined in this paper are paraconsistent logics.