Imagen de Portada

Proof Compression via Subatomic Logic and Guarded Substitutions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Barrett, Victoria, Guglielmi, Alessio, Ralph, Benjamin, Straßburger, Lutz
Formato:	Preprint
Publicado:	2025
Materias:	Logic in Computer Science 03F03 F.4.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
por: Barroso-Nascimento, Victor, et al.
Publicado: (2025)

Glivenko's theorems from an ecumenical perspective
por: Pereira, Luiz Carlos, et al.
Publicado: (2026)

Coinductive proof search for polarized logic with applications to full intuitionistic propositional logic
por: Santo, José Espírito, et al.
Publicado: (2020)

Cut elimination for propositional cyclic proof systems with fixed-point operators
por: Hori, Hiromasa, et al.
Publicado: (2023)

Structural focalization
por: Simmons, Robert J.
Publicado: (2011)

Effective bases and notions of effective second countability in computable analysis
por: Brattka, Vasco, et al.
Publicado: (2025)

First-Order Fischer Servi Logic
por: Christensen, Ahmee
Publicado: (2024)

Axiomatizing the Logic of Ordinary Discourse
por: Greati, Vitor, et al.
Publicado: (2024)

ProofCloud: A Proof Retrieval Engine for Verified Proofs in Higher Order Logic
por: Wang, Shuai
Publicado: (2024)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
por: Grotenhuis, Lide, et al.
Publicado: (2026)

Local-Order-Invariant Logic on Classes of Bounded Degree
por: Aoki, Derek
Publicado: (2025)

A New Ehrenfeucht-Fraïssé Game for Dependence Logic
por: Puljujärvi, Joni, et al.
Publicado: (2026)

Coalgebraic Satisfiability Checking for Arithmetic $μ$-Calculi
por: Hausmann, Daniel, et al.
Publicado: (2022)

Logic in Mathematics and Computer Science
por: Zach, Richard
Publicado: (2024)

The Golden Path to Guarded Monotone Strict NP
por: Barsukov, Alexey, et al.
Publicado: (2023)

A Logspace Constructive Proof of L=SL
por: Buss, Sam, et al.
Publicado: (2025)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
por: Cerda, Rémy, et al.
Publicado: (2022)

Propositional Dynamic Logic has Craig Interpolation: a tableau-based proof
por: Borzechowski, Manfred, et al.
Publicado: (2025)

A Guide to Krivine Realizability for Set Theory
por: Matthews, Richard
Publicado: (2023)

Fractal Analysis on the Real Interval: A Constructive Approach via Fractal Countability
por: Semenov, Stanislav
Publicado: (2025)

Continuations and Completeness in Proof-theoretic Semantics
por: Gu, Tao, et al.
Publicado: (2026)

Graded Semantics and Graded Logics for Eilenberg-Moore Coalgebras
por: Forster, Jonas, et al.
Publicado: (2023)

Exploring the abyss in Kleene's computability theory
por: Sanders, Sam
Publicado: (2023)

On some computational properties of open sets
por: Normann, Dag, et al.
Publicado: (2024)

Reopening of the conjecture about the decidability of Quasi-Dense Modal Logics (Comments on Lyon & Ostropolski-Nalewaja's result)
por: Gasquet, Olivier
Publicado: (2025)

Symmetries in Sorting
por: Choudhury, Vikraman, et al.
Publicado: (2025)

Thoughts on sub-Turing interactive computability
por: Japaridze, Giorgi
Publicado: (2024)

Weihrauch problems as containers
por: Pradic, Cécilia, et al.
Publicado: (2025)

Proof complexity of universal algebra in a CSP dichotomy proof
por: Gaysin, Azza
Publicado: (2024)

Agent Interpolation for Knowledge
por: Bílková, Marta, et al.
Publicado: (2025)

Internal Effectful Forcing in System T
por: Escardo, Martin H., et al.
Publicado: (2025)

Evaluating Autoformalization Robustness via Semantically Similar Paraphrasing
por: Moore, Hayden, et al.
Publicado: (2025)

A proof complexity conjecture and the Incompleteness theorem
por: Krajicek, Jan
Publicado: (2023)

Undecidability in Relevant Logic
por: Knudstorp, Søren Brinck
Publicado: (2026)

Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory
por: Gylterud, Håkon Robbestad, et al.
Publicado: (2020)

Rough sets semantics for the three-valued extension of first-order Priest's da Costa logic
por: Castiglioni, José Luis, et al.
Publicado: (2025)

Sheaves as oracle computations
por: Ahman, Danel, et al.
Publicado: (2026)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
por: Tabatabai, Amirhossein Akbar, et al.
Publicado: (2025)

Hereditary First-Order Logic: the tractable quantifier prefix classes
por: Bodirsky, Manuel, et al.
Publicado: (2024)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
por: Anttila, Aleksi, et al.
Publicado: (2025)