Switch to: References

Add citations

You must login to add citations.
  1. Meaning-Preserving Translations of Non-classical Logics into Classical Logic: Between Pluralism and Monism.Gerhard Schurz - 2021 - Journal of Philosophical Logic 51 (1):27-55.
    In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Why classical logic is privileged: justification of logics based on translatability.Gerhard Schurz - 2021 - Synthese 199 (5-6):13067-13094.
    In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics—multi-valued, intuitionistic, paraconsistent and quantum (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Theorems of Gödel and Kreisel: Completeness and Markov's Principle.D. C. McCarty - 1994 - Notre Dame Journal of Formal Logic 35 (1):99-107.
    In 1957, Gödel proved that completeness for intuitionistic predicate logic HPL implies forms of Markov's Principle, MP. The result first appeared, with Kreisel's refinements and elaborations, in Kreisel. Featuring large in the Gödel-Kreisel proofs are applications of the axiom of dependent choice, DC. Also in play is a form of Herbrand's Theorem, one allowing a reduction of HPL derivations for negated prenex formulae to derivations of negations of conjunctions of suitable instances. First, we here show how to deduce Gödel's results (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations