In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every ...

The theory of trees with additional unary predicates and quantification over nodes and branches embraces a rich branching time logic. This theory was reduced in the companion paper to the first-order ...

This is a second course in symbolic logic. Our course presupposes you have had a first course in symbolic deductive logic, such as Sac State's PHIL 60, or CSC 28, or you have learned this material on ...