Cover Image

Non-wellfounded parsimonious proofs and non-uniform complexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Acclavio, Matteo, Curzi, Gianluca, Guerrieri, Giulio
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)

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

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

Graphical Proof Theory I: Sequent Systems on Undirected Graphs
by: Acclavio, Matteo
Published: (2023)

Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)

Coalgebraic proof translations for non-wellfounded proofs
by: Miranda, Borja Sierra, et al.
Published: (2025)

Proofs as Execution Trees for the π-Calculus
by: Acclavio, Matteo, et al.
Published: (2024)

Logic Programming with Multiplicative Structures
by: Acclavio, Matteo, et al.
Published: (2024)

Proof Nets for PiL (Full Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Intuitionistic BV (Extended version)
by: Acclavio, Matteo, et al.
Published: (2025)

Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026)

On Propositional Dynamic Logic and Concurrency
by: Acclavio, Matteo, et al.
Published: (2024)

Proof Identity and Categorical Models of BV
by: Acclavio, Matteo, et al.
Published: (2026)

Formulas as Processes, Deadlock-Freedom as Choreographies (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2025)

The Benefits of Diligence
by: Arrial, Victor, et al.
Published: (2024)

Meaningfulness and Genericity in a Subsuming Framework
by: Kesner, Delia, et al.
Published: (2024)

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

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)

A proof-theoretic approach to uniform interpolation property of multi-agent modal logic
by: Su, Youan
Published: (2025)

A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
by: Oda, Yukihiro
Published: (2025)

A proof-theoretic approach to abstract interpretation
by: D'Silva, Vijay, et al.
Published: (2026)

A method for the automated generation of proof exercises with comparable levels of proving complexity
by: Mendes, João, et al.
Published: (2026)

Cut elimination for a non-wellfounded system for the master modality
by: Miranda, Borja Sierra, et al.
Published: (2025)

Bijective proofs for Eulerian numbers of types B and D
by: Santocanale, Luigi
Published: (2021)

A logic of judgmental existence and its relation to proof irrelevance
by: Pezlar, Ivo
Published: (2024)

The proof theory and semantics of second-order (intuitionistic) tense logic
by: Becker, Justus, et al.
Published: (2026)

Indivisibility and uniform computational strength
by: Gill, Kenneth
Published: (2023)

A linear proof language for second-order intuitionistic linear logic
by: Díaz-Caro, Alejandro, et al.
Published: (2023)

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

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
by: Oda, Yukihiro, et al.
Published: (2021)

Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
by: Kozhemiachenko, Daniil
Published: (2024)

A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
by: d'Aragona, Antonio Piccolomini
Published: (2025)

A study for recovering the cut-elimination property in cyclic proof systems by restricting the arity of inductive predicates
by: Oda, Yukihiro, et al.
Published: (2022)

Short proofs without interference
by: Rebola-Pardo, Adrian
Published: (2025)

An ecumenical view of proof-theoretic semantics
by: Nascimento, Victor, et al.
Published: (2023)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

A concise proof of Commoner's theorem
by: Jancar, Petr
Published: (2024)

Between proof construction and SAT-solving
by: Schubert, Aleksy, et al.
Published: (2024)