Proof-Theoretic Semantics: Some Basic Ideas

DSpace Repository


Dateien:

URI: http://hdl.handle.net/10900/131188
http://nbn-resolving.de/urn:nbn:de:bsz:21-dspace-1311885
http://dx.doi.org/10.15496/publikation-72548
http://nbn-resolving.org/urn:nbn:de:bsz:21-dspace-1311888
http://nbn-resolving.org/urn:nbn:de:bsz:21-dspace-1311882
Dokumentart: Other
Date: 2022
Language: English
Faculty: 7 Mathematisch-Naturwissenschaftliche Fakultät
Department: Informatik
DDC Classifikation: 004 - Data processing and computer science
100 - Philosophy
Keywords: Logik , Beweistheorie
Other Keywords: Beweistheoretische Semantik
Proof Theory
Logic
Proof-Theoretic Semantics
License: http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=de http://tobias-lib.uni-tuebingen.de/doku/lic_mit_pod.php?la=en
Order a printed copy: Print-on-Demand
Show full item record

Abstract:

This manuscript of 2003 describes and compares two basic approaches to what the author has called “proof-theoretic semantics”. The “standard” approach, which is mainly due to Dummett and Prawitz, attempts to give a semantics of proofs by defining what counts as a valid proof. The second one, which is based on ideas by Hallnäs and the author, understands proofs semantically by reading the application of certain proof rules directly as semantical steps. Whereas the first one is a global approach, dealing with proofs as a whole and imposing requirements on them, the second one is local as is interprets individual proof steps without demanding from the very beginning that a proof composed of such single steps has special features. -- The attached manuscript on proof-theoretic vs. constructive consequence argues that the proof-theoretic notion fully specifies reduction procedures and is nearer to term rewriting than the more general constructive notion.

This item appears in the following Collection(s)