A Technique for Determing Closure in Semantic Tableaux

Download Edit this record How to cite View on PhilPapers
Abstract
The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.
PhilPapers/Archive ID
BARATF-8
Upload history
Archival date: 2017-05-20
View other versions
Added to PP index
2017-05-20

Total views
67 ( #58,461 of 70,034 )

Recent downloads (6 months)
6 ( #65,275 of 70,034 )

How can I increase my downloads?

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