Movatterモバイル変換


[0]ホーム

URL:


PhilPapersPhilPeoplePhilArchivePhilEventsPhilJobs
Switch to: References

Add citations

You mustlogin to add citations.
  1. A Simple Way to Overcome Hyperconnexivity.Alex Belikov -2023 -Studia Logica 112 (1):69-94.
    The term ‘hyperconnexive logic’ (or ‘hyperconnexivity’ in general) in relation to a certain logical system was coined by Sylvan to indicate that not only do Boethius’ theses hold in such a system, but also their converses. The plausibility of the latter was questioned by some connexive logicians. Without going into the discussion regarding the plausibility of hyperconnexivity and the converses of Boethius’ theses, this paper proposes a quite simple way to escape the hyperconnexivity within the semantic framework of Wansing-style constructive (...) connexive logics. In particular, we present a working method for escaping hyperconnexivity of constructive connexive logic $${{\textbf{C}}}$$, discuss the problem that creates an obstacle to using the same method in the case of logic $${{\textbf{C3}}}$$ and provide a possible solution to this problem that allows us to construct a logical theory which is similar to $${{\textbf{C3}}}$$ and free from hyperconnexivity. All new logics introduced in this paper are equipped with sound and complete Hilbert-style calculi, and their relationships with other well-known connexive logics are discussed. (shrink)
    Direct download(3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Falsification-Aware Semantics and Sequent Calculi for Classical Logic.Norihiro Kamide -2021 -Journal of Philosophical Logic 51 (1):99-126.
    In this study, falsification-aware semantics and sequent calculi for first-order classical logic are introduced and investigated. These semantics and sequent calculi are constructed based on a falsification-aware setting for first-order Nelson constructive three-valued logic. In fact, these semantics and sequent calculi are regarded as those for a classical variant of N3. The completeness and cut-elimination theorems for the proposed semantics and sequent calculi are proved using Schütte’s method. Similar results for the propositional case are also obtained.
    Direct download(3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A relationship between Rauszer's HB logic and Nelson's logic'.Norihiro Kamide -2004 -Bulletin of the Section of Logic 33 (4):237-249.
  • Rules of Explosion and Excluded Middle: Constructing a Unified Single-Succedent Gentzen-Style Framework for Classical, Paradefinite, Paraconsistent, and Paracomplete Logics.Norihiro Kamide -2024 -Journal of Logic, Language and Information 33 (2):143-178.
    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)
    Direct download(4 more)  
     
    Export citation  
     
    Bookmark  
  • Notes on Craig interpolation for LJ with strong negation.Norihiro Kamide -2011 -Mathematical Logic Quarterly 57 (4):395-399.
    The Craig interpolation theorem is shown for an extended LJ with strong negation. A new simple proof of this theorem is obtained. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  

  • [8]ページ先頭

    ©2009-2025 Movatter.jp