What people are saying - Write a review
We haven't found any reviews in the usual places.
PART TWO HISTORY OF MODERN LOGIC
PART THREE APPLICATIONS OF MODEL THEORY
PART FOUR RECURSION THEORY
PART FIVE COMPLEXITY OF COMPUTATIONS
PART SIX SET THEORY
abelian groups Andrzej Mostowski argument atomic atomless axiom axiom of choice basic Bolzano Boolean algebra Boolean function bounded calculus called cardinality complete complete Boolean algebra computation concept consider constant constructive continuity in parameters Corollary countable defined definition denote dense domain element elementary elementary submodel equivalent example exists extension formal formula Hence higher types Ho-categorical holds hyperfinite hyperfinite model ideal implies induction infinite internal interpretation isomorphic Kreisel language Lemma Lesniewski linear orderings logic Lowenheim Math measurable cardinal measure mereology model theory monotone Moschovakis Mostowski natural numbers node North-Holland notion number structures ontology ordinal paper partial recursive predicate problem proof propositions protothetic prove quantifier elimination quantifiers real numbers recursion theory recursive functions relation result satisfies semantics sentence sequence set theory space stack code subset Suppose symbols Theorem topological ultrafilter uniformly locally finite universe variables