Skip to content

Research at St Andrews

Some remarks on proof-theoretic semantics

Research output: Research - peer-reviewChapter (peer-reviewed)


Open Access permissions



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.


Original languageEnglish
Title of host publicationAdvances in Proof-Theoretic Semantics
EditorsThomas Piecha, Peter Schroeder-Heister
Number of pages15
ISBN (Electronic)9783319226866
ISBN (Print)9783319226859
StatePublished - 2016
EventSecond Conference on Proof-Theoretic Semantics - Schloß Hohentübingen, Seminarraum 165, Tübingen, Germany
Duration: 8 Mar 201310 Mar 2013

Publication series

NameTrends in Logic
ISSN (Print)1572-6126


ConferenceSecond Conference on Proof-Theoretic Semantics

    Research areas

  • General elimination rules, Harmony, Strong normalisation

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Analyticity, balance and non-admissibility of Cut in Stoic Logic

    Bobzien, S. & Dyckhoff, R. 20 Apr 2018 In : Studia Logica. First Online, 23 p.

    Research output: Research - peer-reviewArticle

  2. Intuitionistic decision procedures since Gentzen

    Dyckhoff, R. 5 May 2016 Advances in Proof Theory. Kahle, R., Strahm, T. & Studer, T. (eds.). Birkhäuser Basel, p. 245-267 (Progress in Computer Science and Applied Logic; vol. 28)

    Research output: Research - peer-reviewChapter (peer-reviewed)

  3. POSIX lexing with derivatives of regular expressions (proof pearl)

    Ausaf, F., Dyckhoff, R. & Urban, C. 2016 Interactive Theorem Proving: 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings. Blanchette, J. C. & Merz, S. (eds.). Springer, p. 69-86 18 p. (Lecture Notes in Computer Science; vol. 9807)

    Research output: ResearchConference contribution

  4. Geometrisation of first-order logic

    Dyckhoff, R. & Negri, S. Jun 2015 In : Bulletin of Symbolic Logic. 21, 2, p. 123–163 41 p.

    Research output: Research - peer-reviewArticle

ID: 181527166