Cyclic Implicit Complexity
Fuente:
arXiv
Saved in:
| Main Authors: | Curzi, Gianluca, Das, Anupam |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computational expressivity of (circular) proofs with fixed points
by: Curzi, Gianluca, et al.
Published: (2023)
by: Curzi, Gianluca, et al.
Published: (2023)
Cyclic proof theory of positive inductive definitions
by: Curzi, Gianluca, et al.
Published: (2025)
by: Curzi, Gianluca, et al.
Published: (2025)
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026)
by: Curzi, Gianluca, et al.
Published: (2026)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, et al.
Published: (2024)
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
by: Acclavio, Matteo, et al.
Published: (2023)
by: Acclavio, Matteo, et al.
Published: (2023)
Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)
by: Das, Anupam, et al.
Published: (2026)
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
Undecidability of theories of semirings with fixed points
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)
by: Grilletti, Gianluca, et al.
Published: (2024)
The proof theory and semantics of second-order (intuitionistic) tense logic
by: Becker, Justus, et al.
Published: (2026)
by: Becker, Justus, et al.
Published: (2026)
Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)
by: Leigh, Graham E., et al.
Published: (2025)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Cyclic Proofs for iGL via Corecursion
by: Miranda, Borja Sierra
Published: (2023)
by: Miranda, Borja Sierra
Published: (2023)
Enumerating Independent Linear Inferences
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)
by: Afshari, Bahareh, et al.
Published: (2024)
The Complexity of the Constructive Master Modality
by: Santiago-Fernández, Sofía, et al.
Published: (2026)
by: Santiago-Fernández, Sofía, et al.
Published: (2026)
Hyperarithmetical Complexity of Infinitary Action Logic with Multiplexing
by: Pshenitsyn, Tikhon
Published: (2023)
by: Pshenitsyn, Tikhon
Published: (2023)
On the complexity of normalization for the planar $λ$-calculus
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Proof Complexity of Linear Logics
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
by: Tabatabai, Amirhossein Akbar, et al.
Published: (2026)
Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)
by: Oliveira, Igor C.
Published: (2025)
Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets
by: Atserias, Albert, et al.
Published: (2024)
by: Atserias, Albert, et al.
Published: (2024)
Information Flow Control in Cyclic Process Networks
by: Heuvel, Bas van den, et al.
Published: (2024)
by: Heuvel, Bas van den, et al.
Published: (2024)
Admissibility of Substitution Rule in Cyclic-Proof Systems
by: Saotome, Kenji, et al.
Published: (2025)
by: Saotome, Kenji, et al.
Published: (2025)
Asynchronous Session-Based Concurrency: Deadlock-freedom in Cyclic Process Networks
by: Heuvel, Bas van den, et al.
Published: (2021)
by: Heuvel, Bas van den, et al.
Published: (2021)
List types for resource aware languages: an implicit name approach
by: Ghilezan, Silvia, et al.
Published: (2021)
by: Ghilezan, Silvia, et al.
Published: (2021)
Bijective proofs for Eulerian numbers of types B and D
by: Santocanale, Luigi
Published: (2021)
by: Santocanale, Luigi
Published: (2021)
Gödel-McKinsey-Tarski and (not quite) Blok-Esakia for Heyting-Lewis Implication
by: de Groot, Jim, et al.
Published: (2021)
by: de Groot, Jim, et al.
Published: (2021)
Duality for Normal Lattice Expansions and Sorted, Residuated Frames with Relations
by: Hartonas, Chrysafis
Published: (2021)
by: Hartonas, Chrysafis
Published: (2021)
Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)
by: Spreen, Dieter, et al.
Published: (2021)
The Pebble-Relation Comonad in Finite Model Theory
by: Montacute, Yoàv, et al.
Published: (2021)
by: Montacute, Yoàv, et al.
Published: (2021)
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
by: Oda, Yukihiro, et al.
Published: (2021)
by: Oda, Yukihiro, et al.
Published: (2021)
Dynamic Cantor Derivative Logic
by: Fernández-Duque, David, et al.
Published: (2021)
by: Fernández-Duque, David, et al.
Published: (2021)
On Small Types in Univalent Foundations
by: de Jong, Tom, et al.
Published: (2021)
by: de Jong, Tom, et al.
Published: (2021)
Universal Horn Sentences and the Joint Embedding Property
by: Bodirsky, Manuel, et al.
Published: (2021)
by: Bodirsky, Manuel, et al.
Published: (2021)
Comparing and Contrasting Arrow's Impossibility Theorem and Gödel's Incompleteness Theorem
by: Livson, Ori, et al.
Published: (2025)
by: Livson, Ori, et al.
Published: (2025)
A study of cut-elimination for a non-labelled cyclic proof system for propositional dynamic logics
by: Oda, Yukihiro
Published: (2025)
by: Oda, Yukihiro
Published: (2025)
Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)
by: Gaßner, Christine
Published: (2025)
Similar Items
-
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) -
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026) -
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025) -
Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, et al.
Published: (2024)