scientific article; zbMATH DE number 3300581
From MaRDI portal
Publication:5582318
zbMath0188.32003MaRDI QIDQ5582318
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (82)
A propositional fragment of Leśniewski's ontology and its formulation by the tableau method ⋮ On superintuitionistic logics as fragments of proof logic extensions ⋮ An improved refutation system for intuitionistic predicate logic ⋮ Models for normal intuitionistic modal logics ⋮ Models for stronger normal intuitionistic modal logics ⋮ Algebraic proofs of cut elimination ⋮ Uniform proofs as a foundation for logic programming ⋮ Intuitionistic games: determinacy, completeness, and normalization ⋮ Partial up an down logic ⋮ Topological representation of intuitionistic and distributive abstract logics ⋮ On finite linear intermediate predicate logics ⋮ Cut‐Elimination Theorem for the Logic of Constant Domains ⋮ A unification of two approaches to vagueness: the Boolean many-valued approach and the modal-precisificational approach ⋮ Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels ⋮ Intuitionistic completeness of first-order logic ⋮ Intuitive counterexamples for constructive fallacies ⋮ LINEAR TIME IN HYPERSEQUENT FRAMEWORK ⋮ Bisimulation and propositional intuitionistic logic ⋮ On some classes of Heyting algebras with successor that have the amalgamation property ⋮ A Lindström theorem for intuitionistic first-order logic ⋮ Constructions of classical models by means of Kripke models (Survey) ⋮ Intuitionistic propositional probability logic ⋮ Fidel Semantics for Propositional and First-Order Version of the Logic of CG’3 ⋮ Linear depth deduction with subformula property for intuitionistic epistemic logic ⋮ KRULL DIMENSION IN MODAL LOGIC ⋮ On congruences in weak implicative semi-lattices ⋮ 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 ⋮ Tableaux for logic programming with strong negation ⋮ Generalized tableau systems for intermediate propositional logics ⋮ Topological proofs of some Rasiowa-Sikorski lemmas ⋮ On fragments of Medvedev's logic ⋮ Strong completeness with respect to finite Kripke models ⋮ Paraconsistency everywhere ⋮ Maehara-style modal nested calculi ⋮ A non-clausal tableau calculus for \textsc{MinSat} ⋮ Intuitionistic Decision Procedures Since Gentzen ⋮ A semantic hierarchy for intuitionistic logic ⋮ A new constant in superintuitionistic logic L3 ⋮ Semi-intuitionistic logic with strong negation ⋮ Converting non-classical matrix proofs into sequent-style systems ⋮ Optimization techniques for propositional intuitionistic logic and their implementation ⋮ Basic intuitionistic conditional logic ⋮ Codimension and pseudometric in co-Heyting algebras ⋮ A MODAL TRANSLATION FOR DUAL-INTUITIONISTIC LOGIC ⋮ On the decidability ofp′, p″ andP″ ⋮ Vagueness, truth and logic ⋮ A complete negationless system ⋮ On Bellissima's construction of the finitely generated free Heyting algebras, and beyond ⋮ Anti-intuitionism and paraconsistency ⋮ The Classical Model Existence Theorem in Subclassical Predicate Logics I ⋮ Modal logics for communicating systems ⋮ Tavole semantiche per sistemi astratti di logica estensionale ⋮ A representation theorem for polyadic Heyting algebras ⋮ Intuitionistic logic with strong negation ⋮ Interpolation theorems for intuitionistic predicate logic ⋮ The independence results of set theory: An informal exposition ⋮ Lattices related to Post algebras and their applications to some logical systems ⋮ CONSTRUCTIVE REFLECTIVITY PRINCIPLES FOR REGULAR THEORIES ⋮ Predicate logical extensions of some subintuitionistic logics ⋮ Reference and perspective in intuitionistic logics ⋮ A study of Kripke-type models for some modal logics by Gentzen's sequential method ⋮ Intuitionistic Existential Instantiation and Epsilon Symbol ⋮ Some Operators in Kripke Models with an Involution ⋮ Rasiowa–Sikorski Sets and Forcing ⋮ Intuitionistic propositional logic is polynomial-space complete ⋮ The happy formalist ⋮ Representing scope in intuitionistic deductions ⋮ A new semantics for intuitionistic predicate logic ⋮ Intuitionistic Letcc via Labelled Deduction ⋮ Kripke models and intermediate logics ⋮ Deciding intuitionistic propositional logic via translation into classical logic ⋮ Semantical analysis of constructive PDL ⋮ Quantified modal logic: non-normal worlds and propositional attitudes ⋮ Gödel and Intuitionism ⋮ Ultimate stochastic entities ⋮ A uniform procedure for converting matrix proofs into sequent-style systems ⋮ Noncumulative dialectical models and formal dialectics ⋮ On some semi-intuitionistic logics ⋮ A categorical equivalence for tense Nelson algebras ⋮ Generalizations of the weak law of the excluded middle
This page was built for publication:
