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

@article{Queiroz2008OnRR, title={On Reduction Rules, Meaning-as-use, and Proof-theoretic Semantics}, author={R. D. 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… CONTINUE READING

#### Topics from this paper.

6 Citations

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

- Computer Science, Mathematics
- 2016

- 14

Propositional equality, identity types, and direct computational paths

- Computer Science, Mathematics
- 2011

- 11
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 39 REFERENCES

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

- Mathematics, Computer Science
- 2000

- 38