Tableau-based decision procedure for non-Fregean logic of sentential identity

04/29/2021
by   Joanna Golińska Pilarek, et al.
0

Sentential Calculus with Identity (SCI) is an extension of classical propositional logic, featuring a new connective of identity between formulas. In SCI two formulas are said to be identical if they share the same denotation. In the semantics of the logic, truth values are distinguished from denotations, hence the identity connective is strictly stronger than classical equivalence. In this paper we present a sound, complete, and terminating algorithm deciding the satisfiability of SCI-formulas, based on labelled tableaux. To the best of our knowledge, it is the first implemented decision procedure for SCI which runs in NP, i.e., is complexity-optimal. The obtained complexity bound is a result of dividing derivation rules in the algorithm into two sets: decomposition and equality rules, whose interplay yields derivation trees with branches of polynomial length with respect to the size of the investigated formula. We describe an implementation of the procedure and compare its performance with implementations of other calculi for SCI (for which, however, the termination results were not established). We show possible refinements of our algorithm and discuss the possibility of extending it to other non-Fregean logics.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
04/04/2009

Optimal Tableau Decision Procedures for PDL

We reformulate Pratt's tableau decision procedure of checking satisfiabi...
research
11/22/2022

A Complete Diagrammatic Calculus for Boolean Satisfiability

We propose a calculus of string diagrams to reason about satisfiability ...
research
12/03/2017

The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics

Let L be some extension of classical propositional logic. The non-iterat...
research
02/27/2013

An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics

Possibilistic logic, an extension of first-order logic, deals with uncer...
research
06/11/2018

Learning Linear Temporal Properties

We present two novel algorithms for learning formulas in Linear Temporal...
research
01/19/2023

A Proof System for a Logic of Presuppositions

The paper proposes a derivation system for a logic of presuppositions as...

Please sign up or login with your details

Forgot password? Click here to reset