On finite approximability of psi-intermediate logics

Studia Logica 41:67 (1982)
  Copy   BIBTEX

Abstract

The aim of this note is to show (Theorem 1.6) that in each of the cases: = {, }, or {, , }, or {, , } there are uncountably many -intermediate logics which are not finitely approximable. This result together with the results known in literature allow us to conclude (Theorem 2.2) that for each : either all -intermediate logics are finitely approximate or there are uncountably many of them which lack the property.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,072

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
52 (#419,040)

6 months
8 (#588,629)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The Finite Model Property and Subsystems of Classical Propositional Calculus.Ronald Harrop - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (1-2):29-32.

Add more references