Craig Interpolation via Hypersequents

@inproceedings{Kuznets2016CraigIV,
  title={Craig Interpolation via Hypersequents},
  author={Roman Kuznets},
  year={2016}
}
In this paper, we describe a novel constructive method of proving the Craig interpolation property (CIP) based on cut-free hypersequent calculi and apply the method to prove the CIP for the modal logic S5. 

Figures from this paper

Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents

The goal of this paper is extending to intermediate logics the constructive prooftheoretic method of proving Craig and Lyndon interpolation via hypersequents and nested sequents developed earlier for classical modal logics, and answering in the positive the open question of whether Gödel logic enjoys the Lyndon interpolations property.

Proving Craig and Lyndon Interpolation Using Labelled Sequent Calculi

It is shown that classes of frames definable by quantifier-free Horn formulas correspond to logics with the IPs and capture the modal cube and the infinite family of transitive Geach logics.

Multicomponent proof-theoretic method for proving interpolation properties

  • R. Kuznets
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 2018

Uniform interpolation via nested sequents and hypersequents

This paper develops a constructive method for proving uniform interpolation via nested sequents and applies it to reprove the uniform interpolations property for normal modal logics K, D, and T, and obtains the first direct proof of uniforms interpolation for S5 via a cut-free sequent-like calculus.

Interpolation Method for Multicomponent Sequent Calculi

The proof-theoretic method of proving the Craig interpolation property is presented here in a general form applicable also to other similar formalisms, e.g., prefixed tableaus.

Through an Inference Rule, Darkly

  • R. Kuznets
  • Computer Science, Philosophy
    Mathesis Universalis, Computability and Proof
  • 2019
The complexity of the underlying objects is abstracted away to give way for a simple syntactic description, a kind of mathesis universalis, however, the complexity continues affecting which ways of reasoning are valid.

References

SHOWING 1-4 OF 4 REFERENCES

Automated Reasoning with Analytic Tableaux and Related Methods

A Tableau-Based Decision Procedure for a Fragment of Set Theory Involving a Restricted Form of Quantification and Strategy Parallel Use of Model Elimination with Lemmata.

Reasoning about knowledge

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed systems, artificial intelligence, and game theory.

Uniform, cut-free formulations of T, S4, and S5

  • Journal of Symbolic Logic,
  • 1983

PubFactory at 08/12/2016 12:43:38PM by roman@logic.at via Technische Universität Wien and Roman Kuznets

  • 2016