## The Bulletin of Symbolic Logic, Volume 3 |

### From inside the book

Results 1-3 of 90

Page 2

free

subgroups of strictly smaller cardinality are free. Define a group to be A-free if

and only if every subgroup of cardinality < X is free; there is a separate

for each ...

free

**problem**asks whether there exists a non-free group such that all of itssubgroups of strictly smaller cardinality are free. Define a group to be A-free if

and only if every subgroup of cardinality < X is free; there is a separate

**problem**for each ...

Page 55

The presence or absence of equality may also affect the computational

complexity of the satisfiability

the Ackermann class, which consists of all relational first-order sentences with

quantifier ...

The presence or absence of equality may also affect the computational

complexity of the satisfiability

**problem**for decidable classes. A case in point isthe Ackermann class, which consists of all relational first-order sentences with

quantifier ...

Page 65

For any function t from positive integers to positive integers, NTIME(/(j)) is the

class of all decision

machine in time t(s), where s is the size of the input. We denote by NEXPTIME the

...

For any function t from positive integers to positive integers, NTIME(/(j)) is the

class of all decision

**problems**that can be solved by a non-deterministic Turingmachine in time t(s), where s is the size of the input. We denote by NEXPTIME the

...

### What people are saying - Write a review

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

### Contents

Articles | 9 |

Set theory generated by Abelian group theory by Paul C Eklof | 17 |

On the decision problem for twovariable firstorder logic by Erich Gradel | 58 |

Copyright | |

11 other sections not shown

### Other editions - View all

### Common terms and phrases

abstract algebraic algorithm argument-text arithmetic Association for Symbolic axioms Borel Borel equivalence relation bounded Cambridge Canada cardinality Church Coll Comp complete Computer Science construction countable defined definition denote Department of Mathematics Dept domain E-mail editors elements equivalence relation finite model first-order first-order logic fixed point formal formula Germany given Godel graph induction Info Inst interpretation intuitionistic intuitionistic logic isomorphism Japan Journal of Symbolic lambda calculus language Lemma linear linear logic Matematica Math metric space modal logic model theory natural numbers notation notion ordinal P.O. Box paper Philos predicate presheaf problem programming proof theory Proposition prove real number recursion theory recursive functions reduction result satisfies semantics sentence sequence set theory Skolem Springer-Verlag Stanford structure subset Symbolic Logic Tarski Theorem topological Turing type theory Univ University variables Well-Ordering Theorem Zermelo