default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoy Dyckhoff
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j24]Roy Dyckhoff:
Indirect Proof and Inversions of Syllogisms. Bull. Symb. Log. 25(2): 196-207 (2019)- [j23]Susanne Bobzien, Roy Dyckhoff
:
Analyticity, Balance and Non-admissibility of $$\varvec{Cut}$$ Cut in Stoic Logic. Stud Logica 107(2): 375-397 (2019) - 2018
- [j22]Roy Dyckhoff:
Contraction-Free Sequent Calculi for intuitionistic Logic: a correction. J. Symb. Log. 83(4): 1680-1682 (2018) - 2017
- [j21]Roy Dyckhoff, Sara Negri:
Commentary on Grigori Mints' "Classical and Intuitionistic Geometric Logic". FLAP 4(4) (2017) - 2016
- [j20]Fahad Ausaf, Roy Dyckhoff, Christian Urban:
POSIX Lexing with Derivatives of Regular Expressions. Arch. Formal Proofs 2016 (2016) - [j19]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): 169-187 (2016) - [c14]Fahad Ausaf, Roy Dyckhoff, Christian Urban:
POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl). ITP 2016: 69-86 - [p1]Roy Dyckhoff:
Some Remarks on Proof-Theoretic Semantics. Advances in Proof-Theoretic Semantics 2016: 79-93 - 2015
- [j18]Roy Dyckhoff, Sara Negri:
Geometrisation of First-order Logic. Bull. Symb. Log. 21(2): 123-163 (2015) - [c13]Roy Dyckhoff:
Invited Talk: Coherentisation of First-Order Logic. TABLEAUX 2015: 3-5 - 2013
- [j17]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): 34:1-34:37 (2013) - 2012
- [j16]Roy Dyckhoff, Sara Negri:
Proof analysis in intermediate logics. Arch. Math. Log. 51(1-2): 71-92 (2012) - [j15]Nissim Francez, Roy Dyckhoff:
A Note on Harmony. J. Philos. Log. 41(3): 613-628 (2012) - [c12]Roy Dyckhoff, Mehrnoosh Sadrzadeh, Julien Truffaut:
Algebra, Proof Theory and Applications for a Logic of Propositions, Actions and Adjoint Modal Operators. MFPS 2012: 157-172 - 2011
- [j14]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) - 2010
- [j13]Mehrnoosh Sadrzadeh, Roy Dyckhoff:
Positive Logic with adjoint Modalities: Proof Theory, Semantics, and Reasoning about Information. Rev. Symb. Log. 3(3): 351-373 (2010) - [j12]Nissim Francez, Roy Dyckhoff, Gilad Ben-Avi:
Proof-Theoretic Semantics for Subsentential Phrases. Stud Logica 94(3): 381-401 (2010)
2000 – 2009
- 2009
- [c11]Nissim Francez, Roy Dyckhoff:
Proof-Theoretic Semantics for a Natural Language Fragment. MOL 2009: 56-71 - [c10]Mehrnoosh Sadrzadeh, Roy Dyckhoff:
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information. MFPS 2009: 451-470 - [i1]Mehrnoosh Sadrzadeh, Roy Dyckhoff:
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information. CoRR abs/0903.2448 (2009) - 2007
- [j11]Roy Dyckhoff, Stéphane Lengrand:
Call-by-Value lambda-calculus and LJQ. J. Log. Comput. 17(6): 1109-1134 (2007) - 2006
- [j10]Roy Dyckhoff, Sara Negri:
Decision methods for linearly ordered Heyting algebras. Arch. Math. Log. 45(4): 411-422 (2006) - [c9]Roy Dyckhoff, Delia Kesner, Stéphane Lengrand:
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. IJCAR 2006: 347-361 - [c8]Roy Dyckhoff, Stéphane Lengrand:
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. CiE 2006: 173-185 - [c7]Stéphane Lengrand, Roy Dyckhoff, James McKinna:
A Sequent Calculus for Type Theory. CSL 2006: 441-455 - [c6]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 - 2005
- [c5]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: 195-210 - 2003
- [j9]Roy Dyckhoff, Christian Urban:
Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation. J. Log. Comput. 13(5): 689-706 (2003) - 2001
- [j8]Roy Dyckhoff, Sara Negri:
Admissibility of Structural Rules for Extensions of Contraction-Free Sequent Calculi. Log. J. IGPL 9(4): 541-548 (2001) - [j7]Roy Dyckhoff, Heinrich Wansing:
Editorial. Stud Logica 69(1): 3-4 (2001) - [j6]Roy Dyckhoff, Heinrich Wansing:
Editorial. Stud Logica 69(2): 195-196 (2001) - 2000
- [j5]Roy Dyckhoff, Sara Negri:
Admissibility of Structural Rules for Contraction-Free Systems of Intuitionistic Logic. J. Symb. Log. 65(4): 1499-1518 (2000) - [e4]Roy Dyckhoff:
Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000, Proceedings. Lecture Notes in Computer Science 1847, Springer 2000, ISBN 3-540-67697-X [contents]
1990 – 1999
- 1999
- [j4]Roy Dyckhoff:
A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic. Log. J. IGPL 7(3): 319-326 (1999) - [j3]Roy Dyckhoff, Luís Pinto:
Permutability of Proofs in Intuitionistic Sequent Calculi. Theor. Comput. Sci. 212(1-2): 141-155 (1999) - 1998
- [j2]Roy Dyckhoff, Luís Pinto:
Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic. Stud Logica 60(1): 107-118 (1998) - [c4]Luís Pinto, Roy Dyckhoff:
Sequent Calculi for the Normal Terms of the - and - Calculi. Proof Search in Type-Theoretic Languages@CADE 1998: 1-14 - 1996
- [e3]Roy Dyckhoff, Heinrich Herre, Peter Schroeder-Heister:
Extensions of Logic Programming, 5th International Workshop, ELP'96, Leipzig, Germany, March 28-30, 1996, Proceedings. Lecture Notes in Computer Science 1050, Springer 1996, ISBN 3-540-60983-0 [contents] - 1994
- [c3]Roy Dyckhoff, Luís Pinto:
Uniform Proofs and Natural Deduction. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming 1994 - [c2]Roy Dyckhoff, Natarajan Shankar:
Proof Search (Tutorial). ICLP Workshop: Proof-Theoretical Extensions on Logic Programming 1994 - [e2]Roy Dyckhoff:
Extensions of Logic Programming, 4th International Workshop, ELP'93, St. Andrews, UK, March 29 - April 1, 1993, Proceedings. Lecture Notes in Computer Science 798, Springer 1994, ISBN 3-540-58025-5 [contents] - [e1]Roy Dyckhoff, Lars-Henrik Eriksson, Alberto Momigliano, Mario Ornaghi:
ICLP 1994, Workshop W10: Proof-Theoretical Extensions on Logic Programming, Santa Margherita Ligure, Italy, June 1994. 1994 [contents] - 1993
- [c1]Roy Dyckhoff:
Introduction to ELP'93. ELP 1993: 1-2 - 1992
- [j1]Roy Dyckhoff:
Contraction-Free Sequent Calculi for Intuitionistic Logic. J. Symb. Log. 57(3): 795-807 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
