Publication:5732647
From MaRDI portal
zbMath0121.25308MaRDI QIDQ5732647
Publication date: 1961
Related Items
Truth and definite truth, What languages have Tarski truth definitions?, Computational complexity of the semantics of some natural language constructions, From IF to BI. A tale of dependence and separation, Independent set readings and generalized quantifiers, Variable declarations in natural deduction, On the formal semantics of IF-like logics, Henkin quantifiers and complete problems, Henkin and function quantifiers, Descriptive characterizations of computational complexity, Decidability problems in languages with Henkin quantifiers, Game sentences and ultrapowers, IF-logic and truth-definition, Succinctness as a source of complexity in logical formalisms, Towards automating duality, Definability hierarchies of generalized quantifiers, On the computational consequences of independence in propositional logic, On languages with non-homogeneous strings of quantifiers, Skolem Theory and Generalized Quantifiers