Cyclic proof theory of positive inductive definitions
Fuente:
arXiv
Saved in:
| Main Authors: | Curzi, Gianluca, Melgaard, Lukas |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021)
by: Curzi, Gianluca, et al.
Published: (2021)
Computational expressivity of (circular) proofs with fixed points
by: Curzi, Gianluca, et al.
Published: (2023)
by: Curzi, Gianluca, et al.
Published: (2023)
Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, et al.
Published: (2024)
by: Acclavio, Matteo, 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)
by: Oda, Yukihiro, et al.
Published: (2021)
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)
Infinitary Cut-Elimination for Non-Wellfounded Parsimonious Linear Logic
by: Acclavio, Matteo, et al.
Published: (2023)
by: Acclavio, Matteo, et al.
Published: (2023)
A topological reading of inductive and coinductive definitions in Dependent Type Theory
by: Sabelli, Pietro
Published: (2024)
by: Sabelli, Pietro
Published: (2024)
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)
by: Oda, Yukihiro, et al.
Published: (2022)
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)
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)
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 right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
by: Di Guardia, Rémi, et al.
Published: (2026)
by: Di Guardia, Rémi, et al.
Published: (2026)
Sharing proofs with predicative theories through universe-polymorphic elaboration
by: Felicissimo, Thiago, et al.
Published: (2023)
by: Felicissimo, Thiago, et al.
Published: (2023)
Unravelling Cyclic First-Order Arithmetic
by: Leigh, Graham E., et al.
Published: (2025)
by: Leigh, Graham E., et al.
Published: (2025)
A proof-theoretic approach to abstract interpretation
by: D'Silva, Vijay, et al.
Published: (2026)
by: D'Silva, Vijay, 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)
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
by: Benedikt, Michael, et al.
Published: (2022)
by: Benedikt, Michael, et al.
Published: (2022)
Cyclic Proofs for iGL via Corecursion
by: Miranda, Borja Sierra
Published: (2023)
by: Miranda, Borja Sierra
Published: (2023)
Bijective proofs for Eulerian numbers of types B and D
by: Santocanale, Luigi
Published: (2021)
by: Santocanale, Luigi
Published: (2021)
A logic of judgmental existence and its relation to proof irrelevance
by: Pezlar, Ivo
Published: (2024)
by: Pezlar, Ivo
Published: (2024)
Extracting efficient exact real number computation from proofs in constructive type theory
by: Konečný, Michal, et al.
Published: (2022)
by: Konečný, Michal, et al.
Published: (2022)
A linear proof language for second-order intuitionistic linear logic
by: Díaz-Caro, Alejandro, et al.
Published: (2023)
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)
by: Grilletti, Gianluca, et al.
Published: (2024)
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)
A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic
by: d'Aragona, Antonio Piccolomini
Published: (2025)
by: d'Aragona, Antonio Piccolomini
Published: (2025)
Generalisation of proof simulation procedures for Frege systems by M.L.~Bonet and S.R.~Buss
by: Kozhemiachenko, Daniil
Published: (2024)
by: Kozhemiachenko, Daniil
Published: (2024)
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)
Short proofs without interference
by: Rebola-Pardo, Adrian
Published: (2025)
by: Rebola-Pardo, Adrian
Published: (2025)
An ecumenical view of proof-theoretic semantics
by: Nascimento, Victor, et al.
Published: (2023)
by: Nascimento, Victor, et al.
Published: (2023)
On the logical structure of choice and bar induction principles
by: Brede, Nuria, et al.
Published: (2021)
by: Brede, Nuria, et al.
Published: (2021)
On the role of connectivity in Linear Logic proofs
by: Di Donna, Raffaele, et al.
Published: (2025)
by: Di Donna, Raffaele, et al.
Published: (2025)
A concise proof of Commoner's theorem
by: Jancar, Petr
Published: (2024)
by: Jancar, Petr
Published: (2024)
Between proof construction and SAT-solving
by: Schubert, Aleksy, et al.
Published: (2024)
by: Schubert, Aleksy, et al.
Published: (2024)
Existential and positive games: a comonadic and axiomatic view
by: Abramsky, Samson, et al.
Published: (2025)
by: Abramsky, Samson, et al.
Published: (2025)
Towards solid abelian groups: A formal proof of Nöbeling's theorem
by: Asgeirsson, Dagur
Published: (2023)
by: Asgeirsson, Dagur
Published: (2023)
Constructing (Co)inductive Types via Large Sizes
by: Laarakker, Bastiaan, et al.
Published: (2026)
by: Laarakker, Bastiaan, et al.
Published: (2026)
Proof complexity of positive branching programs
by: Das, Anupam, et al.
Published: (2021)
by: Das, Anupam, et al.
Published: (2021)
SAT problem and Limit of Solomonoff's inductive reasoning theory
by: Pan, Feng
Published: (2025)
by: Pan, Feng
Published: (2025)
Dyadic obligations: proofs and countermodels via hypersequents
by: Ciabattoni, Agata, et al.
Published: (2024)
by: Ciabattoni, Agata, et al.
Published: (2024)
Similar Items
-
Cyclic Implicit Complexity
by: Curzi, Gianluca, et al.
Published: (2021) -
Computational expressivity of (circular) proofs with fixed points
by: Curzi, Gianluca, et al.
Published: (2023) -
Non-wellfounded parsimonious proofs and non-uniform complexity
by: Acclavio, Matteo, 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) -
Making progress: Reducibility Candidates and Cut Elimination in the Ill-founded Realm
by: Curzi, Gianluca, et al.
Published: (2026)