Title of article
Decidable Boolean algebras of low level Original Research Article
Author/Authors
S.S. Goncharov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1998
Pages
21
From page
75
To page
95
Abstract
We will study the question about decidability for Boolean algebras with first elementary characteristic one. The main problem is sufficient conditions for decidability of Boolean algebras with recursive representation for extended signature by definable predicates. We will use the base definitions on recursive and constructive models from [2, 4–6, 10, 11] but on Boolean algebras from [1, 8].
Keywords
Model completeness , Decidability , Constructivization , Constructive model , Boolean algebra
Journal title
Annals of Pure and Applied Logic
Serial Year
1998
Journal title
Annals of Pure and Applied Logic
Record number
896147
Link To Document