# -*- coding: utf-8 -*-
# pytableaux, a multi-logic proof generator.
# Copyright (C) 2014-2023 Doug Owings.
#
# This program is free software: you can redistribute it and/or modify
# it under the terms of the GNU Affero General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Affero General Public License for more details.
#
# You should have received a copy of the GNU Affero General Public License
# along with this program. If not, see <http://www.gnu.org/licenses/>.
from __future__ import annotations
from . import LogicType
from . import fde as FDE
from . import k3 as K3
from . import tfde as TFDE
from . import kb3e as KB3E
from . import b3e as B3E
class Meta(KB3E.Meta):
name = 'TB3E'
title = 'B3E with T modal'
description = 'Modal version of B3E based on T normal modal logic'
category_order = 33
extension_of = ('KB3E')
class Model(TFDE.Model, B3E.Model): pass
class System(FDE.System): pass
[docs]
class Rules(LogicType.Rules):
closure = K3.Rules.closure
groups = (
# non-branching rules
KB3E.Rules.groups[0],
# modal rules
*TFDE.Rules.groups[1:4],
# branching rules
*B3E.Rules.groups[1:4],
# quantifier rules
*FDE.Rules.groups[-2:])
@classmethod
def _check_groups(cls):
for branching, i in zip(range(4), (0, -5, -4, -3)):
for rulecls in cls.groups[i]:
assert rulecls.branching == branching, f'{rulecls}'