Switch to: References

Add citations

You must login to add citations.
  1. Categorical Proof-theoretic Semantics.David Pym, Eike Ritter & Edmund Robinson - forthcoming - Studia Logica:1-38.
    In proof-theoretic semantics, model-theoretic validity is replaced by proof-theoretic validity. Validity of formulae is defined inductively from a base giving the validity of atoms using inductive clauses derived from proof-theoretic rules. A key aim is to show completeness of the proof rules without any requirement for formal models. Establishing this for propositional intuitionistic logic raises some technical and conceptual issues. We relate Sandqvist’s (complete) base-extension semantics of intuitionistic propositional logic to categorical proof theory in presheaves, reconstructing categorically the soundness and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The computational content of atomic polymorphism.Gilda Ferreira & Vasco T. Vasconcelos - 2019 - Logic Journal of the IGPL 27 (5):625-638.
    We show that the number-theoretic functions definable in the atomic polymorphic system are exactly the extended polynomials. Two proofs of the above result are presented: one, reducing the functions’ definability problem in ${\mathbf{F}}_{\mathbf{at}}$ to definability in the simply typed lambda calculus and the other, directly adapting Helmut Schwichtenberg’s strategy for definability in $\lambda ^{\rightarrow }$ to the atomic polymorphic setting. The uniformity granted in the polymorphic system, when compared with the simply typed lambda calculus, is emphasized.
    Download  
     
    Export citation  
     
    Bookmark  
  • Rasiowa–Harrop Disjunction Property.Gilda Ferreira - 2017 - Studia Logica 105 (3):649-664.
    We show that there is a purely proof-theoretic proof of the Rasiowa–Harrop disjunction property for the full intuitionistic propositional calculus ), via natural deduction, in which commuting conversions are not needed. Such proof is based on a sound and faithful embedding of \ into an atomic polymorphic system. This result strengthens a homologous result for the disjunction property of \ and answers a question then posed by Pierluigi Minari.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Elementary Proof of Strong Normalization for Atomic F.Fernando Ferreira & Gilda Ferreira - 2016 - Bulletin of the Section of Logic 45 (1):1-15.
    We give an elementary proof of the strong normalization of the atomic polymorphic calculus Fat.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • η- conversions of IPC implemented in atomic F.Gilda Ferreira - 2017 - Logic Journal of the IGPL 25 (2):115-130.
    It is known that the β-conversions of the full intuitionistic propositional calculus translate into βη-conversions of the atomic polymorphic calculus Fat. Since Fat enjoys the property of strong normalization for βη-conversions, an alternative proof of strong normalization for IPC considering β-conversions can be derived. In the present article, we improve the previous result by analysing the translation of the η-conversions of the latter calculus into a technical variant of the former system. In fact, from the strong normalization of F∧at we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Atomic polymorphism and the existence property.Gilda Ferreira - 2018 - Annals of Pure and Applied Logic 169 (12):1303-1316.
    Download  
     
    Export citation  
     
    Bookmark