Switch to: References

Add citations

You must login to add citations.
  1. Minimal from classical proofs.Helmut Schwichtenberg & Christoph Senjak - 2013 - Annals of Pure and Applied Logic 164 (6):740-748.
    Let A be a formula without implications, and Γ consist of formulas containing disjunction and falsity only negatively and implication only positively. Orevkov and Nadathur proved that classical derivability of A from Γ implies intuitionistic derivability, by a transformation of derivations in sequent calculi. We give a new proof of this result , where the input data are natural deduction proofs in long normal form involving stability axioms for relations; the proof gives a quadratic algorithm to remove the stability axioms. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Negation-Free and Contradiction-Free Proof of the Steiner–Lehmus Theorem.Victor Pambuccian - 2018 - Notre Dame Journal of Formal Logic 59 (1):75-90.
    By rephrasing quantifier-free axioms as rules of derivation in sequent calculus, we show that the generalized Steiner–Lehmus theorem admits a direct proof in classical logic. This provides a partial answer to a question raised by Sylvester in 1852. We also present some comments on possible intuitionistic approaches.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • Constructive completions of ordered sets, groups and fields.Erik Palmgren - 2005 - Annals of Pure and Applied Logic 135 (1-3):243-262.
    In constructive mathematics it is of interest to consider a more general, but classically equivalent, notion of linear order, a so-called pseudo-order. The prime example is the order of the constructive real numbers. We examine two kinds of constructive completions of pseudo-orders: order completions of pseudo-orders and Cauchy completions of ordered groups and fields. It is shown how these can be predicatively defined in type theory, also when the underlying set is non-discrete. Provable choice principles, in particular a generalisation of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Geometrisation of first-order logic.Roy Dyckhoff & Sara Negri - 2015 - Bulletin of Symbolic Logic 21 (2):123-163.
    That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor easily found in the literature. Various approaches to the result are presented and discussed in detail, including one inspired by a problem in the proof theory of intermediate logics that led us to the proof of the present paper. It can (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  • A formalization of kant’s transcendental logic.Theodora Achourioti & Michiel van Lambalgen - 2011 - Review of Symbolic Logic 4 (2):254-289.
    Although Kant (1998) envisaged a prominent role for logic in the argumentative structure of his Critique of Pure Reason, logicians and philosophers have generally judged Kantgeneralformaltranscendental logics is a logic in the strict formal sense, albeit with a semantics and a definition of validity that are vastly more complex than that of first-order logic. The main technical application of the formalism developed here is a formal proof that Kants logic is after all a distinguished subsystem of first-order logic, namely what (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   8 citations