On Reduction Rules, Meaning-as-use, and Proof-theoretic Semantics

  title={On Reduction Rules, Meaning-as-use, and Proof-theoretic Semantics},
  author={R. D. Queiroz},
  journal={Studia Logica},
  • R. D. Queiroz
  • Published 2008
  • Computer Science, Mathematics
  • Studia Logica
  • The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest… CONTINUE READING

    Topics from this paper.

    Views of proof-theoretic semantics: reified proof-theoretic meanings
    • 14
    Propositional equality, identity types, and direct computational paths
    • 11
    • PDF
    Inversion Principles and Introduction Rules
    • 9


    Publications referenced by this paper.
    Validity Concepts in Proof-theoretic Semantics
    • 68
    • PDF
    Normalisation and Language‐Games1
    • 4
    Labelled Natural Deduction
    • 12
    A Proof-Theoretic Account of Programming and the Role of Reduction Rules
    • 12
    A Natural Extension of Natural Deduction
    • 192
    • PDF
    Meaning Approached Via Proofs
    • 91
    • PDF
    The Functional Interpretation of Modal Necessity
    • 16
    Quantifiers vs. Quantification Theory
    • 147
    • PDF
    The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations
    • 38