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: 91,423

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

Sequent calculi for some trilattice logics.Norihiro Kamide & Heinrich Wansing - 2009 - Review of Symbolic Logic 2 (2):374-395.
Kripke semantics for modal substructural logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Normal modal substructural logics with strong negation.Norihiro Kamide - 2003 - Journal of Philosophical Logic 32 (6):589-612.
A unified completeness theorem for quantified modal logics.Giovanna Corsi - 2002 - Journal of Symbolic Logic 67 (4):1483-1510.
Substructural Fuzzy Logics.George Metcalfe & Franco Montagna - 2007 - Journal of Symbolic Logic 72 (3):834 - 864.
Dynamic non-commutative logic.Norihiro Kamide - 2010 - Journal of Logic, Language and Information 19 (1):33-51.
A Simple Proof that Super-Consistency Implies Cut Elimination.Gilles Dowek & Olivier Hermant - 2012 - Notre Dame Journal of Formal Logic 53 (4):439-456.

Analytics

Added to PP
2013-10-27

Downloads
18 (#814,090)

6 months
4 (#800,606)

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

References found in this work

A useful four-valued logic.N. D. Belnap - 1977 - In J. M. Dunn & G. Epstein (eds.), Modern Uses of Multiple-Valued Logic. D. Reidel.
How a computer should think.Nuel Belnap - 1977 - In Gilbert Ryle (ed.), Contemporary aspects of philosophy. Boston: Oriel Press.
Reasoning with logical bilattices.Ofer Arieli & Arnon Avron - 1996 - Journal of Logic, Language and Information 5 (1):25--63.

View all 19 references / Add more references