Automated proof search system for logic of correlated knowledge

02/23/2019
by   Haroldas Giedra, et al.
0

The automated proof search system and decidability for logic of correlated knowledge is presented in this paper. The core of the proof system is the sequent calculus with the properties of soundness, completeness, admissibility of cut and structural rules, and invertibility of all rules. The proof search procedure based on the sequent calculus performs automated terminating proof search and allows us to achieve decision result for logic of correlated knowledge.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/12/2018

A repetition-free hypersequent calculus for first-order rational Pavelka logic

We present a hypersequent calculus G^3Ł∀ for first-order infinite-valued...
research
07/21/2022

A Labelled Sequent Calculus for Public Announcement Logic

Public announcement logic(PAL) is an extension of epistemic logic (EL) w...
research
05/23/2018

Non-Analytic Tableaux for Chellas's Conditional Logic CK and Lewis's Logic of Counterfactuals VC

Priest has provided a simple tableau calculus for Chellas's conditional ...
research
03/10/2023

A Proof Tree Builder for Sequent Calculus and Hoare Logic

We have developed a web-based pedagogical proof assistant, the Proof Tre...
research
06/25/2021

A Curiously Effective Backtracking Strategy for Connection Tableaux

Automated proof search with connection tableaux, such as implemented by ...
research
07/03/2000

Constraint Exploration and Envelope of Simulation Trajectories

The implicit theory that a simulation represents is precisely not in the...
research
04/14/2022

Decidability of Intuitionistic Sentential Logic with Identity via Sequent Calculus

The aim of our paper is twofold: firstly we present a sequent calculus f...

Please sign up or login with your details

Forgot password? Click here to reset