scientific article; zbMATH DE number 7155168
From MaRDI portal
Publication:5208872
Publication date: 22 January 2020
Full work available at URL: https://arxiv.org/abs/1807.10248
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (7)
Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ Cyclic hypersequent system for transitive closure logic ⋮ Circular (Yet Sound) Proofs in Propositional Logic ⋮ Abstract cyclic proofs ⋮ Non-well-founded deduction for induction and coinduction ⋮ Unnamed Item ⋮ Cyclic proofs, hypersequents, and transitive closure logic
Uses Software
Cites Work
- Games for the \(\mu\)-calculus
- Exponential lower bounds for the pigeonhole principle
- Handbook of proof theory
- A cut-free cyclic proof system for Kleene algebra
- Realizability in cyclic proof: extracting ordering information for infinite descent
- Cyclic proofs with ordering constraints
- Circular (yet sound) proofs
- Cyclic Arithmetic Is Equivalent to Peano Arithmetic
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
- Sequent calculi for induction and infinite descent
- Cyclic proofs of program termination in separation logic
- Slicing the Truth
- Towards Completeness via Proof Search in the Linear Time μ-calculus
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
- Automated Cyclic Entailment Proofs in Separation Logic
- Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars
- A Proof System for the Linear Time μ-Calculus
- Automated Reasoning with Analytic Tableaux and Related Methods
- Testing and generating infinite sequences by a finite automaton
- Existence and feasibility in arithmetic
- On n-quantifier induction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
