Completeness and cut-elimination theorems for trilattice logics

Annals of Pure and Applied Logic 162 (10):816-835 (2011)
  Copy   BIBTEX

Abstract

A sequent calculus for Odintsov’s Hilbert-style axiomatization of a logic related to the trilattice SIXTEEN3 of generalized truth values is introduced. The completeness theorem w.r.t. a simple semantics for is proved using Maehara’s decomposition method that simultaneously derives the cut-elimination theorem for . A first-order extension of and its semantics are also introduced. The completeness and cut-elimination theorems for are proved using Schütte’s method.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2013-10-27

Downloads
18 (#828,658)

6 months
4 (#1,006,434)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Heinrich Wansing
Ruhr-Universität Bochum

Citations of this work

Gentzenization of Trilattice Logics.Mitio Takano - 2016 - Studia Logica 104 (5):917-929.

Add more citations