John W. Rosenthal

15 papers Journal 15

Year	Rank	Type	Title / Venue / Authors
2002	J	`jnl`	More Undecidable Lattices of Steinitz Exchange Systems. J. Symb. Log. L. R. Galminas, John W. Rosenthal
1999	J	`jnl`	The Probability of Pure Literals. J. Log. Comput. John W. Rosenthal, Jacob Manuel Plotkin, John Franco
1992	J	`jnl`	Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. Ann. Math. Artif. Intell. John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp
1992	J	`jnl`	The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - II. Ann. Math. Artif. Intell. John W. Rosenthal
1990	J	`jnl`	Some Highly Undecidable Lattices. Ann. Pure Appl. Log. Menachem Magidor, John W. Rosenthal, Mattiyahu Rubin, Gabriel Srour
1987	J	`jnl`	Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discret. Appl. Math. John Franco, Jacob Manuel Plotkin, John W. Rosenthal
1986	J	`jnl`	Intersections of algebraically closed fields. Ann. Pure Appl. Log. Christopher J. Ash, John W. Rosenthal
1982	J	`jnl`	The expected complexity of analytic tableaux analyses in propositional calculus. Notre Dame J. Formal Log. Jacob Manuel Plotkin, John W. Rosenthal
1980	J	`jnl`	Some Theories Associated with Algebraically Closed Fields. J. Symb. Log. Christopher J. Ash, John W. Rosenthal
1979	J	`jnl`	On the Dimension Theory of N Math. Log. Q. John W. Rosenthal
1979	J	`jnl`	Truth in All of Certain Well-Founded Countable Models Arising in Set Theory II. Math. Log. Q. John W. Rosenthal
1975	J	`jnl`	Partial n Math. Log. Q. John W. Rosenthal
1975	J	`jnl`	Truth in all of certain well-founded countable models arising in set theory. Math. Log. Q. John W. Rosenthal
1974	J	`jnl`	Models of Th(<ω Notre Dame J. Formal Log. John W. Rosenthal
1972	J	`jnl`	A New Proof of a Theorem of Shelah. J. Symb. Log. John W. Rosenthal