Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorDyckhoff, Roy
dc.contributor.editorPiecha, Thomas
dc.contributor.editorSchroeder-Heister, Peter
dc.date.accessioned2016-02-05T15:10:15Z
dc.date.available2016-02-05T15:10:15Z
dc.date.issued2016
dc.identifier181527166
dc.identifier1d457e84-6f57-4c46-b801-dc0037067670
dc.identifier000369235900005
dc.identifier85015501590
dc.identifier.citationDyckhoff , 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_5en
dc.identifier.citationconferenceen
dc.identifier.isbn9783319226859
dc.identifier.isbn9783319226866
dc.identifier.issn1572-6126
dc.identifier.urihttps://hdl.handle.net/10023/8155
dc.description.abstractThis 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.extent15
dc.format.extent175055
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofAdvances in Proof-Theoretic Semanticsen
dc.relation.ispartofseriesTrends in Logicen
dc.subjectGeneral elimination rulesen
dc.subjectHarmonyen
dc.subjectStrong normalisationen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectBC Logicen
dc.subject.lccQA75en
dc.subject.lccBCen
dc.titleSome remarks on proof-theoretic semanticsen
dc.typeBook itemen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1007/978-3-319-22686-6_5
dc.description.statusPeer revieweden
dc.identifier.urlhttp://ls.informatik.uni-tuebingen.de/PTS/en


This item appears in the following Collection(s)

Show simple item record