scientific article; zbMATH DE number 7155168
From MaRDI portal
Publication:5208872
Recommendations
- On arithmetic complexity of certain constructive logics
- On arithmetic complexity of some constructive logics
- Arithmetic complexity of the predicate logics of certain complete arithmetic theories
- New Computational Paradigms
- scientific article; zbMATH DE number 1567841
- scientific article; zbMATH DE number 819737
- The computational complexity of propositional cirquent calculus
- scientific article; zbMATH DE number 1189101
- The complexity of two problems on arithmetic circuits
- scientific article; zbMATH DE number 4010488
Cites work
- A cut-free cyclic proof system for Kleene algebra
- A Proof System for 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
- Automated Reasoning with Analytic Tableaux and Related Methods
- Circular (yet sound) proofs
- Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System
- Constructive completeness for the linear-time -calculus
- Cyclic arithmetic is equivalent to Peano arithmetic
- Cyclic proofs of program termination in separation logic
- Cyclic proofs with ordering constraints
- Existence and feasibility in arithmetic
- Exponential lower bounds for the pigeonhole principle
- Games for the -calculus
- Handbook of proof theory
- Herbrand disjunctions, cut elimination and context-free tree grammars
- scientific article; zbMATH DE number 6680140 (Why is no real title available?)
- scientific article; zbMATH DE number 51556 (Why is no real title available?)
- scientific article; zbMATH DE number 733384 (Why is no real title available?)
- scientific article; zbMATH DE number 1956528 (Why is no real title available?)
- scientific article; zbMATH DE number 953683 (Why is no real title available?)
- scientific article; zbMATH DE number 2087442 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- scientific article; zbMATH DE number 227056 (Why is no real title available?)
- Infinitary proof theory: the multiplicative additive case
- Local validity for circular proofs in linear logic with fixed points
- Logical foundations of proof complexity
- On n-quantifier induction
- Realizability in cyclic proof: extracting ordering information for infinite descent
- Sequent calculi for induction and infinite descent
- Slicing the truth. On the computable and reverse mathematics of combinatorial principles
- Subsystems of second order arithmetic
- Testing and generating infinite sequences by a finite automaton
- The logical strength of Büchi's decidability theorem
- Towards completeness via proof search in the linear time -calculus: the case of Büchi inclusions
Cited in
(23)- Non-well-founded deduction for induction and coinduction
- Cyclic proofs, hypersequents, and transitive closure logic
- Uniform interpolation from cyclic proofs: the case of modal mu-calculus
- scientific article; zbMATH DE number 7439738 (Why is no real title available?)
- scientific article; zbMATH DE number 7450001 (Why is no real title available?)
- Clause set cycles and induction
- Cyclic hypersequent system for transitive closure logic
- Circular (Yet Sound) Proofs in Propositional Logic
- Abstract cyclic proofs
- On the logical complexity of cyclic arithmetic
- Cyclic proofs for arithmetical inductive definitions
- Abstract cyclic proofs
- Cyclic implicit complexity
- Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics
- Computational expressivity of (circular) proofs with fixed points
- Fragments of arithmetic and cyclic proofs
- On the reverse mathematics of cut-elimination and determinacy
- Herbrand schemes for cyclic proofs
- Peano arithmetic and MALL
- On structural proof theory of the modal logic \(\mathsf{K}^+\) extended with infinitary derivations
- Comparing infinitary systems for linear logic with fixed points
- Cyclic implicit complexity
- Computation by infinite descent made explicit
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208872)
