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

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.

Author's Profile

Christopher Gauker
University of Salzburg

Analytics

Added to PP
2015-07-20

Downloads
157 (#45,200)

6 months
9 (#66,070)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?