Files in this item
Some remarks on proof-theoretic semantics
Item metadata
dc.contributor.author | Dyckhoff, Roy | |
dc.contributor.editor | Piecha, Thomas | |
dc.contributor.editor | Schroeder-Heister, Peter | |
dc.date.accessioned | 2016-02-05T15:10:15Z | |
dc.date.available | 2016-02-05T15:10:15Z | |
dc.date.issued | 2016 | |
dc.identifier | 181527166 | |
dc.identifier | 1d457e84-6f57-4c46-b801-dc0037067670 | |
dc.identifier | 000369235900005 | |
dc.identifier | 85015501590 | |
dc.identifier.citation | Dyckhoff , R 2016 , Some remarks on proof-theoretic semantics . in T Piecha & P Schroeder-Heister (eds) , Advances in Proof-Theoretic Semantics . Trends in Logic , vol. 43 , Springer , pp. 79-93 , Second Conference on Proof-Theoretic Semantics , Tübingen , Germany , 8/03/13 . https://doi.org/10.1007/978-3-319-22686-6_5 | en |
dc.identifier.citation | conference | en |
dc.identifier.isbn | 9783319226859 | |
dc.identifier.isbn | 9783319226866 | |
dc.identifier.issn | 1572-6126 | |
dc.identifier.uri | https://hdl.handle.net/10023/8155 | |
dc.description.abstract | This is a tripartite work. The first part is a brief discussion of what it is to be a logical constant, rejecting a view that allows a particular self-referential “constant” • to be such a thing in favour of a view that leads to strong normalisation results. The second part is a commentary on the flattened version of Modus Ponens, and its relationship with rules of type theory. The third part is a commentary on work (joint with Nissim Francez) on “general elimination rules” and harmony, with a retraction of one of the main ideas of that work, i.e. the use of “flattened” general elimination rules for situations with discharge of assumptions. We begin with some general background on general elimination rules. | |
dc.format.extent | 15 | |
dc.format.extent | 175055 | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartof | Advances in Proof-Theoretic Semantics | en |
dc.relation.ispartofseries | Trends in Logic | en |
dc.subject | General elimination rules | en |
dc.subject | Harmony | en |
dc.subject | Strong normalisation | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | BC Logic | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | BC | en |
dc.title | Some remarks on proof-theoretic semantics | en |
dc.type | Book item | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1007/978-3-319-22686-6_5 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | http://ls.informatik.uni-tuebingen.de/PTS/ | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.