Finite axiomatization for some intermediate logics

Studia Logica 39 (4):415-423 (1980)
  Copy   BIBTEX

Abstract

LetN. be the set of all natural numbers, and letD n * = {k N k|n} {0} wherek¦n if and only ifn=k.x f or somexN. Then, an ordered setD n * = D n *, n, wherex ny iffx¦y for anyx, yD n *, can easily be seen to be a pseudo-boolean algebra.In [5], V.A. Jankov has proved that the class of algebras {D n * nB}, whereB =, {k N is finitely axiomatizable

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,154

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
36 (#618,808)

6 months
5 (#1,013,651)

Historical graph of downloads
How can I increase my downloads?