Partial Orders, Residuation, and First-Order Linear Logic

2020/08/14 by Moot, Richard
#Computation and Language (cs.CL) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2008.06351

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.

Related

• Order-Invariance in the Two-Variable Fragment of First-Order Logic
• Ordered fragments of first-order logic
• Ordered Adjoint Logic
• First order logic properly displayed
• Partiality and Recursion in Higher-order Logic