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

@article{Queiroz2008OnRR, title={On Reduction Rules, Meaning-as-use, and Proof-theoretic Semantics}, author={Ruy J. G. B. de Queiroz}, journal={Studia Logica}, year={2008}, volume={90}, pages={211-247} }

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…

## Topics from this paper

## 7 Citations

The original sin of proof-theoretic semantics

- Computer ScienceSynthese
- 2018

This thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems.

Views of proof-theoretic semantics: reified proof-theoretic meanings

- Computer ScienceJ. Log. Comput.
- 2016

The paper proposes an explicit definition of meaning in terms of rules, appealing to collections of canonical derivations, in contrast to the traditional approach that regards the rules as determining meaning implicitly.

The Functional Interpretation of Direct Computations

- Computer ScienceLSFA
- 2010

A proposal to the effect that the framework of labelled natural deduction gives the right tools to formulate a proof theory for the ''logical connective'' of propositional equality in the style of the so-called Curry-Howard interpretation.

Propositional equality, identity types, and direct computational paths

- Computer Science, MathematicsArXiv
- 2011

The intention here is to show that, by considering as sequences of rewrites and substitution, it comes a rather natural fact that two (or more) distinct proofs may be yet canonical and are none to be preferred over one another.

Propositional Equality, Identity Types, and Computational Paths

- 2017

In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted that a canonical proof of a sentence must be unique up to certain minor syntactical details (such…

Inversion Principles and Introduction Rules

- Mathematics
- 2015

Following Gentzen’s practice, borrowed from intuitionist logic, Prawitz takes the introduction rule(s) for a connective to show how to prove a formula with the connective dominant. He proposes an…

## References

SHOWING 1-10 OF 39 REFERENCES

Validity Concepts in Proof-theoretic Semantics

- Mathematics, Computer ScienceSynthese
- 2004

Various notions of proof-theoretic validity are investigated in detail and particular emphasis is placed on the relationship between semantic validity concepts and validity concepts used in normalization theory.

Normalisation and Language‐Games1

- Philosophy
- 2005

The question of finding a suitable formal account of meaning for the (primitive) logical signs has troubled many philosophers and logicians since the early days of formal logic, whenever it is even…

Labelled Natural Deduction

- Mathematics
- 1999

The functional interpretation of logical connectives is concerned with a certain harmony between, on the one hand, a indexfunctional! calculus functional calculus on the expressions built up from the…

A Proof-Theoretic Account of Programming and the Role of Reduction Rules

- Philosophy
- 1988

Summary
Looking at proof theory as an attempt to ‘code’ the general pattern of the logical steps of a mathematical proof, the question of what kind of rules (introduction, elimination, reduction)…

Meaning Approached Via Proofs

- Philosophy, Computer ScienceSynthese
- 2004

According to a main idea of Gentzen the meanings of the logical constants are reflected by the introduction rules in his system of natural deduction. This idea is here understood as saying roughly…

A Natural Extension of Natural Deduction

- Computer ScienceJ. Symb. Log.
- 1984

One of the main ideas of calculi of natural deduction, as introduced by Jaśkowski and Gentzen, is that assumptions may be discharged in the course of a derivation as well as not only formulas but also rules may serve as assumptions which can be discharged.

Meaning and proofs: on the conflict between classical and intuitionistic logic

- Mathematics
- 2008

it is claimed that nothing less than the total use of the language determines the meaning of an individual sentence. This is to give up the possibility of finding any other fundamental principle of…

The Functional Interpretation of Modal Necessity

- Computer Science
- 1997

Since the early days of Kripke-style possible-worlds semantics for modalities, there has been a significant amount of research into the development of mechanisms for handling and characterising modal…

Quantifiers vs. Quantification Theory

- Computer Science
- 1973

Quantifiers have entered the Methodenstreit of contemporary linguistics in another major way, too, the idea that the structures studied in the so-called quantification theory of symbolic logic-otherwise know as first-order logic, (lower) predicate calculus, or elementary logic-can serve and suffice as semantical representations of English sentences.

The Idea of a Proof-Theoretic Semantics and the Meaning of the Logical Operations

- Mathematics, Computer ScienceStud Logica
- 2000

The first section briefly surveys various semantic paradigms, and the second focuses on one particular paradigm, namely the proof-theoretic semantics of the logical operations.