Proof-Theoretic Embedding from Visser’s Basic Propositional Logic to Modal Logic K4 via Non-labelled Sequent Calculi

2017 ◽  
pp. 233-257
Author(s):  
Sakiko Yamasaki ◽  
Katsuhiko Sano
Keyword(s):  
Modal Logic ◽  
Propositional Logic ◽  
Sequent Calculi

scholarly journals The Method of Socratic Proofs Meets Correspondence Analysis

2019 ◽  
Vol 48 (2) ◽  
pp. 99-116
Author(s):  
Dorota Leszczyńska-Jasion ◽  
Yaroslav Petrukhin ◽  
Vasilyi Shangin
Keyword(s):  
Correspondence Analysis ◽  
Boolean Functions ◽  
Propositional Logic ◽  
Sequent Calculus ◽  
Sequent Calculi ◽  
Classical Propositional Logic ◽  
Logic Of Questions ◽  
Proof Systems

The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for the method of Socratic proofs. Correspondence analysis is Kooi and Tamminga's technique for designing proof systems. In this paper it is used to consider sequent calculi with non-branching (the only exception being the rule of cut), invertible rules for the negation fragment of classical propositional logic and its extensions by binary Boolean functions.

UNIFORM INTERPOLATION IN SUBSTRUCTURAL LOGICS

2014 ◽  
Vol 7 (3) ◽  
pp. 455-483 ◽  
Author(s):  
MAJID ALIZADEH ◽  
FARZANEH DERAKHSHAN ◽  
HIROAKIRA ONO
Keyword(s):  
Propositional Logic ◽  
Predicate Logic ◽  
Interpolation Property ◽  
Substructural Logics ◽  
Substructural Logic ◽  
Sequent Calculi ◽  
Structural Rule ◽  
Modal Propositional Logic ◽  
Uniform Interpolation ◽  
Classical Predicate

AbstractUniform interpolation property of a given logic is a stronger form of Craig’s interpolation property where both pre-interpolant and post-interpolant always exist uniformly for any provable implication in the logic. It is known that there exist logics, e.g., modal propositional logic S4, which have Craig’s interpolation property but do not have uniform interpolation property. The situation is even worse for predicate logics, as classical predicate logic does not have uniform interpolation property as pointed out by L. Henkin.In this paper, uniform interpolation property of basic substructural logics is studied by applying the proof-theoretic method introduced by A. Pitts (Pitts, 1992). It is shown that uniform interpolation property holds even for their predicate extensions, as long as they can be formalized by sequent calculi without contraction rules. For instance, uniform interpolation property of full Lambek predicate calculus, i.e., the substructural logic without any structural rule, and of both linear and affine predicate logics without exponentials are proved.

scholarly journals A general proof certification framework for modal logic

2019 ◽  
Vol 29 (8) ◽  
pp. 1344-1378
Author(s):  
TOMER LIBAL ◽  
MARCO VOLPE
Keyword(s):  
Modal Logic ◽  
General Framework ◽  
Sequent Calculus ◽  
Specification Language ◽  
Sequent Calculi ◽  
General Proof ◽  
Theorem Provers ◽  
Different Sources

One of the main issues in proof certification is that different theorem provers, even when designed for the same logic, tend to use different proof formalisms and produce outputs in different formats. The project ProofCert promotes the usage of a common specification language and of a small and trusted kernel in order to check proofs coming from different sources and for different logics. By relying on that idea and by using a classical focused sequent calculus as a kernel, we propose here a general framework for checking modal proofs. We present the implementation of the framework in a Prolog-like language and show how it is possible to specialize it in a simple and modular way in order to cover different proof formalisms, such as labelled systems, tableaux, sequent calculi and nested sequent calculi. We illustrate the method for the logic K by providing several examples and discuss how to further extend the approach.

Gentzen sequent calculi for some intuitionistic modal logics

2019 ◽  
Vol 27 (4) ◽  
pp. 596-623
Author(s):  
Zhe Lin ◽  
Minghui Ma
Keyword(s):  
Propositional Logic ◽  
Sequent Calculus ◽  
Modal Logics ◽  
Cut Elimination ◽  
Sequent Calculi ◽  
Intuitionistic Propositional Logic ◽  
Propositional Language ◽  
Intuitionistic Modal Logics ◽  
Subformula Property ◽  
Gentzen Sequent Calculus

Abstract Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond ,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond ,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable.

Displaying the modal logic of consistency

1999 ◽  
Vol 64 (4) ◽  
pp. 1573-1590 ◽  
Author(s):  
Heinrich Wansing
Keyword(s):  
Modal Logic ◽  
Base System ◽  
Sequent Calculi

AbstractIt is shown that the constructive four-valued logic N4 can be faithfully embedded into the modal logic S4. This embedding is used to obtain complete, cut-free display sequent calculi for N4 and C4, the modal logic of consistency over N4. C4 is a natural monotonic base system for semantics-based non-monotonic reasoning.

Consistent disjunctive sequent calculi and Scott domains

2021 ◽  
pp. 1-24
Author(s):  
Longchun Wang ◽  
Qingguo Li
Keyword(s):  
Fixed Point ◽  
Propositional Logic ◽  
Continuous Functions ◽  
Consequence Relations ◽  
Sequent Calculi ◽  
Continuous Solutions ◽  
Syntactic Representation ◽  
Scott Continuous ◽  
Recursive Domain Equations ◽  
Standard Domain

Abstract Based on the framework of disjunctive propositional logic, we first provide a syntactic representation for Scott domains. Precisely, we establish a category of consistent disjunctive sequent calculi with consequence relations, and show it is equivalent to that of Scott domains with Scott-continuous functions. Furthermore, we illustrate the approach to solving recursive domain equations by introducing some standard domain constructions, such as lifting and sums. The subsystems relation on consistent finitary disjunctive sequent calculi makes these domain constructions continuous. Solutions to recursive domain equations are given by constructing the least fixed point of a continuous function.

scholarly journals A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

2009 ◽  
Vol 2 (4) ◽  
pp. 593-611 ◽  
Author(s):  
FRANCESCA POGGIOLESI
Keyword(s):  
Modal Logic ◽  
Propositional Logic ◽  
Sequent Calculus ◽  
Semantic Element ◽  
Modal Propositional Logic

In this paper we present a sequent calculus for the modal propositional logic GL (the logic of provability) obtained by means of the tree-hypersequent method, a method in which the metalinguistic strength of hypersequents is improved, so that we can simulate trees shapes. We prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL, that it is contraction free and cut free and that its logical and modal rules are invertible. No explicit semantic element is used in the sequent calculus and all the results are proved in a purely syntactic way.

scholarly journals POSITIVE LOGIC WITH ADJOINT MODALITIES: PROOF THEORY, SEMANTICS, AND REASONING ABOUT INFORMATION

2010 ◽  
Vol 3 (3) ◽  
pp. 351-373 ◽  
Author(s):  
MEHRNOOSH SADRZADEH ◽  
ROY DYCKHOFF
Keyword(s):  
Modal Logic ◽  
Multiagent Systems ◽  
Epistemic Logic ◽  
Proof Theory ◽  
Sequent Calculus ◽  
Dynamic Epistemic Logic ◽  
Algebraic Semantics ◽  
Sequent Calculi ◽  
Closure Operators ◽  
Positive Logic

We consider a simple modal logic whose nonmodal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4, and S5, such logics are useful, as shown in previous work by Baltag, Coecke, and the first author, for encoding and reasoning about information and misinformation in multiagent systems. For the propositional-only fragment of such a dynamic epistemic logic, we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of “nested” or “tree-sequent” calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.

Sign in / Sign up

Export Citation Format

Share Document