Inge Bethke

Publication Activity (10 Years)

Years Active: 1991-2017
Publications (10 Years): 7

Top Topics

Multivariate Decision Trees

Predicate Logic

Top Venues

J. Log. Algebraic Methods Program.

Theory Comput. Syst.

Sci. Ann. Comput. Sci.

Publications

Jan A. Bergstra, Inge Bethke
Subvarieties of the Variety of Meadows. Sci. Ann. Comput. Sci. 27 (1) (2017)
Jan A. Bergstra, Inge Bethke, Dimitri Hendriks
Universality of Univariate Mixed Fractions in Divisive Meadows. CoRR (2017)
Inge Bethke, Pieter Hendrik Rodenburg, Arjen Sevenster
The structure of finite meadows. J. Log. Algebraic Methods Program. 84 (2) (2015)
Jan A. Bergstra, Inge Bethke
A negative result on algebraic specifications of the meadow of rational numbers. CoRR (2015)
Jan A. Bergstra, Inge Bethke
Note on paraconsistency and reasoning about fractions. J. Appl. Non Class. Logics 25 (2) (2015)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Equations for formally real meadows. J. Appl. Log. 13 (2) (2015)
Jan A. Bergstra, Inge Bethke
Subvarieties of the variety of meadows. CoRR (2015)
Jan A. Bergstra, Inge Bethke
Note on paraconsistency and the logic of fractions. CoRR (2014)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Equations for formally real meadows. CoRR (2013)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56 (1) (2013)
Jan A. Bergstra, Inge Bethke
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50 (4) (2012)
Inge Bethke, Piet Rodenburg
Typability in Partial Applicative Structures. J. Log. Lang. Inf. 20 (2) (2011)
Inge Bethke, Alban Ponse, Piet Rodenburg
Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday. Theor. Comput. Sci. 412 (28) (2011)
Jan A. Bergstra, Inge Bethke
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48 (4) (2011)
Jan A. Bergstra, Inge Bethke
On the contribution of backward jumps to instruction sequence expressiveness CoRR (2010)
Inge Bethke, Piet Rodenburg
The initial meadows. J. Symb. Log. 75 (3) (2010)
Inge Bethke, Piet Rodenburg, Arjen Sevenster
The structure of finite meadows CoRR (2009)
Jan A. Bergstra, Inge Bethke
Square root meadows CoRR (2009)
Jan A. Bergstra, Inge Bethke
Straight-line instruction sequence completeness for total calculation on cancellation meadows CoRR (2009)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Cancellation Meadows: a Generic Basis Theorem and Some Applications. CoRR (2008)
Jan A. Bergstra, Inge Bethke, Mark Burgess
A process algebra based framework for promise theory CoRR (2007)
Inge Bethke, Piet Rodenburg
Some properties of finite meadows CoRR (2007)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Decision problems for pushdown threads. Acta Informatica 44 (2) (2007)
Jan A. Bergstra, Inge Bethke
Network algebra in Java. J. Log. Algebraic Methods Program. 62 (2) (2005)
Jan A. Bergstra, Inge Bethke
An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94 (6) (2005)
Jan A. Bergstra, Inge Bethke
Polarized process algebra with reactive composition. Theor. Comput. Sci. 343 (3) (2005)
Jan A. Bergstra, Inge Bethke
Polarized Process Algebra and Program Equivalence. ICALP (2003)
Jan A. Bergstra, Inge Bethke
Molecular dynamics. J. Log. Algebraic Methods Program. 51 (2) (2002)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Descendants and Origins in Term Rewriting. Inf. Comput. 159 (1-2) (2000)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Extending partial combinatory algebras. Math. Struct. Comput. Sci. 9 (4) (1999)
Inge Bethke, Piet Rodenburg
Equational Constructor Induction. Fundam. Informaticae 25 (1) (1996)
Inge Bethke, Jan Willem Klop, Roel C. de Vrijer
Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS (1996)
Jan A. Bergstra, Inge Bethke, Piet Rodenburg
A propositional logic with 4 values: true, false, divergent and meaningless. J. Appl. Non Class. Logics 5 (2) (1995)
Inge Bethke, Jan Willem Klop
Collapsing Partial Combinatory Algebras. HOA (1995)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Process Algebra with Iteration and Nesting. Comput. J. 37 (4) (1994)
Jan A. Bergstra, Inge Bethke, Alban Ponse
Process Algebra with Combinators. CSL (1993)
Inge Bethke
Finite Type Structures within Combinatory Algebras. Ann. Pure Appl. Log. 55 (2) (1991)
Inge Bethke
Coherence Spaces are Untopological. Theor. Comput. Sci. 85 (2) (1991)