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.

Categories

Keywords

Reprint years

DOI

10.1007/bf00373493

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

Prefinitely axiomatizable modal and intermediate logics.Marcus Kracht - 1993 - Mathematical Logic Quarterly 39 (1):301-322.
Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
Superintuitionistic Logics and Finite Approximability.A. V. Kuznecov & E. Mendelson - 1972 - Journal of Symbolic Logic 37 (4):757-757.
An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
Intermediate logics preserving admissible inference rules of heyting calculus.Vladimir V. Rybakov - 1993 - Mathematical Logic Quarterly 39 (1):403-415.
On the rules of intermediate logics.Rosalie Iemhoff - 2006 - Archive for Mathematical Logic 45 (5):581-599.
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
On maximal intermediate predicate constructive logics.Alessandro Avellone, Camillo Fiorentini, Paolo Mantovani & Pierangelo Miglioli - 1996 - Studia Logica 57 (2-3):373 - 408.
An algorithm for finding finite axiomatizations of finite intermediate logics.Andrzej Wronski - 1972 - Bulletin of the Section of Logic 1 (1):38-44.
An algorithm for finding finite axiomatizations of finite intermediate logics by means of jankov formulas.Eugeniusz Tomaszewski - 2002 - Bulletin of the Section of Logic 31 (1):1-6.
On Löb algebras, II.Majid Alizadeh & Mohammad Ardeshir - 2012 - Logic Journal of the IGPL 20 (1):27-44.
On finite linear intermediate predicate logics.Hiroakira Ono - 1988 - Studia Logica 47 (4):391 - 399.
The lattice of strengthenings of a strongly finite consequence operation.Wiesław Dziobiak - 1981 - Studia Logica 40 (2):177 - 193.

Analytics

Added to PP
2009-01-28

Downloads
43 (#369,861)

6 months
5 (#639,314)

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