Partial Orders, Residuation, and First-Order Linear Logic
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Non-characterizability of belief revision: an application of finite model theory
A formal framework is given for the characterizability of a class of belief revision operators, defined using minimization over a class of partial preorders, by postulates. It is shown that for partial orders characteriz…
Depth Functions for Partial Orders with a Descriptive Analysis of Machine Learning Algorithms
We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies of depth functions in linear and metric spaces, there is very little discussion…
BenchmarkingDescriptiveComparing Machine Learning Algorithms by Union-Free Generic Depth
We propose a framework for descriptively analyzing sets of partial orders based on the concept of depth functions. Despite intensive studies in linear and metric spaces, there is very little discussion on depth functions…
BenchmarkingChoice functions based on sets of strict partial orders: an axiomatic characterisation
Methods for choosing from a set of options are often based on a strict partial order on these options, or on a set of such partial orders. I here provide a very general axiomatic characterisation for choice functions of …
A Differentiable Bayesian Relaxation for Latent Partial-Order Inference
Many ranking and agent trace datasets are recorded as linear orders even though their latent structure is only partially ordered. This is especially common in agent and workflow traces, where observed order may reflect a…