Vol. 114, No. 1, 1984

Recent Issues
Vol. 332: 1  2
Vol. 331: 1  2
Vol. 330: 1  2
Vol. 329: 1  2
Vol. 328: 1  2
Vol. 327: 1  2
Vol. 326: 1  2
Vol. 325: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Boolean powers, recursive models, and the Horn theory of a structure

George Clifford Nelson

Vol. 114 (1984), No. 1, 207–220
Abstract

This paper concerns the algebraic constructions of Boolean powers and bounded Boolean powers of structures A for an arbitrary first-order language. The notion of B-separating is used to improve results about the logic of reduced power structures. For A recursive we construct recursive models of the theory of each reduced power of A. Finally, it is shown that any complete theory is equivalent to a finitely axiomatizable extension of its Horn consequences.

Mathematical Subject Classification 2000
Primary: 03C20
Secondary: 03C57
Milestones
Received: 28 April 1982
Revised: 9 November 1982
Published: 1 September 1984
Authors
George Clifford Nelson