The strong completeness of a system based on Kleene's strong three-valued logic

DOI10.1305/ndjfl/1040511343zbMath0822.03014OpenAlexW2037548896MaRDI QIDQ1893137

Hiroshi Aoyama

Publication date: 3 July 1995

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040511343

zbMATH Keywords

nonclassical predicate logic system containing a truth predicate symbol

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (3)

A THREE-VALUED QUANTIFIED ARGUMENT CALCULUS: DOMAIN-FREE MODEL-THEORY, COMPLETENESS, AND EMBEDDING OF FOL ⋮ Notes on models of (partial) Kripke-Feferman truth ⋮ Axiomatizing Kripke's theory of truth

Cites Work

• Abstraction and definability in semantically closed structures
• Ungroundedness in classical languages
• The Notion of Logical Consequence in the Logic of Inexact Predicates
• The Strong Completeness of a System for Kleene's Three‐Valued Logic
• Outline of a Theory of Truth
• The Calculus of Partial Predicates and Its Extension to Set Theory I

This page was built for publication: The strong completeness of a system based on Kleene's strong three-valued logic