A note on the arithmetical hierarchy. - Stephen L. Bloom (Notre Dame J. Formal Log., 1968)

A semi-completeness theorem. - Stephen L. Bloom (Notre Dame J. Formal Log., 1969)

Investigations into the sentential calculus with identity. - Stephen L. Bloom; Roman Suszko (Notre Dame J. Formal Log., 1972)

Extensions of Gödel's completeness theorem and the Löwenheim-Skolem theorem. - Stephen L. Bloom (Notre Dame J. Formal Log., 1973)

A note on the predicatively definable sets of N. N. Nepeîvoda. - Stephen L. Bloom (Math. Log. Q., 1975)

Varieties of Ordered Algebras. - Stephen L. Bloom (J. Comput. Syst. Sci., 1976)

The Existence and Construction of Free Iterative Theories. - Stephen L. Bloom; Calvin C. Elgot (J. Comput. Syst. Sci., 1976)

Errata: "Investigations into the sentential calculus with identity". - Stephen L. Bloom; Roman Suszko (Notre Dame J. Formal Log., 1976)

Scalar and Vector Iteration. - Stephen L. Bloom; Susanna Ginali; Joseph D. Rutledge (J. Comput. Syst. Sci., 1977)

On the Algebraic Atructure of Rooted Trees. - Calvin C. Elgot; Stephen L. Bloom; Ralph Tindell (J. Comput. Syst. Sci., 1978)

Algebraic and Graph Theoretic Characterizations of Structured Flowchart Schemes. - Stephen L. Bloom; Ralph Tindell (Theor. Comput. Sci., 1979)

Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation. - Stephen L. Bloom; Calvin C. Elgot; Jesse B. Wright (SIAM J. Comput., 1980)

Vector Iteration in Pointed Iterative Theories. - Stephen L. Bloom; Calvin C. Elgot; Jesse B. Wright (SIAM J. Comput., 1980)

Compatible Orderings on the Metric Theory of Trees. - Stephen L. Bloom; Ralph Tindell (SIAM J. Comput., 1980)

Easy Solutions are Hard To Find. - Stephen L. Bloom; David B. Patterson (CAAP, 1981)

Selected papers. - Calvin C. Elgot; Stephen L. Bloom (Springer, 1982)

All Solutions of a System of Recursion Equations in Infinite Trees and Other Contraction Theories. - Stephen L. Bloom (J. Comput. Syst. Sci., 1983)

Recursion and Iteration in Continuous Theories: The "M-Construction". - Stephen L. Bloom; James W. Thatcher; Eric G. Wagner; Jesse B. Wright (J. Comput. Syst. Sci., 1983)

Varieties of "if-then-else". - Stephen L. Bloom; Ralph Tindell (SIAM J. Comput., 1983)

Some varieties of iteration theories. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1984)

Frontiers of one-letter languages. - Stephen L. Bloom (Acta Cybern., 1985)

Axiomatizing Schemes and Their Behaviors. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1985)

A Logical Characterization of Observation Equivalence. - Stephen L. Bloom; Douglas R. Troeger (Theor. Comput. Sci., 1985)

The alternation number and a dot hierarchy of regular sets. - Stephen L. Bloom (Acta Cybern., 1986)

A note on zero-congruences. - Stephen L. Bloom; Ralph Tindell (Acta Cybern., 1987)

Varieties of Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (SIAM J. Comput., 1988)

The Equational Logic of Iterative Processes. - Stephen L. Bloom (FCT, 1989)

Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. - Stephen L. Bloom; Klaus Sutner (TAPSOFT, Vol.1, 1989)

Equational Logic of Circular Data Type Specification. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1989)

A Note on Guarded Theories. - Stephen L. Bloom (Theor. Comput. Sci., 1990)

Program Correctness and Matricial Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (MFPS, 1991)

Iteration Algebras (Extended Abstract). - Stephen L. Bloom; Zoltán Ésik (TAPSOFT, Vol.1, 1991)

Cayley iff Stone. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1991)

Floyd-Hoare Logic in Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (J. ACM, 1991)

Iteration Algebras. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1992)

Some Quasi-Varieties of Iteration Theories. - Stephen L. Bloom; Zoltán Ésik (MFPS, 1993)

Erratum: Iteration Algebras. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1993)

Matrix and Matricial Iteration Theories, Part I. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1993)

Matrix and Matricial Iteration Theories, Part II. - Stephen L. Bloom; Zoltán Ésik (J. Comput. Syst. Sci., 1993)

Equational Axioms for Regular Sets. - Stephen L. Bloom; Zoltán Ésik (Math. Struct. Comput. Sci., 1993)

Iteration Theories - The Equational Logic of Iterative Processes - Stephen L. Bloom; Zoltán Ésik (Springer, 1993)

Iteration Theories of Synchronization Trees - Stephen L. Bloom; Zoltán Ésik; Dirk Taubner (Inf. Comput., 1993)

Solving Polynomial Fixed Point Equations. - Stephen L. Bloom; Zoltán Ésik (MFCS, 1994)

Free Shuffle Algebras in Language Varieties (Extended Abstract). - Stephen L. Bloom; Zoltán Ésik (LATIN, 1995)

Nonfinite Axiomatizability of Shuffle Inequalities. - Stephen L. Bloom; Zoltán Ésik (TAPSOFT, 1995)

Some Equational Laws of Initiality in 2CCC's. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 1995)

Matrices, machines and behaviors. - Stephen L. Bloom; Nicoletta Sabadini; Robert F. C. Walters (Appl. Categorical Struct., 1996)

Two Axiomatizations of a Star Semiring Quasi-Variety. - Stephen L. Bloom; Zoltán Ésik (Bull. EATCS, 1996)

Fixed-Point Operations on ccc's. Part I. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1996)

Free Shuffle Algebras in Language Varieties. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1996)

Iteration 2-Theories: Extended Abstract. - Stephen L. Bloom; Anna Labella; Zoltán Ésik; Ernest G. Manes (AMAST, 1997)

Axiomatizing Shuffle and Concatenation in Languages. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 1997)

Varieties Generated by Languages with Poset Operations. - Stephen L. Bloom; Zoltán Ésik (Math. Struct. Comput. Sci., 1997)

The Equational Logic of Fixed Points (Tutorial). - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 1997)

Shuffle binoids. - Stephen L. Bloom; Zoltán Ésik (RAIRO Theor. Informatics Appl., 1998)

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (LATIN, 2000)

Iteration 2-theories. - Stephen L. Bloom; Zoltán Ésik; Anna Labella; Ernest G. Manes (Appl. Categorical Struct., 2001)

Long words: the theory of concatenation and omega-power. - Stephen L. Bloom; Christian Choffrut (Theor. Comput. Sci., 2001)

Unique, guarded fixed points in an additive setting: Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (CTCS, 2002)

Axioms for Regular Words: Extended Abstract. - Stephen L. Bloom; Zoltán Ésik (FSTTCS, 2003)

Deciding whether the frontier of a regular tree is scattered. - Stephen L. Bloom; Zoltán Ésik (Fundam. Informaticae, 2003)

An Extension Theorem with an Application to Formal Tree Series. - Stephen L. Bloom; Zoltán Ésik (J. Autom. Lang. Comb., 2003)

Axiomatizing omega and omega-op powers of words. - Stephen L. Bloom; Zoltán Ésik (RAIRO Theor. Informatics Appl., 2004)

The equational theory of regular words. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 2005)

Completing Categorical Algebras. - Stephen L. Bloom; Zoltán Ésik (IFIP TCS, 2006)

Regular and Algebraic Words and Ordinals. - Stephen L. Bloom; Zoltán Ésik (CALCO, 2007)

Axiomatizing rational power series - Stephen L. Bloom; Zoltán Ésik (CoRR, 2007)

Partial Conway and Iteration Semirings. - Stephen L. Bloom; Zoltán Ésik; Werner Kuich (Fundam. Informaticae, 2008)

On Algebras with Iteration. - Jirí Adámek; Stephen L. Bloom; Stefan Milius (J. Log. Comput., 2008)

Cycle-Free Finite Automata in Partial Iterative Semirings. - Stephen L. Bloom; Zoltán Ésik; Werner Kuich (CAI, 2009)

Scattered Algebraic Linear Orderings. - Stephen L. Bloom; Zoltán Ésik (FICS, 2009)

Axiomatizing rational power series over natural numbers. - Stephen L. Bloom; Zoltán Ésik (Inf. Comput., 2009)

Algebraic Ordinals. - Stephen L. Bloom; Zoltán Ésik (Fundam. Informaticae, 2010)

A Mezei-Wright theorem for categorical algebras. - Stephen L. Bloom; Zoltán Ésik (Theor. Comput. Sci., 2010)

Algebraic Linear Orderings. - Stephen L. Bloom; Zoltán Ésik (Int. J. Found. Comput. Sci., 2011)

A Note on Ordinal DFAs. - Stephen L. Bloom; YiDi Zhang (Order, 2013)