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 abelian groups Andrzej Mostowski atomic atomless axiom axiom of choice Bolzano Boolean algebra bounded calculus cardinality complete complete Boolean algebra computation concept consider constructive Corollary countable defined definition denote domain element elementary elementary submodel equivalent example exists extension formal formula Hence higher types holds hyperfinite hyperfinite model implies induction infinite isomorphic Kreisel language Lemma Leśniewski Let G logic L÷wenheim Math mathematics measurable cardinal measure mereology model theory monotone Moschovakis Mostowski natural numbers node North-Holland notion number structures ontology ordinal p-group paper partial recursive problem proof propositions protothetic prove quantifier elimination quantifiers rank o values recursion theory recursive functions relation result satisfies semantic sentence sequence set theory space subgroup subset Suppose symbols Theorem topological ultrafilter uniformly locally finite variables