Normalisation for Some Infectious Logics and Their Relatives

04/14/2022
by   Yaroslav Petrukhin, et al.
0

We consider certain infectious logics (Sfde, dSfde, K3w, and PWK) and several their non-infectious modifications, including two new logics, reformulate previously constructed natural deduction systems for them (or present such systems from scratch for the case of new logics) in way such that the proof of normalisation theorem becomes possible for these logics. We present such a proof and establish the negation subformula property for the logics in question.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2019

On Axiomatization of Lewis' Conditional Logics

This paper first shows that the popular axiomatic systems proposed by Nu...
research
06/15/2023

Streamlining Input/Output Logics with Sequent Calculi

Input/Output (I/O) logic is a general framework for reasoning about cond...
research
04/23/2020

On the proof complexity of logics of bounded branching

We investigate the proof complexity of extended Frege (EF) systems for b...
research
08/20/2018

A continuum of incomplete intermediate logics

This paper generalizes the 1977 paper of V.B. Shehtman, which constructe...
research
04/25/2021

Isabelle's Metalogic: Formalization and Proof Checker

Isabelle is a generic theorem prover with a fragment of higher-order log...
research
03/10/2000

A tableau methodology for deontic conditional logics

In this paper we present a theorem proving methodology for a restricted ...
research
01/01/1998

Monotonicity and Persistence in Preferential Logics

An important characteristic of many logics for Artificial Intelligence i...

Please sign up or login with your details

Forgot password? Click here to reset