Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T05:45:27.630Z Has data issue: false hasContentIssue false

An undecidable problem in the algebra of truth-tables

Published online by Cambridge University Press:  12 March 2014

Jan Kalicki*
Affiliation:
University of California, Berkeley

Extract

In a previous paper I have described a decision method for testing whether or not two arbitrary finite truth-tables are “equal”, i.e., determine the same set of tautologies. The same problem for the case of infinite truth-tables remained open.

In the present note we shall show that the answer to the problem in the case of infinite truth-tables is negative; in fact we shall prove that there exists neither a decision method for testing the equality of arbitrary truth-tables, nor even one for testing the equality of what we call “recursive” truth-tables.

The terminology of Kalicki [3] will be used; for brevity's sake the discussion involving the notions of recursiveness and recursive enumerability uses the informal terminology and mode of argumentation employed by Post in [9].

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1954

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable