Infinite substructure lattices of models of Peano Arithmetic
暂无分享,去创建一个
[1] Characterizations of congruence lattices of abstract algebras , 1963 .
[2] Bernd Voigt,et al. Canonical Partition Theorems for Parameter Sets , 1983, J. Comb. Theory, Ser. A.
[3] Lattices That are Embeddable in Suborder Lattices , 2005 .
[4] Wilfrid Hodges. Conference in Mathematical Logic — London ’70 , 1972 .
[5] Pavel Pudlák,et al. Every finite lattice can be embedded in a finite partition lattice , 1980 .
[6] Alan Day,et al. A Simple Solution to the Word Problem for Lattices , 1970, Canadian Mathematical Bulletin.
[7] H. L. Rolf,et al. THE FREE LATTICE GENERATED BY A SET OF CHAINS , 1958 .
[8] Alan Day,et al. Doubling convex sets in lattices and a generalized semidistributivity condition , 1989 .
[9] J. Schmerl. Extending models of arithmetic , 1978 .
[10] George Mills. Substructure lattices of models of arithmetic , 1979 .
[11] Bohuslav Sivák. Representations of finite lattices by orders on finite sets , 1978 .
[12] James H. Schmerl,et al. The Structure of Models of Peano Arithmetic , 2006 .
[13] Alan Day,et al. Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices , 1979, Canadian Journal of Mathematics.
[15] A. Wilkie. On models of arithmetic having non-modular substructure lattices , 1977 .
[16] Jeff B. Paris. On models of arithmetic , 1972 .
[17] Haim Gaifman,et al. Models and types of Peano's arithmetic , 1976 .