Cover
Table of Contents
Foreword
Congratulations from Samos
Introduction
Part I: Contributions
Chapter 1: A few questions concerning consistency and conservativeness
Chapter 2: In memoriam of Alan Robert Woods
Chapter 3: Degres Ludiques : une introduction
Chapter 4: Primes in Models of <>: Density in Henselizations
Chapter 5: A New Proof of Tanaka's Theorem
Chapter 6: <> - definability of the denumerant with one plus three variables
Chapter 7: Techniques in weak analysis for conservation results
Chapter 8: On the Notion of Proving its own Consistency
Chapter 9: Adding standardness to nonstandard arithmetic
Chapter 10: Randomness, psuedorandomness and models of arithmetic
Chapter 11: The asymptotic behavious of the number of trees in certain classes
Chapter 12: What is Sequentiality?
Part II: Some Problems in Logic and Number Theory, and their Connections
Alan R. Woods (1953-2011)
Chapter 1: Bounded induction, the pigeon hole principle, and the existence of arbitrarily large prime numbers
Chapter 2: Definability properties of the coprimes predicate
Chapter 3: Some logical consequences of the linear case of Schinzel's hypothesis H
Part III: Models of Arithmetic
Hamid Lesan (1951-2006)
Chapter 1: Notation, terminology and prerequisites
Chapter 2: A-saturated models of Arithmetic
Chapter 3: <> - definable elements and a problem of H. Gaifman
Chapter 4: Internal A-saturated structures
Chapter 5: Initial segments of models of B
Back Cover