No finite axiomatizations for posets embeddable into distributive lattices

Annals of Pure and Applied Logic 169 (3):235-242 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On MODkP Counting Degrees.Masamitsu Ozaki & Juichi Shinoda - 1999 - Mathematical Logic Quarterly 45 (3):327-342.
Infinite substructure lattices of models of Peano Arithmetic.James H. Schmerl - 2010 - Journal of Symbolic Logic 75 (4):1366-1382.
Decision problem for separated distributive lattices.Yuri Gurevich - 1983 - Journal of Symbolic Logic 48 (1):193-196.
The structure of the honest polynomial m-degrees.Rod Downey, William Gasarch & Michael Moses - 1994 - Annals of Pure and Applied Logic 70 (2):113-139.
Representation of posets.Yungchen Cheng & Paula Kemp - 1992 - Mathematical Logic Quarterly 38 (1):269-276.
Disjunctions in closure spaces.Andrzej W. Jankowski - 1985 - Studia Logica 44 (1):11 - 24.
A splitting theorem for the Medvedev and Muchnik lattices.Stephen Binns - 2003 - Mathematical Logic Quarterly 49 (4):327.

Analytics

Added to PP
2017-11-25

Downloads
28 (#565,512)

6 months
7 (#419,635)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Recursive axiomatisations from separation properties.Rob Egrot - 2021 - Journal of Symbolic Logic 86 (3):1228-1258.

Add more citations

References found in this work

Representable posets.Rob Egrot - 2016 - Journal of Applied Logic 16:60-71.

Add more references