# Inge Bethke

According to our database

Collaborative distances:

^{1}, Inge Bethke authored at least 38 papers between 1991 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Subvarieties of the Variety of Meadows.

Sci. Ann. Comp. Sci., 2017

Universality of Univariate Mixed Fractions in Divisive Meadows.

CoRR, 2017

2015

The structure of finite meadows.

J. Log. Algebr. Meth. Program., 2015

Equations for formally real meadows.

J. Applied Logic, 2015

Note on paraconsistency and reasoning about fractions.

Journal of Applied Non-Classical Logics, 2015

Subvarieties of the variety of meadows.

CoRR, 2015

A negative result on algebraic specifications of the meadow of rational numbers.

CoRR, 2015

2014

Note on paraconsistency and the logic of fractions.

CoRR, 2014

2013

Equations for formally real meadows.

CoRR, 2013

Cancellation Meadows: A Generic Basis Theorem and Some Applications.

Comput. J., 2013

2012

On the Contribution of Backward Jumps to Instruction Sequence Expressiveness.

Theory Comput. Syst., 2012

2011

Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday.

Theor. Comput. Sci., 2011

Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows.

Theory Comput. Syst., 2011

Typability in Partial Applicative Structures.

Journal of Logic, Language and Information, 2011

2010

The initial meadows.

J. Symb. Log., 2010

On the contribution of backward jumps to instruction sequence expressiveness

CoRR, 2010

2009

Straight-line instruction sequence completeness for total calculation on cancellation meadows

CoRR, 2009

The structure of finite meadows

CoRR, 2009

Square root meadows

CoRR, 2009

2008

Cancellation Meadows: a Generic Basis Theorem and Some Applications.

CoRR, 2008

2007

Some properties of finite meadows

CoRR, 2007

A process algebra based framework for promise theory

CoRR, 2007

Decision problems for pushdown threads.

Acta Inf., 2007

2005

Polarized process algebra with reactive composition.

Theor. Comput. Sci., 2005

Network algebra in Java.

J. Log. Algebr. Program., 2005

An upper bound for the equational specification of finite state services.

Inf. Process. Lett., 2005

2003

Polarized Process Algebra and Program Equivalence.

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Molecular dynamics.

J. Log. Algebr. Program., 2002

2000

Descendants and Origins in Term Rewriting.

Inf. Comput., 2000

1999

Extending partial combinatory algebras.

Mathematical Structures in Computer Science, 1999

1996

Equational Constructor Induction.

Fundam. Inform., 1996

Completing Partial Combinatory Algebras With Unique Head-Normal Forms.

Proceedings of the Proceedings, 1996

1995

A propositional logic with 4 values: true, false, divergent and meaningless.

Journal of Applied Non-Classical Logics, 1995

Collapsing Partial Combinatory Algebras.

Proceedings of the Higher-Order Algebra, 1995

1994

Process Algebra with Iteration and Nesting.

Comput. J., 1994

1993

Process Algebra with Combinators.

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1991

Coherence Spaces are Untopological.

Theor. Comput. Sci., 1991

Finite Type Structures within Combinatory Algebras.

Ann. Pure Appl. Logic, 1991