zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Quantification in nonclassical logic. Volume I. (English) Zbl 1211.03002
Studies in Logic and the Foundations of Mathematics 153. Amsterdam: Elsevier (ISBN 978-0-444-52012-8/hbk). xxiv, 615 p. EUR 153.95; $ 215.00; £ 129.99 (2009).

Publisher’s description: Quantification and modalities have always been topics of great interest for logicians. These two themes emerged from philosophy and language in ancient times; they were studied by traditional informal methods until the 20th century. In the last century the tools became highly mathematical, and both modal logic and quantification found numerous applications in computer science. At the same time many other kinds of nonclassical logics were investigated and applied to computer science. Although there exist several good books in propositional modal logics, this book is the first detailed monograph in nonclassical first-order quantification. It includes results obtained during the past thirty years. The field is very large, so we confine ourselves with only two kinds of logics: modal and superintuitionistic. The main emphasis of Volume 1 is model-theoretic, and it concentrates on descriptions of different sound semantics and completeness problems – even for these seemingly simple questions we have our hands full. The major part of the presented material has never been published before. Some results are very recent, and for other results we either give new proofs or first proofs in full detail.

Audience: Graduate students working in symbolic logic, with a focus in first-order logic, modal logic, intuitionistic logic, model theory, completeness, possible worlds semantics.

MSC:
03-02Research monographs (mathematical logic)
03B45Modal logic, etc.
03B55Intermediate logics