Coinductive Uniform Proofs

03/18/2019
by   Ekaterina Komendantskaya, et al.
0

Coinduction occurs in two guises in Horn clause logic: in proofs of circular properties and relations, and in proofs involving construction of infinite data. Both instances of coinductive reasoning appeared in the literature before, but a systematic analysis of these two kinds of proofs and of their relation was lacking. We propose a general proof-theoretic framework for handling both kinds of coinduction arising in Horn clause logic. To this aim, we propose a coinductive extension of Miller et al framework of uniform proofs and prove its soundness relative to coinductive models of Horn clause logic.

READ FULL TEXT
research
09/13/2018

Towards Coinductive Theory Exploration in Horn Clause Logic: Position Paper

Coinduction occurs in two guises in Horn clause logic: in proofs of self...
research
11/19/2018

Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses

We establish proof-theoretic, constructive and coalgebraic foundations f...
research
01/29/2022

Logical Pseudocode: Connecting Algorithms with Proofs

Proofs (sequent calculus, natural deduction) and imperative algorithms (...
research
10/06/2021

A New Conjecture About Identity of Proofs

A central problem in proof-theory is that of finding criteria for identi...
research
11/04/2018

Why Extension-Based Proofs Fail

We prove that a class of fundamental shared memory tasks are not amenabl...
research
07/08/2023

What is the meaning of proofs? A Fregean distinction in proof-theoretic semantics

The origins of proof-theoretic semantics lie in the question of what con...
research
07/10/2023

Declarative Linearizability Proofs for Descriptor-Based Concurrent Helping Algorithms

Linearizability is a standard correctness criterion for concurrent algor...

Please sign up or login with your details

Forgot password? Click here to reset