Graham Emil Leigh

Orcid: 0000-0002-0335-7983

According to our database1, Graham Emil Leigh authored at least 31 papers between 2010 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm.
CoRR, February, 2026

Tarskian theories of Krivine's classical realizability.
J. Log. Comput., 2026

2025
Herbrand schemes for first-order logic.
Arch. Math. Log., November, 2025

Unravelling Cyclic First-Order Arithmetic.
CoRR, July, 2025

Proof Systems for two-Way Modal <i>μ</i>-Calculus.
J. Symb. Log., 2025

Demystifying μ.
Fundam. Informaticae, 2025

2024
The Limit of Recursion in State-based Systems.
Proceedings of the Proceedings Twelfth Workshop on Fixed Points in Computer Science, November, 2024

Revisiting the conservativity of fixpoints over intuitionistic arithmetic.
Arch. Math. Log., February, 2024

Cyclic proofs for the first-order µ-calculus.
Log. J. IGPL, January, 2024

From GTC to : Generating reset proof systems from cyclic proof systems.
Ann. Pure Appl. Log., 2024

A Compositional Theory of Krivine's Classical Realisability.
Proceedings of the Logic, Language, Information, and Computation, 2024

Intuitionistic Master Modality.
Proceedings of the Advances in Modal Logic, AiML 2024, Prague, Czech Republic, 2024

2023
Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2023

A Cyclic Proof System for Full Computation Tree Logic.
Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022
The Copernican Multiverse of Sets.
Rev. Symb. Log., 2022

2021
Uniform Interpolation from Cyclic Proofs: The Case of Modal Mu-Calculus.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

2020
Herbrand's theorem as higher order recursion.
Ann. Pure Appl. Log., 2020

2019
An Infinitary Treatment of Full Mu-Calculus.
Proceedings of the Logic, Language, Information, and Computation, 2019

From Paradox to Truth - An Introduction to Self-reference in Formal Language.
Proceedings of the Language, Logic, and Computation - 13th International Tbilisi Symposium, 2019

Lyndon Interpolation for Modal μ-Calculus.
Proceedings of the Language, Logic, and Computation - 13th International Tbilisi Symposium, 2019

2017
Cut-free completeness for modal mu-calculus.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Reflecting on Truth.
FLAP, 2016

On the Herbrand content of LK.
Proceedings of the Proceedings Sixth International Workshop on Classical Logic and Computation, 2016

2015
Conservativity for Theories of Compositional Truth via Cut Elimination.
J. Symb. Log., 2015

Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars.
Proceedings of the 13th International Conference on Typed Lambda Calculi and Applications, 2015

2013
Axiomatic Truth, Syntax and Metatheoretic Reasoning.
Rev. Symb. Log., 2013

A proof-theoretic account of classical principles of truth.
Ann. Pure Appl. Log., 2013

On closure ordinals for the modal mu-calculus.
Proceedings of the Computer Science Logic 2013, 2013

2012
Revision Revisited.
Rev. Symb. Log., 2012

The Friedman - Sheard programme in intuitionistic logic.
J. Symb. Log., 2012

2010
An ordinal analysis for theories of self-referential truth.
Arch. Math. Log., 2010


  Loading...