Coaxioms: flexible coinductive definitions by inference systems

08/08/2018
by   Francesco Dagnino, et al.
0

We introduce a generalized notion of inference system to support more flexible interpretations of recursive definitions. Besides axioms and inference rules with the usual meaning, we allow also coaxioms, which are, intuitively, axioms which can only be applied "at infinite depth" in a proof tree. Coaxioms allows us to interpret recursive definitions as fixed points which are not necessarily the least, nor the greatest one, and classical results, which smoothly extend to this generalized framework, ensure the existence of such fixed points. This notion nicely subsumes standard inference systems and their inductive and coinductive interpretation, thus allowing formal reasoning in cases where the inductive and coinductive interpretation do not provide the intended meaning, or are mixed together.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2017

Generalizing inference systems by coaxioms

After surveying classical results, we introduce a generalized notion of ...
research
06/04/2020

Foundations of regular coinduction

Inference systems are a widespread framework used to define possibly rec...
research
11/06/2018

Unboxing Mutually Recursive Type Definitions in OCaml

In modern OCaml, single-argument datatype declarations (variants with a ...
research
08/05/2020

Flexible coinductive logic programming

Recursive definitions of predicates are usually interpreted either induc...
research
02/14/2020

Flexible Coinduction in Agda

Theorem provers are tools that help users to write machine readable proo...
research
07/26/2020

Recursive Rules with Aggregation: A Simple Unified Semantics

Complex reasoning problems are most clearly and easily specified using l...
research
02/23/2023

Capturing and Interpreting Unique Information

Partial information decompositions (PIDs), which quantify information in...

Please sign up or login with your details

Forgot password? Click here to reset