Partial Orders, Residuation, and First-Order Linear Logic

08/14/2020
by   Richard Moot, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2020

A classical-logic view of a paraconsistent logic

This paper is concerned with the first-order paraconsistent logic LPQ^⊃,...
research
03/30/2019

FO = FO3 for linear orders with monotone binary relations

We show that over the class of linear orders with additional binary rela...
research
03/25/2014

Non-characterizability of belief revision: an application of finite model theory

A formal framework is given for the characterizability of a class of bel...
research
07/27/2014

Defining Relative Likelihood in Partially-Ordered Preferential Structures

Starting with a likelihood or preference order on worlds, we extend it t...
research
07/30/2021

Interleaving Reconfigurable Interaction: Separating Choice from Scheduling using Glue

Reconfigurable interaction induces another dimension of nondeterminism i...
research
01/30/2020

Elementary Logic in Linear Space

First-order logic is typically presented as the study of deduction in a ...
research
02/16/2021

Finite Atomized Semilattices

We show that every finite semilattice can be represented as an atomized ...

Please sign up or login with your details

Forgot password? Click here to reset