Roy Dyckhoff

Publication Activity (10 Years)

Years Active: 1992-2019
Publications (10 Years): 7

Top Topics

Sequent Calculi

Regular Expressions

Top Venues

Bull. Symb. Log.

ACM Trans. Comput. Log.

J. Log. Comput.

Publications

Roy Dyckhoff
Indirect Proof and Inversions of Syllogisms. Bull. Symb. Log. 25 (2) (2019)
Susanne Bobzien, Roy Dyckhoff
Analyticity, Balance and Non-admissibility of $$\varvec{Cut}$$ Cut in Stoic Logic. Stud Logica 107 (2) (2019)
Roy Dyckhoff
Contraction-Free Sequent Calculi for intuitionistic Logic: a correction. J. Symb. Log. 83 (4) (2018)
Roy Dyckhoff, Sara Negri
Commentary on Grigori Mints' "Classical and Intuitionistic Geometric Logic". FLAP 4 (4) (2017)
Fahad Ausaf, Roy Dyckhoff, Christian Urban
POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl). ITP (2016)
Roy Dyckhoff, Sara Negri
A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding. J. Log. Comput. 26 (1) (2016)
Fahad Ausaf, Roy Dyckhoff, Christian Urban
POSIX Lexing with Derivatives of Regular Expressions. Arch. Formal Proofs 2016 (2016)
Roy Dyckhoff, Sara Negri
Geometrisation of First-order Logic. Bull. Symb. Log. 21 (2) (2015)
Roy Dyckhoff
Invited Talk: Coherentisation of First-Order Logic. TABLEAUX (2015)
Roy Dyckhoff, Mehrnoosh Sadrzadeh, Julien Truffaut
Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators. ACM Trans. Comput. Log. 14 (4) (2013)
Roy Dyckhoff, Sara Negri
Proof analysis in intermediate logics. Arch. Math. Log. 51 (1-2) (2012)
Nissim Francez, Roy Dyckhoff
A Note on Harmony. J. Philos. Log. 41 (3) (2012)
Roy Dyckhoff, Mehrnoosh Sadrzadeh, Julien Truffaut
Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators. MFPS (2012)
Stéphane Lengrand, Roy Dyckhoff, James McKinna
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems Log. Methods Comput. Sci. 7 (1) (2011)
Mehrnoosh Sadrzadeh, Roy Dyckhoff
Positive Logic with adjoint Modalities: Proof Theory, Semantics, and Reasoning about Information. Rev. Symb. Log. 3 (3) (2010)
Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi
Proof-Theoretic Semantics for Subsentential Phrases. Stud Logica 94 (3) (2010)
Nissim Francez, Roy Dyckhoff
Proof-Theoretic Semantics for a Natural Language Fragment. MOL (2009)
Mehrnoosh Sadrzadeh, Roy Dyckhoff
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information. MFPS (2009)
Mehrnoosh Sadrzadeh, Roy Dyckhoff
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information CoRR (2009)
Roy Dyckhoff, Stéphane Lengrand
Call-by-Value lambda-calculus and LJQ. J. Log. Comput. 17 (6) (2007)
Stéphane Lengrand, Roy Dyckhoff, James McKinna
A Sequent Calculus for Type Theory. CSL (2006)
Kevin Hammond, Christian Ferdinand, Reinhold Heckmann, Roy Dyckhoff, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace
Towards Formally Verifiable WCET Analysis for a Functional Programming Language. WCET (2006)
Roy Dyckhoff, Sara Negri
Decision methods for linearly ordered Heyting algebras. Arch. Math. Log. 45 (4) (2006)
Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. IJCAR (2006)
Roy Dyckhoff, Stéphane Lengrand
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. CiE (2006)
Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, Steffen Jost, Hans-Wolfgang Loidl, Greg Michaelson, Robert F. Pointon, Norman Scaife, Jocelyn Sérot, Andy Wallace
The Embounded project (project start paper). Trends in Functional Programming (2005)
Roy Dyckhoff, Christian Urban
Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation. J. Log. Comput. 13 (5) (2003)
Roy Dyckhoff, Sara Negri
Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi. Log. J. IGPL 9 (4) (2001)
Roy Dyckhoff, Heinrich Wansing
Editorial. Stud Logica 69 (2) (2001)
Roy Dyckhoff, Heinrich Wansing
Editorial. Stud Logica 69 (1) (2001)
Roy Dyckhoff, Sara Negri
Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. J. Symb. Log. 65 (4) (2000)
Roy Dyckhoff, Luís Pinto
Permutability of Proofs in Intuitionistic Sequent Calculi. Theor. Comput. Sci. 212 (1-2) (1999)
Roy Dyckhoff
A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic. Log. J. IGPL 7 (3) (1999)
Luís Pinto, Roy Dyckhoff
Sequent Calculi for the Normal Terms of the - and - Calculi. Electron. Notes Theor. Comput. Sci. 17 (1998)
Roy Dyckhoff, Luís Pinto
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Stud Logica 60 (1) (1998)
Roy Dyckhoff, Luís Pinto
Uniform Proofs and Natural Deduction. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming (1994)
Roy Dyckhoff, Natarajan Shankar
Proof Search (Tutorial). ICLP Workshop: Proof-Theoretical Extensions on Logic Programming (1994)
Roy Dyckhoff
Introduction to ELP'93. ELP (1993)
Roy Dyckhoff
Contraction-Free Sequent Calculi for Intuitionistic Logic. J. Symb. Log. 57 (3) (1992)