Switch to: References

Add citations

You must login to add citations.
  1. Structural completeness in propositional logics of dependence.Rosalie Iemhoff & Fan Yang - 2016 - Archive for Mathematical Logic 55 (7-8):955-975.
    In this paper we prove that three of the main propositional logics of dependence, none of which is structural, are structurally complete with respect to a class of substitutions under which the logics are closed. We obtain an analogous result with respect to stable substitutions, for the negative variants of some well-known intermediate logics, which are intermediate theories that are closely related to inquisitive logic.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Consequence Relations and Admissible Rules.Rosalie Iemhoff - 2016 - Journal of Philosophical Logic 45 (3):327-348.
    This paper contains a detailed account of the notion of admissibility in the setting of consequence relations. It is proved that the two notions of admissibility used in the literature coincide, and it provides an extension to multi–conclusion consequence relations that is more general than the one usually encountered in the literature on admissibility. The notion of a rule scheme is introduced to capture rules with side conditions, and it is shown that what is generally understood under the extension of (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • A meta-logic of inference rules: Syntax.Alex Citkin - 2015 - Logic and Logical Philosophy 24 (3).
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Order algebraizable logics.James G. Raftery - 2013 - Annals of Pure and Applied Logic 164 (3):251-283.
    This paper develops an order-theoretic generalization of Blok and Pigozziʼs notion of an algebraizable logic. Unavoidably, the ordered model class of a logic, when it exists, is not unique. For uniqueness, the definition must be relativized, either syntactically or semantically. In sentential systems, for instance, the order algebraization process may be required to respect a given but arbitrary polarity on the signature. With every deductive filter of an algebra of the pertinent type, the polarity associates a reflexive and transitive relation (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
    We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP-hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC) is in coNE, thus obtaining a sharp complexity estimate for admissibility in these systems.
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  • Evaluating Arguments Based on Toulmin’s Scheme.Bart Verheij - 2005 - Argumentation 19 (3):347-371.
    Toulmin’s scheme for the layout of arguments (1958, The Uses of Argument, Cambridge University Press, Cambridge) represents an influential tool for the analysis of arguments. The scheme enriches the traditional premises-conclusion model of arguments by distinguishing additional elements, like warrant, backing and rebuttal. The present paper contains a formal elaboration of Toulmin’s scheme, and extends it with a treatment of the formal evaluation of Toulmin-style arguments, which Toulmin did not discuss at all. Arguments are evaluated in terms of a so-called (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Admissible Bases Via Stable Canonical Rules.Nick Bezhanishvili, David Gabelaia, Silvio Ghilardi & Mamuka Jibladze - 2016 - Studia Logica 104 (2):317-341.
    We establish the dichotomy property for stable canonical multi-conclusion rules for IPC, K4, and S4. This yields an alternative proof of existence of explicit bases of admissible rules for these logics.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Are Uniqueness and Deducibility of Identicals the Same?Alberto Naibo & Mattia Petrolo - 2014 - Theoria 81 (2):143-181.
    A comparison is given between two conditions used to define logical constants: Belnap's uniqueness and Hacking's deducibility of identicals. It is shown that, in spite of some surface similarities, there is a deep difference between them. On the one hand, deducibility of identicals turns out to be a weaker and less demanding condition than uniqueness. On the other hand, deducibility of identicals is shown to be more faithful to the inferentialist perspective, permitting definition of genuinely proof-theoretical concepts. This kind of (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The simplest protoalgebraic logic.Josep Maria Font - 2013 - Mathematical Logic Quarterly 59 (6):435-451.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Conservative Translations Revisited.J. Ramos, J. Rasga & C. Sernadas - 2023 - Journal of Philosophical Logic 52 (3):889-913.
    We provide sufficient conditions for the existence of a conservative translation from a consequence system to another one. We analyze the problem in many settings, namely when the consequence systems are generated by a deductive calculus or by a logic system including both proof-theoretic and model-theoretic components. We also discuss reflection of several metaproperties with the objective of showing that conservative translations provide an alternative to proving such properties from scratch. We discuss soundness and completeness, disjunction property and metatheorem of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On self-admissible quasi-characterizing inference rules.V. V. Rybakov, M. Terziler & C. Gencer - 2000 - Studia Logica 65 (3):417-428.
    We study quasi-characterizing inference rules (this notion was introduced into consideration by A. Citkin (1977). The main result of our paper is a complete description of all self-admissible quasi-characterizing inference rules. It is shown that a quasi-characterizing rule is self-admissible iff the frame of the algebra generating this rule is not rigid. We also prove that self-admissible rules are always admissible in canonical, in a sense, logics S4 or IPC regarding the type of algebra generating rules.
    Download  
     
    Export citation  
     
    Bookmark  
  • KD is nullary.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):196-205.
    In the ordinary modal language, KD is the modal logic determined by the class of all serial frames. In this paper, we demonstrate that KD is nullary.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Unification and Passive Inference Rules for Modal Logics.V. V. Rybakov, M. Terziler & C. Gencer - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):369-377.
    ABSTRACT We1 study unification of formulas in modal logics and consider logics which are equivalent w.r.t. unification of formulas. A criteria is given for equivalence w.r.t. unification via existence or persistent formulas. A complete syntactic description of all formulas which are non-unifiable in wide classes of modal logics is given. Passive inference rules are considered, it is shown that in any modal logic over D4 there is a finite basis for passive rules.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • One Modal Logic to Rule Them All?Wesley H. Holliday & Tadeusz Litak - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic, Vol. 12. College Publications. pp. 367-386.
    In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is complete with respect to (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • On the Logic of Belief and Propositional Quantification.Yifeng Ding - 2021 - Journal of Philosophical Logic 50 (5):1143-1198.
    We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as “everything I believe is true” or “there is something that I neither believe nor disbelieve.” Our main results are axiomatizations of the logics with propositional quantifiers of natural classes of complete Boolean algebras with an operator validating KD45. Among them is the class of complete, atomic, and completely multiplicative BAOs validating KD45. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Unification in modal logic Alt1.Philippe Balbiani & Tinko Tinchev - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 117-134.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Admissibility in Positive Logics.Alex Citkin - 2017 - Logica Universalis 11 (4):421-437.
    The paper studies admissibility of multiple-conclusion rules in positive logics. Using modification of a method employed by M. Wajsberg in the proof of the separation theorem, it is shown that the problem of admissibility of multiple-conclusion rules in the positive logics is equivalent to the problem of admissibility in intermediate logics defined by positive additional axioms. Moreover, a multiple-conclusion rule \ follows from a set of multiple-conclusion rules \ over a positive logic \ if and only if \ follows from (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Unification in epistemic logics.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):91-105.
    Epistemic logics are essential to the design of logical systems that capture elements of reasoning about knowledge. In this paper, we study the computability of unifiability and the unification types in several epistemic logics.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The logic of Brouwer and Heyting.Joan Rand Moschovakis - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 77-125.
    Download  
     
    Export citation  
     
    Bookmark  
  • Solving the $100 modal logic challenge.Florian Rabe, Petr Pudlák, Geoff Sutcliffe & Weina Shen - 2009 - Journal of Applied Logic 7 (1):113-130.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Rules with parameters in modal logic I.Emil Jeřábek - 2015 - Annals of Pure and Applied Logic 166 (9):881-933.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On unification and admissible rules in Gabbay–de Jongh logics.Jeroen P. Goudsmit & Rosalie Iemhoff - 2014 - Annals of Pure and Applied Logic 165 (2):652-672.
    In this paper we study the admissible rules of intermediate logics. We establish some general results on extensions of models and sets of formulas. These general results are then employed to provide a basis for the admissible rules of the Gabbay–de Jongh logics and to show that these logics have finitary unification type.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On Finite Model Property for Admissible Rules.Vladimir V. Rybakov, Vladimir R. Kiyatkin & Tahsin Oner - 1999 - Mathematical Logic Quarterly 45 (4):505-520.
    Our investigation is concerned with the finite model property with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The Context of Inference.Curtis Franks - 2018 - History and Philosophy of Logic 39 (4):365-395.
    There is an ambiguity in the concept of deductive validity that went unnoticed until the middle of the twentieth century. Sometimes an inference rule is called valid because its conclusion is a theorem whenever its premises are. But often something different is meant: The rule's conclusion follows from its premises even in the presence of other assumptions. In many logical environments, these two definitions pick out the same rules. But other environments are context-sensitive, and in these environments the second notion (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Announcement as effort on topological spaces.Hans van Ditmarsch, Sophia Knight & Aybüke Özgün - 2019 - Synthese 196 (7):2927-2969.
    We propose a multi-agent logic of knowledge, public announcements and arbitrary announcements, interpreted on topological spaces in the style of subset space semantics. The arbitrary announcement modality functions similarly to the effort modality in subset space logics, however, it comes with intuitive and semantic differences. We provide axiomatizations for three logics based on this setting, with S5 knowledge modality, and demonstrate their completeness. We moreover consider the weaker axiomatizations of three logics with S4 type of knowledge and prove soundness and (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Leo Esakia on Duality in Modal and Intuitionistic Logics.Guram Bezhanishvili (ed.) - 2014 - Dordrecht, Netherland: Springer.
    This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Structural Completeness in Substructural Logics.J. S. Olson, J. G. Raftery & C. J. Van Alten - 2008 - Logic Journal of the IGPL 16 (5):453-495.
    Hereditary structural completeness is established for a range of substructural logics, mainly without the weakening rule, including fragments of various relevant or many-valued logics. Also, structural completeness is disproved for a range of systems, settling some previously open questions.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Inversion by definitional reflection and the admissibility of logical rules: Inversion by definitional reflection.Wagner De Campos Sanz - 2009 - Review of Symbolic Logic 2 (3):550-569.
    The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister. Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible when (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Inversion by definitional reflection and the admissibility of logical rules.Wagner Campos Sanz & Thomas Piecha - 2009 - Review of Symbolic Logic 2 (3):550-569.
    The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister . Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On Rules.Rosalie Iemhoff - 2015 - Journal of Philosophical Logic 44 (6):697-711.
    This paper contains a brief overview of the area of admissible rules with an emphasis on results about intermediate and modal propositional logics. No proofs are given but many references to the literature are provided.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Projective Beth Property in Extensions of Grzegorczyk Logic.Larisa Maksimova - 2006 - Studia Logica 83 (1):365-391.
    All extensions of the modal Grzegorczyk logic Grz possessing projective Beth's property PB2 are described. It is proved that there are exactly 13 logics over Grz with PB2. All of them are finitely axiomatizable and have the finite model property. It is shown that PB2 is strongly decidable over Grz, i.e. there is an algorithm which, for any finite system Rul of additional axiom schemes and rules of inference, decides if the calculus Grz+Rul has the projective Beth property.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Computing Minimal EL-unifiers is Hard.Franz Baader, Stefan Borgwardt & Barbara Morawska - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 18-35.
    Download  
     
    Export citation  
     
    Bookmark  
  • Probabilization of Logics: Completeness and Decidability. [REVIEW]Pedro Baltazar - 2013 - Logica Universalis 7 (4):403-440.
    The probabilization of a logic system consists of enriching the language (the formulas) and the semantics (the models) with probabilistic features. Such an operation is said to be exogenous if the enrichment is done on top, without internal changes to the structure, and is called endogenous otherwise. These two different enrichments can be applied simultaneously to the language and semantics of a same logic. We address the problem of studying the transference of metaproperties, such as completeness and decidability, to the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Hereditarily Structurally Complete Superintuitionistic Deductive Systems.Alex Citkin - 2018 - Studia Logica 106 (4):827-856.
    Propositional logic is understood as a set of theorems defined by a deductive system: a set of axioms and a set of rules. Superintuitionistic logic is a logic extending intuitionistic propositional logic \. A rule is admissible for a logic if any substitution that makes each premise a theorem, makes the conclusion a theorem too. A deductive system \ is structurally complete if any rule admissible for the logic defined by \ is derivable in \. It is known that any (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The bounded proof property via step algebras and step frames.Nick Bezhanishvili & Silvio Ghilardi - 2014 - Annals of Pure and Applied Logic 165 (12):1832-1863.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Strongly decidable properties of modal and intuitionistic calculi.L. Maksimova - 2000 - Logic Journal of the IGPL 8 (6):797-819.
    Let a logical propositional calculus L0 be given. We consider arbitrary extensions of L0 by adding finitely many new axiom schemes and rules of inference. We say that a property of P of logical calculi is strongly decidable over L0 if there is an algorithm which for any finite system Rul of axiom schemes and rules of inference decides whether the system L0 + Rul has the property P or not. We consider only so-called structural rules of inference which are (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations