Switch to: Citations

Add references

You must login to add references.
  1. Vaught’s conjecture for superstable theories of finite rank.Steven Buechler - 2008 - Annals of Pure and Applied Logic 155 (3):135-172.
    In [R. Vaught, Denumerable models of complete theories, in: Infinitistic Methods, Pregamon, London, 1961, pp. 303–321] Vaught conjectured that a countable first order theory has countably many or 20 many countable models. Here, the following special case is proved.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • On representability of neatly embeddable cylindric algebras.Miklós Ferenczi - 2000 - Journal of Applied Non-Classical Logics 10 (3):303-315.
    ABSTRACT As is well-known, a classical representation theorem of the theory of cylindric algebras is: A ε IGwsa if and only if A ε SNrαCAα+ε. The part “only if” is trivial. Regarding to the other part “A ε SNrαCAα+ε then A ε IGwsα“ the following question arises: is it possible to replace the class CA in the hypothesis A ε SNrαCAα+ε by a larger class so that the theorem still holds. Such a larger class Kα β is defined. The class (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)On the equational theory of representable polyadic equality algebras.Istvan Nemeti & Gabor Sagi - 2000 - Journal of Symbolic Logic 65 (3):1143-1167.
    Among others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEA ω 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schema-axiomatizable, as well). We will also show that the complexity of the equational theory of RPEA ω is also extremely high in the recursion theoretic (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)The number of countable models.Michael Morley - 1970 - Journal of Symbolic Logic 35 (1):14-18.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Martin's axiom, omitting types, and complete representations in algebraic logic.Tarek Sayed Ahmed - 2002 - Studia Logica 72 (2):285 - 309.
    We give a new characterization of the class of completely representable cylindric algebras of dimension 2 #lt; n w via special neat embeddings. We prove an independence result connecting cylindric algebra to Martin''s axiom. Finally we apply our results to finite-variable first order logic showing that Henkin and Orey''s omitting types theorem fails for L n, the first order logic restricted to the first n variables when 2 #lt; n#lt;w. L n has been recently (and quite extensively) studied as a (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (2 other versions)Countable models of nonmultidimensional ℵ0-stable theories.Elisabeth Bouscaren & Daniel Lascar - 1983 - Journal of Symbolic Logic 48 (1):197-205.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A completeness theorem for higher order logics.Gabor Sagi - 2000 - Journal of Symbolic Logic 65 (2):857-884.
    Here we investigate the classes RCA $^\uparrow_\alpha$ of representable directed cylindric algebras of dimension α introduced by Nemeti[12]. RCA $^\uparrow_\alpha$ can be seen in two different ways: first, as an algebraic counterpart of higher order logics and second, as a cylindric algebraic analogue of Quasi-Projective Relation Algebras. We will give a new, "purely cylindric algebraic" proof for the following theorems of Nemeti: (i) RCA $^\uparrow_\alpha$ is a finitely axiomatizable variety whenever α ≥ 3 is finite and (ii) one can obtain (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • A note on algebras of substitutions.Gábor Sági - 2002 - Studia Logica 72 (2):265-284.
    We will study the class RSA of -dimensional representable substitution algebras. RSA is a sub-reduct of the class of representable cylindric: algebras, and it was an open problem in Andréka [1] that whether RSA can be finitely axiomatized. We will show, that the answer is positive. More concretely, we will prove, that RSA is a finitely axiomatizable quasi-variety. The generated variety is also described. We note that RSA is the algebraic counterpart of a certain proportional multimodal logic and it is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations