Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T22:05:36.115Z Has data issue: false hasContentIssue false
  • English
  • Français

The decision problem for some classes of sentences without quantifiers

Published online by Cambridge University Press:  12 March 2014

J. C. C. McKinsey
J. C. C. McKinsey*
Affiliation:
The University of California
Get accessRights & Permissions [Opens in a new window]

Extract

In this paper we shall be concerned with questions regarding decision problems for certain classes of sentences (without quantifiers) of various kinds of algebra. In the first section we shall establish a result of a general nature, which enables one, in a number of cases, to reduce a decision problem of the type considered to a somewhat simpler problem. In the second section we formulate a rather broad sufficient condition for the existence of a decision method for sentences without quantifiers; and in the last section we show that this condition holds of lattices.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 8 , Issue 3 , September 1943, pp. 61 - 76
Copyright
Copyright © Association for Symbolic Logic 1943

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