## Formal Systems and Recursive Functions: Proceedings |

### What people are saying - Write a review

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

### Contents

Some Modal Calculi Based on IC | 8 |

A Method for Producing Reduction Types in | 42 |

Distributive Normal Forms in FirstOrder Logic | 48 |

Copyright | |

10 other sections not shown

### Common terms and phrases

a-constituents of depth applied argument atomic formulae attributive constituents axiom schemes Beth model characteristic formula choice sequences classical ordinal co-ordinals completes the proof connectives construction contains Corollary corresponding decision problems defined definition denote disjunction distributive normal forms element equivalent extensional finite first-order logic follows formula scheme free choice sequences free individual symbol free variables given Godel number Halting problem identity implies induction intuitionistic intuitionistic logic isotonism layer of quantifiers Lemma lemma VIII limit number member of S1 natural numbers notation number for addition obtained occur omitted one-one ordered pairs partial recursive function prec predicate calculus predicate variables primitive recursive principal number propositional provable formula prove quantificational model quasi-well-ordering quords range functions rank real numbers recursive isotonism relation result rogator rule satisfies second-order set theory Suppose tableau theorem transfinite tree Turing machine vafs verifiable well-orderings Zermelo-Fraenkel set theory