An algorithm for finding finite axiomatizations of finite intermediate logics

Bulletin of the Section of Logic 1 (1):38-44 (1972)
  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: 92,283

External links

  • This entry has no external links. Add one.
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

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.
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.
Remark on a finite axiomatization of finite intermediate propositional logics.D. Skvortsov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):381-386.
Prefinitely axiomatizable modal and intermediate logics.Marcus Kracht - 1993 - Mathematical Logic Quarterly 39 (1):301-322.
On maximal intermediate logics with the disjunction property.Larisa L. Maksimova - 1986 - Studia Logica 45 (1):69 - 75.
On intermediate predicate logics of some finite Kripke frames, I. levelwise uniform trees.Dmitrij Skvortsov - 2004 - Studia Logica 77 (3):295 - 323.
An infinite class of maximal intermediate propositional logics with the disjunction property.Pierangelo Miglioli - 1992 - Archive for Mathematical Logic 31 (6):415-432.
An algorithm for the decomposition of finite languages.W. Wieczorek - 2010 - Logic Journal of the IGPL 18 (3):355-366.
Intermediate logics preserving admissible inference rules of heyting calculus.Vladimir V. Rybakov - 1993 - Mathematical Logic Quarterly 39 (1):403-415.
First-order Gödel logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.
Some Normal Extensions of K4.3.Ming Xu - 2013 - Studia Logica 101 (3):583-599.
Finite replacement and finite hilbert‐style axiomatizability.B. Herrmann & W. Rautenberg - 1992 - Mathematical Logic Quarterly 38 (1):327-344.
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.
Elements of Finite Model Theory.Leonid Libkin - 2004 - Springer.

Analytics

Added to PP
2015-02-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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