Are tableaux an improvement on truth-tables?

We show that Smullyan's analytic tableaux cannot p-simulate the truth-tables. We identify the cause of this computational breakdown and relate it to an underlying semantic difficulty which is common to the whole tradition originating in Gentzen's sequent calculus, namely the dissonance between cut-free proofs and the Principle of Bivalence. Finally we discuss some ways in which this principle can be built into a tableau-like method without affecting its analytic nature.
Keywords tableaux  truth-tables  computational complexity  theorem-proving
Categories (categorize this paper)
DOI 10.1007/BF00156916
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 20,856
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Raymond M. Smullyan (1968). First-Order Logic. New York [Etc.]Springer-Verlag.

View all 12 references / Add more references

Citations of this work BETA
Marcelo Finger & Dov Gabbay (2006). Cut and Pay. Journal of Logic, Language and Information 15 (3):195-218.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

20 ( #187,512 of 1,906,946 )

Recent downloads (6 months)

2 ( #345,620 of 1,906,946 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.