An algorithm for finding finite axiomatizations of finite intermediate logics by means of jankov formulas

Bulletin of the Section of Logic 31 (1):1-6 (2002)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

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

Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
An algorithm for finding finite axiomat. izations of finite intermediate logics, Polish Academy of Sciences, Institute of Philosophy and Sociology.A. Wronski - 1972 - Bulletin of the Section of Logic 2:38-44.
Characteristic Formulas of Partial Heyting Algebras.Alex Citkin - 2013 - Logica Universalis 7 (2):167-193.
Prefinitely axiomatizable modal and intermediate logics.Marcus Kracht - 1993 - Mathematical Logic Quarterly 39 (1):301-322.
First-order Gödel logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
On modal logics between K × K × K and $s5 \times s5 \times s5$.R. Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221 - 234.
Free Spectra of Linear Equivalential Algebras.Katarzyna Slomczyńska - 2005 - Journal of Symbolic Logic 70 (4):1341 - 1358.
An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
Review: Yu. T. Medvedev, Elliott Medelson, Finite Problems; Yu. T. Medvedev, Sue Ann Walker, Interpretation of Logical Formulas by Means of Finite Problems and its Relation to the Realizability Theory; Ju. T. Medvedev, Sue Ann Walker, Interpretation of Logical Formulas by Means of Finite Problems. [REVIEW]Joan Rand Moschovaks - 1973 - Journal of Symbolic Logic 38 (2):330-331.
An Infinitary Extension of Jankov’s Theorem.Yoshihito Tanaka - 2007 - Studia Logica 86 (1):111 - 131.
Review: V. A. Jankov, Finite Validity of Formulas of a Special Form. [REVIEW]J. G. Anderson - 1973 - Journal of Symbolic Logic 38 (2):331-331.

Analytics

Added to PP
2014-01-18

Downloads
20 (#747,345)

6 months
1 (#1,510,037)

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

No references found.

Add more references