Complexity of equations valid in algebras of relations Part I: Strong non-finitizability

Author: Andreka H.1

Source: Annals of Pure and Applied Logic, Volume 89, Number 2, 8 December 1997 , pp. 149-209(61)

Publisher: Elsevier

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

Keywords: Algebraic logic; Algebras of relations; Cylindric algebras; Polyadic algebras; Relation algebras; Representation theory; Nonfinitizability; Finitization problem; Completeness theorems; Incompleteness theorems; Modal logic of quantification and substitution; Logic of first-order formula schemes; Logic with finitely many variables; [AMS classification codes] 03G15; [AMS classification codes] 06; [AMS classification codes] 08

Language: English

Document Type: Research article

DOI: 10.1016/S0168-0072(97)00027-4

Affiliations: 1: Mathematical Institute, Hungarian Academy of Sciences, P.O. Box 127, H-1364, Budapest, Hungary

This article is hosted on another website.

You may be required to register, activate a subscription or purchase the article before you can obtain the full text.

Proceed

Back to top

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A