Switch to: References

Add citations

You must login to add citations.
  1. Peter Schroeder-Heister on Proof-Theoretic Semantics.Thomas Piecha & Kai F. Wehmeier (eds.) - 2024 - Springer.
    This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Eta-rules in Martin-löf type theory.Ansten Klev - 2019 - Bulletin of Symbolic Logic 25 (3):333-359.
    The eta rule for a set A says that an arbitrary element of A is judgementally identical to an element of constructor form. Eta rules are not part of what may be called canonical Martin-Löf type theory. They are, however, justified by the meaning explanations, and a higher-order eta rule is part of that type theory. The main aim of this paper is to clarify this somewhat puzzling situation. It will be argued that lower-order eta rules do not, whereas the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Intensional Harmony as Isomorphism.Paolo Pistone & Luca Tranchini - 2024 - In Thomas Piecha & Kai F. Wehmeier (eds.), Peter Schroeder-Heister on Proof-Theoretic Semantics. Springer. pp. 315-337.
    In the present paper we discuss a recent suggestion of Schroeder-Heister concerning the possibility of defining an intensional notion of harmony using isomorphism in second-order propositional logic. The latter is not an absolute notion, but its definition is relative to the choice of criteria for identity of proofs. In the paper, it is argued that in order to attain a satisfactory account of harmony, one has to consider a notion of identity stronger than the usual one (based on β- and (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Weak typed Böhm theorem on IMLL.Satoshi Matsuoka - 2007 - Annals of Pure and Applied Logic 145 (1):37-90.
    In the Böhm theorem workshop on Crete, Zoran Petric called Statman’s “Typical Ambiguity theorem” the typed Böhm theorem. Moreover, he gave a new proof of the theorem based on set-theoretical models of the simply typed lambda calculus. In this paper, we study the linear version of the typed Böhm theorem on a fragment of Intuitionistic Linear Logic. We show that in the multiplicative fragment of intuitionistic linear logic without the multiplicative unit the weak typed Böhm theorem holds. The system IMLL (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Identity of proofs based on normalization and generality.Kosta Došen - 2003 - Bulletin of Symbolic Logic 9 (4):477-503.
    Some thirty years ago, two proposals were made concerning criteria for identity of proofs. Prawitz proposed to analyze identity of proofs in terms of the equivalence relation based on reduction to normal form in natural deduction. Lambek worked on a normalization proposal analogous to Prawitz's, based on reduction to cut-free form in sequent systems, but he also suggested understanding identity of proofs in terms of an equivalence relation based on generality, two derivations having the same generality if after generalizing maximally (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  • What is the Meaning of Proofs?: A Fregean Distinction in Proof-Theoretic Semantics.Sara Ayhan - 2020 - Journal of Philosophical Logic 50 (3):571-591.
    The origins of proof-theoretic semantics lie in the question of what constitutes the meaning of the logical connectives and its response: the rules of inference that govern the use of the connective. However, what if we go a step further and ask about the meaning of a proof as a whole? In this paper we address this question and lay out a framework to distinguish sense and denotation of proofs. Two questions are central here. First of all, if we have (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Linear realizability and full completeness for typed lambda-calculi.Samson Abramsky & Marina Lenisa - 2005 - Annals of Pure and Applied Logic 134 (2-3):122-168.
    We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models over them which are fully complete, inter alia, w.r.t. the following languages and theories: the fragment of System F consisting of ML-types, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The relational model is injective for Multiplicative Exponential Linear Logic (without weakenings).Daniel de Carvalho & Lorenzo Tortora de Falco - 2012 - Annals of Pure and Applied Logic 163 (9):1210-1236.
    Download  
     
    Export citation  
     
    Bookmark