## Results in non-classical propositional logic |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

accessibility relation author's axiomatization binary relation Boolean canonical model Chapter class of frames classical modal logic closed under subformulas complete with respect completeness results constants of degree contains Dana Scott defined by S4 derivable determined dissertation fails finite model property finitely axiomatizable fixed objects following schemata formula is valid frames iff fxR'fy G 2 iff Hence Hintikka intuitionistic logic JIK and JIL Kanger Kripke L-consistent L-full iff L-inconsistent L-maximal lemma Lemmata 1.1 Lemmon & Scott logical constants McKinsey frames McKinsey model McKinsey property modal operator commute model 21 modus ponens mula NDJFL normal logic defined partially ordered frame Prior's propositional letters propositional logic pseudo-epimorphism reflexive and transitive S-cluster schema schemata S1 Semantical analysis set of formulas set of propositional set the domain smallest filtration Sobocihski symmetric Tarski Theorem 2.2 Theoria three-valued modal logic tions transitive McKinsey true in 21 valuation x in 21 ZMLGM