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

Download Edit this record How to cite View on PhilPapers
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
Upload history
Archival date: 2015-07-20
View other versions
Added to PP index

Total views
129 ( #33,503 of 55,846 )

Recent downloads (6 months)
11 ( #46,215 of 55,846 )

How can I increase my downloads?

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