We stand with Ukraine  

Chaz Schlindwein

Affiliations:
  • Lander University, Division of Mathematics and Computer Science, Greenwood, SC, USA
  • Pennsylvania State University, Department of Mathematics, University Park, PA, USA (former)


According to our database1, Chaz Schlindwein authored at least 10 papers between 1993 and 2014.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
Understanding preservation theorems: chapter VI of Proper and Improper Forcing, I.
[BibTeX]
[DOI]
Chaz Schlindwein
Arch. Math. Log., 2014

2010
Understanding preservation theorems, II.
[BibTeX]
[DOI]
Chaz Schlindwein
Math. Log. Q., 2010

2008
Shelah's work on non-semi-proper iterations, I.
[BibTeX]
[DOI]
Chaz Schlindwein
Arch. Math. Log., 2008

2004
A short proof of the preservation of the omega<sup>omega</sup>-bounding property.
[BibTeX]
[DOI]
Chaz Schlindwein
Math. Log. Q., 2004

TCP/IP laboratory exercises for use with a remotely accessible networking laboratory.
[BibTeX]
[DOI]
Joseph D. Sloan
,
Charles Schlindwein
J. Comput. Sci. Coll., 2004

2003
SH plus CH does not imply stationary antichains.
[BibTeX]
[DOI]
Chaz Schlindwein
Ann. Pure Appl. Log., 2003

2001
Shelah's Work on Non-Semi-Proper Iterations, II.
[BibTeX]
[DOI]
Chaz Schlindwein
J. Symb. Log., 2001

1994
Consistency of Suslin's Hypothesis, a Nonspecial Aronszajn Tree, and GCH.
[BibTeX]
[DOI]
Chaz Schlindwein
J. Symb. Log., 1994

1993
Suslin's Hypothesis Does Not Imply Stationary Antichains.
[BibTeX]
[DOI]
Chaz Schlindwein
Ann. Pure Appl. Log., 1993

Simplified RCS iterations.
[BibTeX]
[DOI]
Chaz Schlindwein
Arch. Math. Log., 1993


  Loading...