Partial Orders, Residuation, and First-Order Linear Logic
Abstract
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent allows us to define many useful logical operators. In addition, the partial order constraints improve the efficiency of proof search.
Domains
Computation and Language [cs.CL]
Loading...