John W. Rosenthal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2002

More Undecidable Lattices of Steinitz Exchange SystemsL. R. Galminas, John W. Rosenthal. JSYML, 67(2):859-878, 2002.

1992

The Expected Complexity of Analytic Tableaux Analyses in Propositional Calculus - IIJohn W. Rosenthal. AMAI, 6(1-3):201-234, 1992.

Exact Satisfiability, a Natural Extension of Set Partition and Its Average Case BehaviorJohn W. Rosenthal, Ewald Speckenmeyer, Rainer Kemp. AMAI, 6(1-3):185-200, 1992.

1990

Some Highly Undecidable LatticesMenachem Magidor, John W. Rosenthal, Mattiyahu Rubin, Gabriel Srour. APAL, 46(1):41-63, 1990.

1987

Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemJohn Franco, Jacob Manuel Plotkin, John W. Rosenthal. DAM, 17(3):295-299, 1987. [doi]

1986

Intersections of algebraically closed fieldsChristopher J. Ash, John W. Rosenthal. APAL, 30(2):103-119, 1986. [doi]

1982

The expected complexity of analytic tableaux analyses in propositional calculusJacob Manuel Plotkin, John W. Rosenthal. ndjfl, 23(4):409-426, 1982. [doi]

1980

Some Theories Associated with Algebraically Closed FieldsChristopher J. Ash, John W. Rosenthal. JSYML, 45(2):359-362, 1980.

1979

Truth in All of Certain Well-Founded Countable Models Arising in Set Theory IIJohn W. Rosenthal. mlq, 25(25-29):403-405, 1979. [doi]

1-Categorical Theories with the Nontrivial Strong Elementary Intersection PropertyJohn W. Rosenthal. mlq, 25(19-24):359-362, 1979. [doi]

1975

Truth in all of certain well-founded countable models arising in set theoryJohn W. Rosenthal. mlq, 21(1):97-106, 1975. [doi]

1-categorical theoryJohn W. Rosenthal. mlq, 21(1):307-308, 1975. [doi]

1974

ω<>)John W. Rosenthal. ndjfl, 15(1):122-132, 1974. [doi]

1972

A New Proof of a Theorem of ShelahJohn W. Rosenthal. JSYML, 37(1):133-134, 1972.

Sign in or sign up to see more results.

runs on WebDSL