Finite Type Structures within Combinatory Algebras. - Inge Bethke (Ann. Pure Appl. Log., 1991)

Coherence Spaces are Untopological. - Inge Bethke (Theor. Comput. Sci., 1991)

Process Algebra with Combinators. - Jan A. Bergstra; Inge Bethke; Alban Ponse (CSL, 1993)

Process Algebra with Iteration and Nesting. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Comput. J., 1994)

Collapsing Partial Combinatory Algebras. - Inge Bethke; Jan Willem Klop (HOA, 1995)

A propositional logic with 4 values: true, false, divergent and meaningless. - Jan A. Bergstra; Inge Bethke; Piet Rodenburg (J. Appl. Non Class. Logics, 1995)

Completing Partial Combinatory Algebras With Unique Head-Normal Forms. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (LICS, 1996)

Equational Constructor Induction. - Inge Bethke; Piet Rodenburg (Fundam. Informaticae, 1996)

Extending partial combinatory algebras. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (Math. Struct. Comput. Sci., 1999)

Descendants and Origins in Term Rewriting. - Inge Bethke; Jan Willem Klop; Roel C. de Vrijer (Inf. Comput., 2000)

Molecular dynamics. - Jan A. Bergstra; Inge Bethke (J. Log. Algebraic Methods Program., 2002)

Polarized Process Algebra and Program Equivalence. - Jan A. Bergstra; Inge Bethke (ICALP, 2003)

An upper bound for the equational specification of finite state services. - Jan A. Bergstra; Inge Bethke (Inf. Process. Lett., 2005)

Network algebra in Java. - Jan A. Bergstra; Inge Bethke (J. Log. Algebraic Methods Program., 2005)

Polarized process algebra with reactive composition. - Jan A. Bergstra; Inge Bethke (Theor. Comput. Sci., 2005)

Decision problems for pushdown threads. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Acta Informatica, 2007)

A process algebra based framework for promise theory - Jan A. Bergstra; Inge Bethke; Mark Burgess (CoRR, 2007)

Some properties of finite meadows - Inge Bethke; Piet Rodenburg (CoRR, 2007)

Square root meadows - Jan A. Bergstra; Inge Bethke (CoRR, 2009)

The initial meadows. - Inge Bethke; Piet Rodenburg (J. Symb. Log., 2010)

Typability in Partial Applicative Structures. - Inge Bethke; Piet Rodenburg (J. Log. Lang. Inf., 2011)

Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. - Jan A. Bergstra; Inge Bethke (Theory Comput. Syst., 2011)

Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. - Inge Bethke; Alban Ponse; Piet Rodenburg (Theor. Comput. Sci., 2011)

On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. - Jan A. Bergstra; Inge Bethke (Theory Comput. Syst., 2012)

Cancellation Meadows: A Generic Basis Theorem and Some Applications. - Jan A. Bergstra; Inge Bethke; Alban Ponse (Comput. J., 2013)

Note on paraconsistency and the logic of fractions. - Jan A. Bergstra; Inge Bethke (CoRR, 2014)

A negative result on algebraic specifications of the meadow of rational numbers. - Jan A. Bergstra; Inge Bethke (CoRR, 2015)

Note on paraconsistency and reasoning about fractions. - Jan A. Bergstra; Inge Bethke (J. Appl. Non Class. Logics, 2015)

Equations for formally real meadows. - Jan A. Bergstra; Inge Bethke; Alban Ponse (J. Appl. Log., 2015)

The structure of finite meadows. - Inge Bethke; Pieter Hendrik Rodenburg; Arjen Sevenster (J. Log. Algebraic Methods Program., 2015)

Universality of Univariate Mixed Fractions in Divisive Meadows. - Jan A. Bergstra; Inge Bethke; Dimitri Hendriks (CoRR, 2017)

Subvarieties of the Variety of Meadows. - Jan A. Bergstra; Inge Bethke (Sci. Ann. Comput. Sci., 2017)