Switch to: References

Add citations

You must login to add citations.
  1. The Tarski–Lindenbaum algebra of the class of strongly constructivizable models with $$\omega $$-stable theories.Mikhail Peretyat’kin - forthcoming - Archive for Mathematical Logic:1-12.
    We study the class of all strongly constructivizable models having \(\omega \) -stable theories in a fixed finite rich signature. It is proved that the Tarski–Lindenbaum algebra of this class considered together with a Gödel numbering of the sentences is a Boolean \(\Sigma ^1_1\) -algebra whose computable ultrafilters form a dense subset in the set of all ultrafilters; moreover, this algebra is universal with respect to the class of all Boolean \(\Sigma ^1_1\) -algebras. This gives a characterization to the Tarski-Lindenbaum (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Boolean algebra of formulas of first-order logic.Don H. Faust - 1982 - Annals of Mathematical Logic 23 (1):27.
    The algebraic recursive structure of countable languages of classical first-order logic with equality is analysed. all languages of finite undecidable similarity type are shown to be algebraically and recursively equivalent in the following sense: their boolean algebras of formulas are, after trivial factors involving the one element models of the languages have been excepted, recursively isomorphic by a map which preserves the degree of recursiveness of their models.
    Download  
     
    Export citation  
     
    Bookmark   2 citations