When logic lays down the law

10/06/2018
by   Bjørn Jespersen, et al.
0

We analyse so-called computable laws, i.e., laws that can be enforced by automatic procedures. These laws should be logically perfect and unambiguous, but sometimes they are not. We use a regulation on road transport to illustrate this issue, and show what some fragments of this regulation would look like if rewritten in the image of logic. We further propose desiderata to be fulfilled by computable laws, and provide a critical platform from which to assess existing laws and a guideline for composing future ones.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/05/2019

Integrating Amdahl-like Laws and Divisible Load Theory

Integrating Amdahl's and Amdahl-like laws with Divisible Load Theory pro...
04/22/2021

Time series analysis with dynamic law exploration

In this paper we examine, how the dynamic laws governing the time evolut...
03/13/2018

On the Algebra in Boole's Laws of Thought

This article explores the ideas that went into George Boole's developmen...
06/13/2018

Simple Laws about Nonprominent Properties of Binary Relations

We checked each binary relation on a 5-element set for a given set of pr...
11/15/2018

Don't Try This at Home: No-Go Theorems for Distributive Laws

Beck's distributive laws provide sufficient conditions under which two m...
04/07/2020

A categorical approach to secure compilation

We introduce a novel approach to secure compilation based on maps of dis...
05/25/2012

Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation

I am most honoured to have the privilege to present the Foreword to this...
This week in AI

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