Quantifiers: Logics, Models and Computation: Volume Two: Contributions
Michal Krynicki, M. Mostowski, L.W. Szczerba
Springer Netherlands, May 31, 1995 - Philosophy - 278 pages
This volume contains a collection of research papers centered around the concept of quantifier. Recently this concept has become the central point of research in logic. It is one of the important logical concepts whose exact domain and applications have so far been insufficiently explored, especially in the area of inferential and semantic properties of languages. It should thus remain the central point of research in the future. Moreover, during the last twenty years generalized quantifiers and logical technics based on them have proved their utility in various applications. The example of natu rallanguage semantics has been partcularly striking. For a long time it has been belived that elementary logic also called first-order logic was an ade quate theory of logical forms of natural language sentences. Recently it has been accepted that semantics of many natural language constructions can not be properly represented in elementary logic. It has turned out, however, that they can be described by means of generalized quantifiers. As far as computational applications oflogic are concerned, particulary interesting are semantics restricted to finite models. Under this restriction elementary logic looses several of its advantages such as axiomatizability and compactness. And for various purposes we can use equally well some semantically richer languages of which generalized quantifiers offer the most universal methods of describing extensions of elementary logic. Moreover we can look at generalized quantifiers as an explication of some specific mathematical concepts, e. g.
What people are saying - Write a review
We haven't found any reviews in the usual places.
KRYNICKI and M MOSTOWSKI Quantifiers Some Problems
A BROWN Operators on Branched Quantifiers
CAICEDO Hilberts eSymbol in the Presence
12 other sections not shown
abelian groups additional quantifier admits elimination algebraic system archimedean assume axiomatizable axioms Barwise Benthem binary relation Boolean algebras branched quantifiers card(A cardinality chains of quantifiers condition congruence relations consider contains Corollary corresponding defining formula definition denote dense dense ordered disjoint disjointly constructible elements elimination of quantifiers equivalence classes equivalence relation example existential extension first-order first-order logic function Henkin quantifiers induction inference interpretation inverse logic isomorphic Krynicki L(aa language Luu lattice Lemma lexicographic lexicographic order linear orderings Mathematical model theory Mostowski graphs natural number nonempty noun phrases operator order quantifiers partially ordered predicate prefix Q problem-free proof-item Proposition prove quan quantifier elimination quantifier phrases quantifier prefixes quantifier Q quantifier-free respect restricted rules satisfies second order logic semantics sequence signature Skolem-Lowenheim property subformulae subset symbols Theorem theory tifiers unary uncountable universal vertices weakly separable Zawadowski