Roy Dyckhoff
Roy Dyckhoff
Hon. Senior Lecturer, St Andrews University
Verified email at st-andrews.ac.uk - Homepage
Title
Cited by
Cited by
Year
Contraction-free sequent calculi for intuitionistic logic
R Dyckhoff
The Journal of Symbolic Logic 57 (3), 795-807, 1992
4221992
Exponentiable morphisms, partial products and pullback complements
R Dyckhoff, W Tholen
Journal of Pure and Applied Algebra 49 (1-2), 103-116, 1987
931987
Proof analysis in intermediate logics
R Dyckhoff, S Negri
Archive for Mathematical Logic 51 (1-2), 71-92, 2012
752012
Proof-theoretic semantics for a natural language fragment
N Francez, R Dyckhoff
Linguistics and Philosophy 33 (6), 447-477, 2010
712010
Loop-free construction of counter-models in intuitionistic propositional logic
L Pinto, R Dyckhoff
Mathematics and Theoretical Physics, 225-232, 2011
652011
A note on harmony
N Francez, R Dyckhoff
Journal of Philosophical Logic 41 (3), 613-628, 2012
632012
A deterministic terminating sequent calculus for Gödel-Dummett logic
R Dyckhoff
Logic Journal of the IGPL 7 (3), 319-326, 1999
601999
Permutability of proofs in intuitionistic sequent calculi
R Dyckhoff, L Pinto
Theoretical Computer Science 212 (1-2), 141-155, 1999
581999
LJQ: a strongly focused calculus for intuitionistic logic
R Dyckhoff, S Lengrand
Conference on Computability in Europe, 173-185, 2006
492006
Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
R Dyckhoff, L Pinto
Studia Logica 60 (1), 107-118, 1998
471998
Geometrisation of first-order logic
R Dyckhoff, S Negri
The Bulletin of Symbolic Logic, 123-163, 2015
452015
Admissibility of structural rules for contraction-free systems of intuitionistic logic
R Dyckhoff, S Negri
Journal of Symbolic Logic, 1499-1518, 2000
412000
Implementing a simple proof assistant
R Dyckhoff
Workshop on Programming for Logic Teaching, Leeds, July, 1987
391987
Proof-theoretic semantics for subsentential phrases
N Francez, R Dyckhoff, G Ben-Avi
Studia Logica 94 (3), 381-401, 2010
362010
Call-by-value λ-calculus and LJQ
R Dyckhoff, S Lengrand
Journal of Logic and Computation 17 (6), 1109-1134, 2007
332007
A permutation-free sequent calculus for intuitionistic logic
R Dyckhoff, L Pinto
University of St Andrews Research Report CS/96/9, 1996
331996
Strong normalization of Herbelin's explicit substitution calculus with substitution propagation
R Dyckhoff, C Urban
Journal of Logic and Computation 13 (5), 689-706, 2003
312003
Factorisation theorems and projective spaces in topology
R Dyckhoff
Mathematische Zeitschrift 127 (3), 256-264, 1972
261972
A focused sequent calculus framework for proof search in Pure Type Systems
SJE Lengrand, R Dyckhoff, J McKinna
arXiv preprint arXiv:1012.3372, 2010
242010
Intuitionistic decision procedures since Gentzen
R Dyckhoff
Advances in Proof Theory, 245-267, 2016
222016
The system can't perform the operation now. Try again later.
Articles 1–20