Structural completeness of Gödel's and Dummett's propositional calculi

Studia Logica 32 (1):69-73 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,297

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
24 (#754,516)

6 months
12 (#443,723)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Structural and universal completeness in algebra and logic.Paolo Aglianò & Sara Ugolini - 2024 - Annals of Pure and Applied Logic 175 (3):103391.
Admissible Rules and the Leibniz Hierarchy.James G. Raftery - 2016 - Notre Dame Journal of Formal Logic 57 (4):569-606.
Hereditarily structurally complete positive logics.Alex Citkin - 2020 - Review of Symbolic Logic 13 (3):483-502.
Structural Completeness in Fuzzy Logics.Petr Cintula & George Metcalfe - 2009 - Notre Dame Journal of Formal Logic 50 (2):153-182.

View all 15 citations / Add more citations

References found in this work

Finite limitations on Dummet's LC.Ivo Thomas - 1962 - Notre Dame Journal of Formal Logic 3 (3):170-174.

Add more references