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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,707

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

How Bad Is Rape?H. E. Baber - 1987 - Hypatia 2 (2):125-138.
The Hiddenness Argument Revisited.J. L. Schellenberg - 2005 - Religious Studies 41 (3):287-303.
Shifting Frames: From Divided to Distributed Psychologies of Scientific Agents.Peter J. Taylor - 1994 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1994:304-310.
The Contemporary Significance of Confucianism.Tang Yijie & Yan Xin - 2008 - Frontiers of Philosophy in China 3 (4):477-501.

Analytics

Added to PP
2009-01-28

Downloads
30 (#546,224)

6 months
7 (#481,211)

Historical graph of downloads
How can I increase my downloads?