Imagen de Portada

Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Curzi, Gianluca, Leigh, Graham E.
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
por: Acclavio, Matteo, et al.
Publicado: (2023)

Cyclic Implicit Complexity
por: Curzi, Gianluca, et al.
Publicado: (2021)

Computational expressivity of (circular) proofs with fixed points
por: Curzi, Gianluca, et al.
Publicado: (2023)

Cyclic proof theory of positive inductive definitions
por: Curzi, Gianluca, et al.
Publicado: (2025)

Non-wellfounded parsimonious proofs and non-uniform complexity
por: Acclavio, Matteo, et al.
Publicado: (2024)

On the Cut Elimination of Weak Intuitionistic Tense Logic
por: Wang, Yiheng, et al.
Publicado: (2024)

Unravelling Cyclic First-Order Arithmetic
por: Leigh, Graham E., et al.
Publicado: (2025)

Cut-Elimination for the Bimodal Logic GR
por: Kushida, Hirohiko
Publicado: (2026)

IMELL Cut Elimination with Linear Overhead
por: Accattoli, Beniamino, et al.
Publicado: (2024)

Demystifying $μ$
por: Afshari, Bahareh, et al.
Publicado: (2024)

A Semantic Proof of Generalised Cut Elimination for Deep Inference
por: Atkey, Robert, et al.
Publicado: (2024)

Syntactic Cut-Elimination for Provability Logic GL via Nested Sequents
por: Maniwa, Akinori, et al.
Publicado: (2024)

Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
por: Accattoli, Beniamino
Publicado: (2022)

Compression for Coinductive Infinitary Rewriting: A Generic Approach, with Applications to Cut-Elimination for Non-Wellfounded Proofs
por: Cerda, Rémy, et al.
Publicado: (2025)

Cut-elimination for the alternation-free modal mu-calculus
por: Afshari, Bahareh, et al.
Publicado: (2025)

Cut-free Deductive System for Continuous Intuitionistic Logic
por: Geoffroy, Guillaume
Publicado: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
por: Grilletti, Gianluca, et al.
Publicado: (2024)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
por: Afshari, Bahareh, et al.
Publicado: (2024)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

The Limit of Recursion in State-based Systems
por: Afshari, Bahareh, et al.
Publicado: (2025)

A Cut-free Sequent Calculus for Basic Intuitionistic Dynamic Topological Logic
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2025)

Goedel Logics: On the Elimination of The Absoluteness Operator
por: Baaz, Matthias, et al.
Publicado: (2026)

SAT-Inspired Higher-Order Eliminations
por: Blanchette, Jasmin, et al.
Publicado: (2022)

On Efficient Algorithms For Partial Quantifier Elimination
por: Goldberg, Eugene
Publicado: (2024)

Partial Quantifier Elimination By Certificate Clauses
por: Goldberg, Eugene
Publicado: (2020)

Effective AGM Belief Contraction: A Journey beyond the Finitary Realm (Technical Report)
por: Klumpp, Dominik, et al.
Publicado: (2024)

Eliminating reversals from cubical type theories
por: Cavallo, Evan, et al.
Publicado: (2026)

On Symbol Elimination and Uniform Interpolation in Theory Extensions
por: Sofronie-Stokkermans, Viorica
Publicado: (2025)

Structure-Aware Computing, Partial Quantifier Elimination And SAT
por: Goldberg, Eugene
Publicado: (2024)

The Proof-Theoretic Origin of Double Negation Introduction & Elimination
por: Irani, Khashayar
Publicado: (2025)

Variable Elimination as Rewriting in a Linear Lambda Calculus
por: Ehrhard, Thomas, et al.
Publicado: (2025)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Pseudo-Complex Quantifier Elimination
por: Faroß, Nicolas, et al.
Publicado: (2026)

Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
por: Amat, Nicolas, et al.
Publicado: (2024)

Making first order linear logic a generating grammar
por: Slavnov, Sergey
Publicado: (2022)

Uniform Cut-free Bisequent Calculi for Three-valued Logics
por: Indrzejczak, Andrzej, et al.
Publicado: (2024)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
por: Balasubramanian, A. R., et al.
Publicado: (2020)

One-Parametric Presburger Arithmetic has Quantifier Elimination
por: Mansutti, Alessio, et al.
Publicado: (2025)

Quantifier Elimination Meets Treewidth
por: Wu, Hao, et al.
Publicado: (2026)

Quantifier Elimination and Craig Interpolation, Quantitatively
por: Batz, Kevin, et al.
Publicado: (2025)