Quantifiers: Logics, Models and Computation: Volume One: SurveysMichal Krynicki, M. Mostowski, L.W. Szczerba Springer Netherlands, 31.05.1995 - 424 Seiten Quantifiers: Logics, Models and Computation is the first concentrated effort to give a systematic presentation of the main research results on the subject, since the modern concept was formulated in the late '50s and early '60s. The majority of the papers are in the nature of a handbook. All of them are self-contained, at various levels of difficulty. The Introduction surveys the main ideas and problems encountered in the logical investigation of quantifiers. The Prologue, written by Per Lindström, presents the early history of the concept of generalised quantifiers. The volume then continues with a series of papers surveying various research areas, particularly those that are of current interest. Together they provide introductions to the subject from the points of view of mathematics, linguistics, and theoretical computer science. The present volume has been prepared in parallel with Quantifiers: Logics, Models and Computation, Volume Two. Contributions, which contains a collection of research papers on the subject in areas that are too fresh to be summarised. The two volumes are complementary. For logicians, mathematicians, philosophers, linguists and computer scientists. Suitable as a text for advanced undergraduate and graduate specialised courses in logic. |
Inhalt
PREFACE | 1 |
P LINDSTRÖM Prologue | 21 |
HELLA and K LUOSTO Finite Generation Problem and nary | 63 |
Urheberrecht | |
19 weitere Abschnitte werden nicht angezeigt.
Häufige Begriffe und Wortgruppen
7-structures A₁ arity assume axiomatizable axioms b₁ Barwise bijection binary relation branching quantifiers Caicedo cardinality w₁ closed cofinality compact complexity class computable condition COROLLARY countable defined definition denote dense Ebbinghaus Ehrenfeucht-Fraïssé elementary logic elements equivalence relation equivalent example expressive power extension Feferman finitely determinate formula function Hella Hence Henkin prefix Henkin quantifiers hierarchy infinitary infinitary logic infinite ISBN isomorphism iteration K₁ Krynicki L(aa Lemma Lindström quantifiers linear orderings Makowsky Math Mathematical model theory monadic Mostowski N₁ natural language notion operation ordinal predicate problem proof PROPOSITION prove PSpace quantifier prefixes quantifier Q real closed fields recursive relativizations satisfying second order logic Section semantics sentence sequence set theory Shelah skolemization spaces stationary logic subset T₁ THEOREM topological tree Tuschik unary uncountable branches uniformly continuous universal Väänänen variables w₁ Westerståhl winning strategy