Roy Dyckhoff

According to our database, Roy Dyckhoff authored at least 37 papers between 1992 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Analyticity, Balance and Non-admissibility of $$\varvec{Cut}$$ Cut in Stoic Logic.

Susanne Bobzien, Roy Dyckhoff

Stud Logica, 2019

Indirect Proof and Inversions of Syllogisms.

Roy Dyckhoff

Bull. Symb. Log., 2019

2018

Contraction-Free Sequent Calculi for intuitionistic Logic: a correction.

Roy Dyckhoff

J. Symb. Log., 2018

2017

Commentary on Grigori Mints' "Classical and Intuitionistic Geometric Logic".

Roy Dyckhoff, Sara Negri

FLAP, 2017

2016

A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel-McKinsey-Tarski embedding.

Roy Dyckhoff, Sara Negri

J. Log. Comput., 2016

POSIX Lexing with Derivatives of Regular Expressions.

Fahad Ausaf, Roy Dyckhoff, Christian Urban

Arch. Formal Proofs, 2016

POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl).

Fahad Ausaf, Roy Dyckhoff, Christian Urban

Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Some Remarks on Proof-Theoretic Semantics.

Roy Dyckhoff

Proceedings of the Advances in Proof-Theoretic Semantics., 2016

2015

Geometrisation of First-order Logic.

Roy Dyckhoff, Sara Negri

Bull. Symb. Log., 2015

Invited Talk: Coherentisation of First-Order Logic.

Roy Dyckhoff

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015

2013

Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators.

Roy Dyckhoff, Mehrnoosh Sadrzadeh, Julien Truffaut

ACM Trans. Comput. Log., 2013

2012

A Note on Harmony.

Nissim Francez, Roy Dyckhoff

J. Philos. Log., 2012

Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators.

Roy Dyckhoff, Mehrnoosh Sadrzadeh, Julien Truffaut

Proceedings of the 28th Conference on the Mathematical Foundations of Programming Semantics, 2012

Proof analysis in intermediate logics.

Roy Dyckhoff, Sara Negri

Arch. Math. Log., 2012

2011

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems

Stéphane Lengrand, Roy Dyckhoff, James McKinna

Log. Methods Comput. Sci., 2011

2010

Proof-Theoretic Semantics for Subsentential Phrases.

Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi

Stud Logica, 2010

Positive Logic with adjoint Modalities: Proof Theory, Semantics, and Reasoning about Information.

Mehrnoosh Sadrzadeh, Roy Dyckhoff

Rev. Symb. Log., 2010

2009

Proof-Theoretic Semantics for a Natural Language Fragment.

Nissim Francez, Roy Dyckhoff

Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

2007

Call-by-Value lambda-calculus and LJQ.

Roy Dyckhoff, Stéphane Lengrand

J. Log. Comput., 2007

2006

Decision methods for linearly ordered Heyting algebras.

Roy Dyckhoff, Sara Negri

Arch. Math. Log., 2006

Towards Formally Verifiable WCET Analysis for a Functional Programming Language.

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

Proceedings of the 6th Intl. Workshop on Worst-Case Execution Time (WCET) Analysis, 2006

A Sequent Calculus for Type Theory.

Stéphane Lengrand, Roy Dyckhoff, James McKinna

Proceedings of the Computer Science Logic, 20th International Workshop, 2006

LJQ: A Strongly Focused Calculus for Intuitionistic Logic.

Roy Dyckhoff, Stéphane Lengrand

Proceedings of the Logical Approaches to Computational Barriers, 2006

Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.

Roy Dyckhoff, Delia Kesner, Stéphane Lengrand

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005

The Embounded project (project start paper).

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

Proceedings of the Revised Selected Papers from the Sixth Symposium on Trends in Functional Programming, 2005

2003

Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation.

Roy Dyckhoff, Christian Urban

J. Log. Comput., 2003

2001

Editorial.

Roy Dyckhoff, Heinrich Wansing

Stud Logica, 2001

Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi.

Roy Dyckhoff, Sara Negri

Log. J. IGPL, 2001

2000

Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic.

Roy Dyckhoff, Sara Negri

J. Symb. Log., 2000

1999

Permutability of Proofs in Intuitionistic Sequent Calculi.

Roy Dyckhoff, Luís Pinto

Theor. Comput. Sci., 1999

A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic.

Roy Dyckhoff

Log. J. IGPL, 1999

1998

Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic.

Roy Dyckhoff, Luís Pinto

Stud Logica, 1998

Sequent Calculi for the Normal Terms of the - and - Calculi.

Luís Pinto, Roy Dyckhoff

Proceedings of the Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), 1998

1994

Proof Search (Tutorial).

Roy Dyckhoff, Natarajan Shankar

Proceedings of the ICLP 1994, 1994

Uniform Proofs and Natural Deduction.

Roy Dyckhoff, Luís Pinto

Proceedings of the ICLP 1994, 1994

1993

Introduction to ELP'93.

Roy Dyckhoff

Proceedings of the Extensions of Logic Programming, 4th International Workshop, 1993

1992

Contraction-Free Sequent Calculi for Intuitionistic Logic.

Roy Dyckhoff

J. Symb. Log., 1992