Theoretical Computer Science
Unification under a mixed prefix
Journal of Symbolic Computation
Handbook of logic in computer science (vol. 2)
Logic programming in a fragment of intuitionistic linear logic
Papers presented at the IEEE symposium on Logic in computer science
Proceedings of the workshop on Advances in linear logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Cut-elimination for a logic with definitions and induction
Theoretical Computer Science - Special issue on proof-search in type-theoretic languages
Monotone Fixed-Point Types and Strong Normalization
Proceedings of the 12th International Workshop on Computer Science Logic
The Structure of Exponentials: Uncovering the Dynamics of Linear Logic Proofs
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
A logical framework for reasoning about logical specifications
A logical framework for reasoning about logical specifications
A proof theory for generic judgments
ACM Transactions on Computational Logic (TOCL)
Model checking for π-calculus using proof search
CONCUR 2005 - Concurrency Theory
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
A Neutral Approach to Proof and Refutation in MALL
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
The Bedwyr System for Model Checking over Syntactic Expressions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On the Expressivity of Minimal Generic Quantification
Electronic Notes in Theoretical Computer Science (ENTCS)
Least and Greatest Fixpoints in Game Semantics
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
On the Proof Theory of Regular Fixed Points
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Cyclic proofs for first-order logic with inductive definitions
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Focused inductive theorem proving
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Focusing and polarization in intuitionistic logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Incorporating tables into proofs
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Stratification in logics of definitions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Combining Deduction Modulo and Logics of Fixed-Point Definitions
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Foundational proof certificates in first-order logic
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Subformula linking as an interaction method
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is a well-structured but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the addition of the exponentials (! and ?), we add least and greatest fixed point operators. The resulting logic, which we call μMALL, satisfies two fundamental proof theoretic properties: we establish weak normalization for it, and we design a focused proof system that we prove complete with respect to the initial system. That second result provides a strong normal form for cut-free proof structures that can be used, for example, to help automate proof search. We show how these foundations can be applied to intuitionistic logic.