Applications of trees to intermediate logics
From MaRDI portal
Publication:5654019
DOI10.2307/2272556zbMATH Open0243.02019OpenAlexW2032865385MaRDI QIDQ5654019FDOQ5654019
Publication date: 1972
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2272556
Cited In (17)
- On Kreisel's notion of validity in Post systems
- Annual Meeting of the Association for Symbolic Logic
- Glivenko theorems and negative translations in substructural predicate logics
- Applications of Kripke models to Heyting-Brouwer logic
- On Finite Domains Based Slices in the Structure of Superintuitionistic Predicate Logics, Preview
- An alternative normalization of the implicative fragment of classical logic
- Kripke sheaf completeness of some superintuitionistic predicate logics with a weakened constant domains principle
- On 2nd order intuitionistic propositional calculus with full comprehension
- Henkin’s Completeness Proof and Glivenko’s Theorem
- Some results on the Kripke sheaf semantics for super-intuitionistic predicate logics
- Directed frames
- A study of intermediate predicate logics
- Sufficient conditions for the undecidability of intuitionistic theories with applications
- Completeness of intermediate logics with doubly negated axioms
- A new version of Beth semantics for intuitionistic logic
- A short proof of Glivenko theorems for intermediate predicate logics
- On the proof theory of the intermediate logic MH
This page was built for publication: Applications of trees to intermediate logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654019)
