Search
Now showing items 1-2 of 2
On Rosser sentences and proof predicates
(2011-05-10)
It is a well known fact that the G ̈del sentences γ of a theory T are
o
all provably equivalent to the consistency statement of T , Con T . This
result is independent from choice of proof predicate. It has been proved
by ...
Morley’s number of countable models
(2011-05-10)
A theory formulated in a countable predicate calculus can have at most
2א0 nonisomorphic countable models. In 1961 R. L. Vaught [9] conjected
that if such a theory has uncountably many countable models, then it has
exactly ...