Intensional and Higher-Order Modal LogicElsevier, 3 juin 2016 - 158 pages North-Holland Mathematics Studies, 19: Intensional and Higher-Order Modal Logic: With Applications to Montague Semantics focuses on an approach to the problem of providing a precise account of natural language syntax and semantics, including the set-theoretic semantical methods, Boolean models, and two-sorted type theory. The book first offers information on intensional logic and alternative formulations of intensional logic. Topics include two-sorted type theory, normal forms, extensions and intensional logic, modal T-logic, persistence in intensional logic, generalized completeness of intensional logic, and natural language and intensional logic. The text then examines higher-order modal logic and algebraic semantics. Discussions focus on Cohen's independence results, topological models of MLp, modal independence results, Boolean models of MLp, relative strength of intensional logic and MLp, propositional operators, modal predicate logic, and propositions in MLp. The monograph is a valuable reference for mathematicians and researchers interested in intensional and higher-order modal logic. |
Autres éditions - Tout afficher
Intensional and Higher-order Modal Logic: With Applications to Montague ... Aucun aperçu disponible - 1975 |
Expressions et termes fréquents
arbitrary assignment assume atomic axioms b-valid B-valued belongs Boolean algebra Boolean model called clearly complete comprehension condition consistent constant contains COROLLARY define definition denote distinct earlier easily element equivalent exists expression extension extensional fact follows formulas of MLp frame function g-model given hence higher-order holds homomorphism IL-D implies independent indicial individuals infer intension interpretation language Lemma logic mapping meaning MLp based MLpºc modally closed model of MLp Montague natural notion objects obtain occurring free operator otherwise particular predicate prenex form principle Proof properties propositional provable prove quantifiers recursion relation relatively remarked replacing respectively result rules satisfies schema semantics sense sequence set of formulas subsets Suppose symbols term Theorem theory topological true usual valid variable of type various verify write