https://apcz.umk.pl/LLP/issue/feedLogic and Logical Philosophy2024-02-16T18:41:40+01:00Andrzej Pietruszczakllp@umk.plOpen Journal Systems<p><em>Logic and Logical Philosophy</em> is a journal chiefly devoted to philosophical logic and philosophy resulting from applying logical tools to philosophical problems. Other applications of logic to related disciplines are not excluded.</p> <p>Beginning with 2016, <em>Logic and Logical Philosophy</em> is being indexed and abstracted in Emerging Sources Citation Index in Clarivate Analytics products and services (<a href="http://ip-science.thomsonreuters.com/cgi-bin/jrnlst/jlresults.cgi?PC=MASTER&ISSN=1425-3305">Web of Science Master Journal List</a>). <em>LLP</em> is included in two categories: philosophy and logic. In the 2022 Journal Citation Reports (JCR)<em>, </em> the JIF index for <em>LLP</em> is 0.5. Moreover, the JCI index for <em>LLP</em> is 1.06. This value gives <em>LLP</em> (<a href="https://jcr-1clarivate-1com-1pa7m29q62633.han3.uci.umk.pl/jcr-jp/journal-profile?journal=LOG%20LOG%20PHILOS&year=2020&fromPage=%2Fjcr%2Fbrowse-journals&SID=H3-JZyy6gg7XqbrX5s9l8oMfmuhCMBGuuKX-18x2dCrI6CaTt8clTPTpUU0DGKQx3Dx3DI5vvpjan6wPorHx2B3Pa4tWwx3Dx3D-WwpRYkX4Gz8e7T4uNl5SUQx3Dx3D-wBEj1mx2B0mykql8H4kstFLwx3Dx3D">link</a>): <br />• the third place in the category of logic: JCI rank 3/25, JCI quartile Q1, JCI percentile 90.00; <br />• the 57th place in the category of philosophy: JCI rank 57/326, JCI quartile Q1, JCI percentile 82.67.</p> <p><em>Logic and Logical Philosophy</em> has been indexed in the Scopus database since 2011. According to their 2022 results:<br />• Scopus CiteScore™ for <em>LLP</em> is 1.8. This value gives <em>LLP</em> the 86th percentile for a journal of philosophy (<a href="https://www.scopus.com/sourceid/21100204110">link</a>).<br />• CWTS Journal Indicator SNIP (Source Normalized Impact for Publication) for <em>LLP</em> is 1.29. This value gives <em>LLP</em> the 87th percentile for a journal of philosophy (<a href="https://www.journalindicators.com/indicators/journal/21100204110">link</a>).<br />• Scimago Journal Rank gave <em>LLP </em>status Q1 for a journal of philosophy <a href="https://www.scimagojr.com/journalsearch.php?q=21100204110&tip=sid&clean=0">(link)</a>.</p>https://apcz.umk.pl/LLP/article/view/42258Procedural Semantics and its Relevance to Paradox2023-02-17T23:02:27+01:00Elbert BooijE.J.Booij@uva.nl<p>Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances.</p>2023-07-18T00:00:00+02:00Copyright (c) 2023 Elbert Booijhttps://apcz.umk.pl/LLP/article/view/39253KD45 with Propositional Quantifiers2023-02-17T08:57:04+01:00P. Maurice Dekkerpmauricedekker@gmail.com<p>Steinsvold (2020) has provided two semantics for the basic modal language enriched with propositional quantifiers (∀p). We define an extension EM of the system KD45_{\Box} and prove that EM is sound and complete for both semantics. It follows that the two semantics are equivalent.</p>2023-08-24T00:00:00+02:00Copyright (c) 2023 P. Maurice Dekkerhttps://apcz.umk.pl/LLP/article/view/35945A Monadic Second-Order Version of Tarski’s Geometry of Solids2021-12-23T21:15:59+01:00Patrick Barlatierpatrick.barlatier@univ-smb.frRichard Dapoignyrichard.dapoigny@univ-smb.fr<p>In this paper, we are concerned with the development of a general set theory using the single axiom version of Leśniewski’s mereology. The specification of mereology, and further of Tarski’s geometry of solids will rely on the Calculus of Inductive Constructions (CIC). In the first part, we provide a specification of Leśniewski’s mereology as a model for an atomless Boolean algebra using Clay’s ideas. In the second part, we interpret Leśniewski’s mereology in monadic second-order logic using names and develop a full version of mereology referred to as CIC-based Monadic Mereology (λ-MM) allowing an expressive theory while involving only two axioms. In the third part, we propose a modeling of Tarski’s solid geometry relying on λ-MM. It is intended to serve as a basis for spatial reasoning. All parts have been proved using a translation in type theory.</p>2023-10-19T00:00:00+02:00Copyright (c) 2023 Patrick Barlatier, Richard Dapoignyhttps://apcz.umk.pl/LLP/article/view/44151Some Remarks on the Logic of Probabilistic Relevance2023-05-22T18:23:41+02:00Davide Faziodfazio2@unite.itRaffaele Mascellarmascella@unite.it<p>In this paper we deepen some aspects of the statistical approach to relevance by providing logics for the syntactical treatment of probabilistic relevance relations. Specifically, we define conservative expansions of Classical Logic endowed with a ternary connective ⇝ - indeed, a constrained material implication - whose intuitive reading is “x materially implies y and it is relevant to y under the evidence z”. In turn, this ensures the definability of a formula in three-variables R(x, z, y) which is the representative of relevance in the object language. We outline the algebraic semantics of such logics, and we apply the acquired machinery to investigate some termdefined weakly connexive implications with some intuitive appeal. As a consequence, a further motivation of (weakly) connexive principles in terms of relevance and background assumptions obtains.</p>2023-12-12T00:00:00+01:00Copyright (c) 2023 Davide Fazio, Raffaele Mascellahttps://apcz.umk.pl/LLP/article/view/44353Logical Form, Conditionals, Pseudo-Conditionals2023-06-02T17:23:38+02:00Andrea Iaconaandrea.iacona@unito.it<div class="page" title="Page 1"> <div class="layoutArea"> <div class="column"> <p>This paper raises some questions about the formalization of sentences containing ‘if’ or similar expressions. In particular, it focuses on three kinds of sentences that resemble conditionals in some respects but exhibit distinctive logical features that deserve separate consideration: whether-or-not sentences, biscuit conditionals, and concessive conditionals. As will be suggested, the examples discussed show in different ways that an adequate formalization of a sentence must take into account the content expressed by the sentence. This upshot is arguably what one should expect on the view that logical form is determined by truth conditions.</p> </div> </div> </div>2024-01-22T00:00:00+01:00Copyright (c) 2024 Andrea Iaconahttps://apcz.umk.pl/LLP/article/view/43638Robert Trueman’s Defence of Higher-Order Logic2023-04-19T23:40:24+02:00Marcin Tkaczyk70tygodni@gmail.com<p>The paper contains a review and a discussion of Robert Trueman's book <em>Properties and Propositions: The Metaphysics of Higher-Order Logic</em>, Cambridge University Press, 2021, pp. xii + 227. ISBN 978-1-108-81410-2. The discussion is focused on the consistency of Truema's language-based ontology and on its value in defending higher-order logic.</p>2023-05-23T00:00:00+02:00Copyright (c) 2023 Marcin Tkaczyk