We stand with Ukraine  

Thomas G. McLaughlin

According to our database1, Thomas G. McLaughlin authored at least 18 papers between 1962 and 2010.

Collaborative distances:
  • no known Dijkstra number2.
  • no known Erdős number3.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Some observations on the substructure lattice of a Delta<sub>1</sub> ultrapower.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 2010

2007
Delta<sub>1</sub> Ultrapowers are totally rigid.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Arch. Math. Log., 2007

2002
Combinatorial Isols and the Arithmetic of Dekker Semirings.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 2002

1999
Existentially Incomplete Tame Models and a Conjecture of Ellentuck.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1999

1995
Existentially Complete Nerode Semirings.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1995

1993
A Note on Effective Ultrapowers: Uniform Failure of Bounded Collection.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1993

1992
Eight Problems about Nerode Semirings (Recursive Ultrapowers).
[BibTeX]
[DOI]
Thomas G. McLaughlin
Ann. Pure Appl. Log., 1992

Recursive ultrapowers, simple models, and cofinal extensions.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Arch. Math. Log., 1992

1990
Sub-Arithmetical Ultrapowers: A Survey.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Ann. Pure Appl. Log., 1990

1989
Some Extension and Rearrangement Theorems For Nerode Semirings.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1989

1986
Some Elementary Degree-Theoretic Reasons Why Structures Need Similarity Types.
[BibTeX]
[DOI]
Thomas G. McLaughlin
J. Symb. Log., 1986

1979
Meeting of the Association for Symbolic Logic Houston, 1978.
[BibTeX]
[DOI]
Thomas G. McLaughlin
J. Symb. Log., 1979

1977
Degrees of unsolvability and strong forms of Λ<sub>R</sub> + Λ<sub>R</sub> ⊈ Λ<sub>R</sub>.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Notre Dame J. Formal Log., 1977

1976
Correction to my Paper "Closed Basic Retracing Functions and Hyperimmune Sets".
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1976

Trees and Isols II.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Math. Log. Q., 1976

1965
Strong reducibility on hypersimple sets.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Notre Dame J. Formal Log., 1965

1964
A note on pseudo doubly creative pairs.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Notre Dame J. Formal Log., 1964

1962
On an extension of a theorem of Friedberg.
[BibTeX]
[DOI]
Thomas G. McLaughlin
Notre Dame J. Formal Log., 1962


  Loading...