While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic--including...
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
Real-world automated reasoning systems must contend with inconsistencies and the vast amount of information stored in relational databases. In this paper, we introduce compilation...
Timothy L. Hinrichs, Jui-Yi Kao, Michael R. Genese...
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...