Reasoning about Unreliable Actions

02/01/2012
by   Graham White, et al.
0

We analyse the philosopher Davidson's semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions. This provides a perspicuous and elegant treatment of reasoning about action, analogous to Reiter's work on artificial intelligence. We define a sequent calculus for this logic, prove cut elimination, and give a semantics based on fibrations over partial cartesian categories: we give a structure theory for such fibrations. The existence of lax comma objects is necessary for the proof of cut elimination, and we give conditions on the domain fibration of a partial cartesian category for such comma objects to exist.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/03/2022

A theory of cut-restriction: first steps

Cut-elimination is the bedrock of proof theory. It is the algorithm that...
01/26/2021

Proof Theory of Partially Normal Skew Monoidal Categories

The skew monoidal categories of Szlachányi are a weakening of monoidal c...
03/14/2019

A two-dimensional metric temporal logic

We introduce a two-dimensional metric (interval) temporal logic whose in...
08/07/2016

Reconciling Lambek's restriction, cut-elimination, and substitution in the presence of exponential modalities

The Lambek calculus can be considered as a version of non-commutative in...
10/17/2018

Fast Cut-Elimination using Proof Terms: An Empirical Study

Urban and Bierman introduced a calculus of proof terms for the sequent c...
02/23/2018

Definable isomorphism problem

We investigate the isomorphism problem in the setting of definable sets ...
08/10/2021

Refactoring the Whitby Intelligent Tutoring System for Clean Architecture

Whitby is the server-side of an Intelligent Tutoring System application ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.