John W. Rosenthal

Publication Activity (10 Years)

Years Active: 1972-2002
Publications (10 Years): 0

Publications

L. R. Galminas, John W. Rosenthal
More Undecidable Lattices of Steinitz Exchange Systems. J. Symb. Log. 67 (2) (2002)
John W. Rosenthal, Jacob Manuel Plotkin, John Franco
The Probability of Pure Literals. J. Log. Comput. 9 (4) (1999)
John W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp
Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case Behavior. Ann. Math. Artif. Intell. 6 (1-3) (1992)
John W. Rosenthal
The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - II. Ann. Math. Artif. Intell. 6 (1-3) (1992)
Menachem Magidor, John W. Rosenthal, Mattiyahu Rubin, Gabriel Srour
Some Highly Undecidable Lattices. Ann. Pure Appl. Log. 46 (1) (1990)
John Franco, Jacob Manuel Plotkin, John W. Rosenthal
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. Discret. Appl. Math. 17 (3) (1987)
Christopher J. Ash, John W. Rosenthal
Intersections of algebraically closed fields. Ann. Pure Appl. Log. 30 (2) (1986)
Jacob Manuel Plotkin, John W. Rosenthal
The expected complexity of analytic tableaux analyses in propositional calculus. Notre Dame J. Formal Log. 23 (4) (1982)
Christopher J. Ash, John W. Rosenthal
Some Theories Associated with Algebraically Closed Fields. J. Symb. Log. 45 (2) (1980)
John W. Rosenthal
Truth in All of Certain Well-Founded Countable Models Arising in Set Theory II. Math. Log. Q. 25 (25-29) (1979)
John W. Rosenthal
-Categorical Theories with the Nontrivial Strong Elementary Intersection Property. Math. Log. Q. 25 (19-24) (1979)
John W. Rosenthal
Truth in all of certain well-founded countable models arising in set theory. Math. Log. Q. 21 (1) (1975)
John W. Rosenthal
-categorical theory. Math. Log. Q. 21 (1) (1975)
John W. Rosenthal
,). Notre Dame J. Formal Log. 15 (1) (1974)
John W. Rosenthal
A New Proof of a Theorem of Shelah. J. Symb. Log. 37 (1) (1972)