##
Reports on Mathematical Logic

###
No. 33

Tomasz POLACIK

INDUCTION SCHEMATA VALID IN KRIPKE MODELS OF ARITHMETICAL THEORIES
A b s t r a c t.
We consider Kripke semantics for intuitionistic
arithmetic and ask ourselves whether an induction schema which is
(classically) true in a world of a given model $\K$ is also
(intuitionistically) forced at the corresponding node of $\K$.

Mathematics Subject Classification:
03F50, 03F30, 03C90.

Back to Main Menu