Partial Orders, Residuation, and First-Order Linear Logic

August 14, 2020 ยท The Ethereal ยท ๐Ÿ› Studies in Computational Intelligence

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Richard Moot arXiv ID 2008.06351 Category cs.LO: Logic in CS Cross-listed cs.CL, math.LO Citations 0 Venue Studies in Computational Intelligence Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS