## A method in proofs of undefinability: with applications to functions in the arithmetic of natural numbers |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A method in proofs of undefinability | 14 |

Addition and multiplication in the formalized | 25 |

Results concerning equational undefinability | 41 |

1 other sections not shown

### Common terms and phrases

&-ary operation arithmetic of natural arithmetical meaning atomic formula axiom system binary operation constants binary relation ck with respect closure property compatible consistent extension consistent theory containing constant individual constant constant is undefinable constants with respect containing all sentences containing the non-logical Corollary definable definition problem equational definition equational undefinability equationally and validly essentially undefinable equationally essentially undefinable explicitly explicit definition explicit undefinability explicitly and compatibly explicitly and validly extended finitely axiomatizable follows formalized arithmetic free variables interpretation introduced a notion Lemma logical constants method in proofs minimal extension model Mo natural numbers one-model method operation constant individual Padoa's method pm-i pm(a pm(x proofs of undefinability property for pi recursive set relation constant respect to T2 respect to theory sentence being valid shape subtheory of 3~n symbols Ta(S terms of models Tm-i Tm(a undecidable valid sentences validly or compatibly xk+i