default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInge Bethke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j22]Jan A. Bergstra, Inge Bethke:
Subvarieties of the Variety of Meadows. Sci. Ann. Comput. Sci. 27(1): 1-18 (2017)- [i12]Jan A. Bergstra, Inge Bethke, Dimitri Hendriks:
Universality of Univariate Mixed Fractions in Divisive Meadows. CoRR abs/1707.00499 (2017) - 2015
- [j21]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and reasoning about fractions. J. Appl. Non Class. Logics 25(2): 120-124 (2015) - [j20]Jan A. Bergstra, Inge Bethke, Alban Ponse
:
Equations for formally real meadows. J. Appl. Log. 13(2): 1-23 (2015) - [j19]Inge Bethke, Pieter Hendrik Rodenburg, Arjen Sevenster:
The structure of finite meadows. J. Log. Algebraic Methods Program. 84(2): 276-282 (2015) - [i11]Jan A. Bergstra, Inge Bethke:
A negative result on algebraic specifications of the meadow of rational numbers. CoRR abs/1507.00548 (2015) - [i10]Jan A. Bergstra, Inge Bethke:
Subvarieties of the variety of meadows. CoRR abs/1510.04021 (2015) - 2014
- [i9]Jan A. Bergstra, Inge Bethke:
Note on paraconsistency and the logic of fractions. CoRR abs/1410.8692 (2014) - 2013
- [j18]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: A Generic Basis Theorem and Some Applications. Comput. J. 56(1): 3-14 (2013) - [i8]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Equations for formally real meadows. CoRR abs/1310.5011 (2013) - 2012
- [j17]Jan A. Bergstra, Inge Bethke:
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness. Theory Comput. Syst. 50(4): 706-720 (2012) - 2011
- [j16]Inge Bethke, Piet Rodenburg:
Typability in Partial Applicative Structures. J. Log. Lang. Inf. 20(2): 161-168 (2011) - [j15]Jan A. Bergstra, Inge Bethke:
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) - [j14]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): 3033-3034 (2011) - 2010
- [j13]Inge Bethke, Piet Rodenburg:
The initial meadows. J. Symb. Log. 75(3): 888-895 (2010) - [i7]Jan A. Bergstra, Inge Bethke:
On the contribution of backward jumps to instruction sequence expressiveness. CoRR abs/1005.5662 (2010)
2000 – 2009
- 2009
- [i6]Jan A. Bergstra, Inge Bethke:
Square root meadows. CoRR abs/0901.4664 (2009) - [i5]Inge Bethke, Piet Rodenburg, Arjen Sevenster:
The structure of finite meadows. CoRR abs/0903.1196 (2009) - [i4]Jan A. Bergstra, Inge Bethke:
Straight-line instruction sequence completeness for total calculation on cancellation meadows. CoRR abs/0905.4612 (2009) - 2008
- [i3]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Cancellation Meadows: a Generic Basis Theorem and Some Applications. CoRR abs/0803.3969 (2008) - 2007
- [j12]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Decision problems for pushdown threads. Acta Informatica 44(2): 75-90 (2007) - [i2]Jan A. Bergstra, Inge Bethke, Mark Burgess:
A process algebra based framework for promise theory. CoRR abs/0707.0744 (2007) - [i1]Inge Bethke, Piet Rodenburg:
Some properties of finite meadows. CoRR abs/0712.0917 (2007) - 2005
- [j11]Jan A. Bergstra, Inge Bethke:
An upper bound for the equational specification of finite state services. Inf. Process. Lett. 94(6): 267-269 (2005) - [j10]Jan A. Bergstra, Inge Bethke:
Network algebra in Java. J. Log. Algebraic Methods Program. 62(2): 247-271 (2005) - [j9]Jan A. Bergstra, Inge Bethke:
Polarized process algebra with reactive composition. Theor. Comput. Sci. 343(3): 285-304 (2005) - 2003
- [c4]Jan A. Bergstra, Inge Bethke:
Polarized Process Algebra and Program Equivalence. ICALP 2003: 1-21 - 2002
- [j8]Jan A. Bergstra, Inge Bethke:
Molecular dynamics. J. Log. Algebraic Methods Program. 51(2): 193-214 (2002) - 2000
- [j7]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Descendants and Origins in Term Rewriting. Inf. Comput. 159(1-2): 59-124 (2000)
1990 – 1999
- 1999
- [j6]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Extending partial combinatory algebras. Math. Struct. Comput. Sci. 9(4): 483-505 (1999) - 1996
- [j5]Inge Bethke, Piet Rodenburg:
Equational Constructor Induction. Fundam. Informaticae 25(1): 1-15 (1996) - [c3]Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
Completing Partial Combinatory Algebras With Unique Head-Normal Forms. LICS 1996: 448-454 - 1995
- [j4]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): 199-217 (1995) - [c2]Inge Bethke, Jan Willem Klop:
Collapsing Partial Combinatory Algebras. HOA 1995: 57-73 - 1994
- [j3]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Iteration and Nesting. Comput. J. 37(4): 243-258 (1994) - 1993
- [c1]Jan A. Bergstra, Inge Bethke, Alban Ponse:
Process Algebra with Combinators. CSL 1993: 36-65 - 1991
- [j2]Inge Bethke:
Finite Type Structures within Combinatory Algebras. Ann. Pure Appl. Log. 55(2): 101-123 (1991) - [j1]Inge Bethke:
Coherence Spaces are Untopological. Theor. Comput. Sci. 85(2): 353-357 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
