Applications of trees to intermediate logics
From MaRDI portal
Publication:5654019
DOI10.2307/2272556zbMath0243.02019OpenAlexW2032865385MaRDI QIDQ5654019
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
Related Items
Henkin’s Completeness Proof and Glivenko’s Theorem, A short proof of Glivenko theorems for intermediate predicate logics, On Finite Domains Based Slices in the Structure of Superintuitionistic Predicate Logics, Preview, Glivenko theorems and negative translations in substructural predicate logics, On the proof theory of the intermediate logic MH, Sufficient conditions for the undecidability of intuitionistic theories with applications, Kripke sheaf completeness of some superintuitionistic predicate logics with a weakened constant domains principle, Completeness of intermediate logics with doubly negated axioms, Some results on the Kripke sheaf semantics for super-intuitionistic predicate logics, Applications of Kripke models to Heyting-Brouwer logic, A new version of Beth semantics for intuitionistic logic, On Kreisel's notion of validity in Post systems, Directed frames, A study of intermediate predicate logics, Annual Meeting of the Association for Symbolic Logic, An alternative normalization of the implicative fragment of classical logic, On 2nd order intuitionistic propositional calculus with full comprehension
