Switch to: References

Add citations

You must login to add citations.
  1. Continuation-passing style models complete for intuitionistic logic.Danko Ilik - 2013 - Annals of Pure and Applied Logic 164 (6):651-662.
    A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic . The proofs of soundness and completeness are constructive and the computational content of their composition is, in particular, a β-normalisation-by-evaluation program for simply typed lambda calculus with sum types. Although the inspiration comes from Danvyʼs type-directed partial evaluator for the same lambda calculus, the use of delimited control operators is avoided. The role of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Kripke models for classical logic.Danko Ilik, Gyesik Lee & Hugo Herbelin - 2010 - Annals of Pure and Applied Logic 161 (11):1367-1378.
    We introduce a notion of the Kripke model for classical logic for which we constructively prove the soundness and cut-free completeness. We discuss the novelty of the notion and its potential applications.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Isomorphic formulae in classical propositional logic.Kosta Došen & Zoran Petrić - 2012 - Mathematical Logic Quarterly 58 (1):5-17.
    Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions. Characterizations are given for pairs of isomorphic formulae, which lead to decision procedures for this isomorphism.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • An intuitionistic formula hierarchy based on high‐school identities.Taus Brock-Nannestad & Danko Ilik - 2019 - Mathematical Logic Quarterly 65 (1):57-79.
    We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal) propositional sequent calculi are formula (i.e., sequent) isomorphisms corresponding to the high‐school identities, we show that one can obtain a more compact variant of a proof system, consisting of non‐invertible proof rules only, and where the invertible proof rules have been replaced by a formula normalization procedure. Moreover, for (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • On models of exponentiation. Identities in the HSI-algebra of posets.Gurgen Asatryan - 2008 - Mathematical Logic Quarterly 54 (3):280-287.
    We prove that Wilkie's identity holds in those natural HSI-algebras where each element has finite decomposition into components.Further, we construct a bunch of HSI-algebras that satisfy all the identities of the set of positive integers ℕ. Then, based on the constructed algebras, we prove that the identities of ℕ hold in the HSI-algebra of finite posets when the value of each variable is a poset having an isolated point.
    Direct download  
     
    Export citation  
     
    Bookmark