John Kenneth Truss

Orcid: 0000-0002-0502-5042

Affiliations:
  • University of Leeds, Department of Pure Mathematics, UK


According to our database1, John Kenneth Truss authored at least 42 papers between 1983 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The small index property for countable superatomic boolean algebras.
Arch. Math. Log., November, 2023

2022
Interpreting the weak monadic second order theory of the ordered rationals.
Math. Log. Q., 2022

2021
Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals.
Contributions Discret. Math., 2021

2020
Surjectively rigid chains.
Math. Log. Q., 2020

Ehrenfeucht-FRAïSSé Games on a class of scattered linear Orders.
J. Symb. Log., 2020

2019
On Optimal Representatives of Finite Coloured Linear Orders.
Order, 2019

2018
Ehrenfeucht-Fraïssé games on ordinals.
Ann. Pure Appl. Log., 2018

2017
Reconstructing the Topology on Monoids and Polymorphism Clones of the Rationals.
Stud Logica, 2017

2015
Countable Homogeneous Lattices.
Order, 2015

2014
Homogeneous coloured multipartite graphs.
Eur. J. Comb., 2014

Countable locally 2-arc-transitive bipartite graphs.
Eur. J. Comb., 2014

Some more notions of homomorphism-homogeneity.
Discret. Math., 2014

2012
Finitely generated free Heyting algebras: the well-founded initial segment.
J. Symb. Log., 2012

Countable homogeneous multipartite graphs.
Eur. J. Comb., 2012

Classification of some countable descendant-homogeneous digraphs.
Discret. Math., 2012

2011
Classification of Finite Coloured Linear Orderings.
Order, 2011

Descendant-homogeneous digraphs.
J. Comb. Theory, Ser. A, 2011

Some constructions of highly arc-transitive digraphs.
Comb., 2011

2010
Countably categorical coloured linear orders.
Math. Log. Q., 2010

2009
1-transitive cyclic orderings.
J. Comb. Theory, Ser. A, 2009

2008
Construction of Some Uncountable 2-Arc-Transitive Bipartite Graphs.
Order, 2008

Construction of some countable 1-arc-transitive bipartite graphs.
Discret. Math., 2008

2007
On notions of genericity and mutual genericity.
J. Symb. Log., 2007

Ramsey's theorem and König's Lemma.
Arch. Math. Log., 2007

2004
Okhuma Graphs and Coloured Chains.
Order, 2004

Countable, 1-transitive, coloured linear orderings I.
J. Comb. Theory, Ser. A, 2004

2003
Recovering ordered structures from quotients of their automorphism groups.
J. Symb. Log., 2003

Non-well-foundedness of well-orderable power sets.
J. Symb. Log., 2003

The automorphism group of the random graph: four conjugates good, three conjugates better.
Discret. Math., 2003

A notion of rank in set theory without choice.
Arch. Math. Log., 2003

2001
Elementary Properties of Cycle-free Partial Orders and their Automorphism Groups.
Order, 2001

On Computable Automorphisms of The Rational Numbers.
J. Symb. Log., 2001

On quasi-amorphous sets.
Arch. Math. Log., 2001

2000
On o-Amorphous Sets.
Ann. Pure Appl. Log., 2000

1999
On Homogeneous Semilattices and Their Automorphism Groups.
Order, 1999

The Independence of The Prime Ideal Theorem From The Order-Extension Principle.
J. Symb. Log., 1999

On Distinguishing Quotients of Symmetric Groups.
Ann. Pure Appl. Log., 1999

On N<sub>0</sub>-Categorical Weakly o-Minimal Structures.
Ann. Pure Appl. Log., 1999

1995
The Structure of Amorphous Sets.
Ann. Pure Appl. Log., 1995

1991
Discrete mathematics for computer scientists.
International computer science series, Addison-Wesley, ISBN: 978-0-201-17564-6, 1991

1984
Cancellation laws for surjective cardinals.
Ann. Pure Appl. Log., 1984

1983
The Noncommutativity of Random and Generic Extensions.
J. Symb. Log., 1983


  Loading...