A Completenesss Theorem for a 3-Valued Semantics for a First-order Language

Download Edit this record How to cite View on PhilPapers
Abstract
This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.
PhilPapers/Archive ID
GAUACT
Revision history
Archival date: 2015-07-20
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2015-07-20

Total views
81 ( #26,518 of 39,984 )

Recent downloads (6 months)
2 ( #40,264 of 39,984 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.