Publication:5582318
From MaRDI portal
zbMath0188.32003MaRDI QIDQ5582318
Publication date: 1969
Related Items
Cut‐Elimination Theorem for the Logic of Constant Domains, Some Operators in Kripke Models with an Involution, Interpolation theorems for intuitionistic predicate logic, Topological proofs of some Rasiowa-Sikorski lemmas, Codimension and pseudometric in co-Heyting algebras, Modal logics for communicating systems, A representation theorem for polyadic Heyting algebras, On intuitionistic modal and tense logics and their classical companion logics: topological semantics and bisimulations, Hypersequent calculi for intuitionistic logic with classical atoms, Kripke models for classical logic, On Bellissima's construction of the finitely generated free Heyting algebras, and beyond, The happy formalist, Quantified modal logic: non-normal worlds and propositional attitudes, Optimization techniques for propositional intuitionistic logic and their implementation, Predicate logical extensions of some subintuitionistic logics, Reference and perspective in intuitionistic logics, Ultimate stochastic entities, Noncumulative dialectical models and formal dialectics, A propositional fragment of Leśniewski's ontology and its formulation by the tableau method, On superintuitionistic logics as fragments of proof logic extensions, Models for normal intuitionistic modal logics, Models for stronger normal intuitionistic modal logics, On finite linear intermediate predicate logics, Constructions of classical models by means of Kripke models (Survey), On fragments of Medvedev's logic, Strong completeness with respect to finite Kripke models, Vagueness, truth and logic, A complete negationless system, Tavole semantiche per sistemi astratti di logica estensionale, Intuitionistic logic with strong negation, The independence results of set theory: An informal exposition, Lattices related to Post algebras and their applications to some logical systems, A study of Kripke-type models for some modal logics by Gentzen's sequential method, Intuitionistic propositional logic is polynomial-space complete, Representing scope in intuitionistic deductions, An improved refutation system for intuitionistic predicate logic, Algebraic proofs of cut elimination, Paraconsistency everywhere, Anti-intuitionism and paraconsistency, A new semantics for intuitionistic predicate logic, Semantical analysis of constructive PDL, A uniform procedure for converting matrix proofs into sequent-style systems, Partial up an down logic, Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels, Kripke models and intermediate logics, Uniform proofs as a foundation for logic programming, The Classical Model Existence Theorem in Subclassical Predicate Logics I, On the decidability ofp′, p″ andP″
