This is a preview. Log in through your library . Journal Information The Journal of Symbolic Logic (JSL) was founded in 1936 and it has become the leading research journal in the field. It is issued ...
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 ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback