•  10
    Equations for formally real meadows
    with Inge Bethke and Alban Ponse
    Journal of Applied Logic 13 (2): 1-23. 2015.
  • Index of Authors of Volume 3
    with L. C. Aiello, L. Lismont, G. Amati, H. Andr6ka, S. Mikulas, N. Pankrat'ev, A. Bucalo, B. Penther, and M. Pentus
    Journal of Logic, Language, and Information 3 (327): 329-330. 1995.
  •  12
  •  11
    Process algebra with four-valued logic
    with Alban Ponse
    Journal of Applied Non-Classical Logics 10 (1): 27-53. 2000.
    ABSTRACT We propose a combination of a fragment of four-valued logic and process algebra. This fragment is geared to a simple relation with process algebra via the conditional guard construct, and can easily be extended to a truth-functionally complete logic. We present an operational semantics in SOS-style, and a completeness result for ACP with conditionals and four- valued logic. Completeness is preserved under the restriction to some other non-classical logics
  •  34
    A propositional logic with 4 values: true, false, divergent and meaningless
    with Inge Bethke and Piet Rodenburg
    Journal of Applied Non-Classical Logics 5 (2): 199-217. 1995.
  •  7
    Transformation of fractions into simple fractions in divisive meadows
    with C. A. Middelburg
    Journal of Applied Logic 16 92-110. 2016.
  •  28
    Effective Transformations on Probabilistic Data
    Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18): 219-226. 1979.
  •  7
    Abrahamson, KA, Downey, RG and Fellows, MR
    with R. Banacb, H. Barendregt, J. V. Tucker, J. Brendle, I. Moerdijk, E. Palmgren, J. I. Seiferas, A. R. Meyer, and J. Terlouw
    Annals of Pure and Applied Logic 73 (1): 327. 1995.
  •  23
    Logic of transition systems
    Journal of Logic, Language and Information 3 (4): 247-283. 1994.
    Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (in…Read more
  •  7
    Program algebra with a jump-shift instruction
    with C. A. Middelburg
    Journal of Applied Logic 6 (4): 553-563. 2008.
  •  2
    Division by zero in non-involutive meadows
    with C. A. Middelburg
    Journal of Applied Logic 13 (1): 1-12. 2015.
  •  17
    Bochvar-McCarthy Logic and Process Algebra
    with Alban Ponse
    Notre Dame Journal of Formal Logic 39 (4): 464-484. 1998.
    We propose a combination of Bochvar's strict three-valued logic, McCarthy's sequential three-valued logic, and process algebra via the conditional guard construct. This combination entails the introduction of a new constant meaningless in process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditional guard construct and the proposed logic
  •  4
    Inversive meadows and divisive meadows
    with C. A. Middelburg
    Journal of Applied Logic 9 (3): 203-220. 2011.
  •  36
    Degrees of sensible lambda theories
    with Henk Barendregt, Jan Willem Klop, and Henri Volken
    Journal of Symbolic Logic 43 (1): 45-55. 1978.
    A λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Godel numbers of its elements. H is the $\lamda$ -theory axiomatized by the set {M = N ∣ M, N unsolvable. A $\lamda$ -theory is sensible $\operatorname{iff} T \supset \mathscr{H}$ , for a motivation see [6] and [4]. In § it is proved that the theory H is ∑ 0 2 -complete. We present Wadsworth's proof that its unique maximal consistent extention $\mathscr{H}^\ast (= …Read more
  •  6
    Simulating Turing machines on Maurer machines
    with C. A. Middelburg
    Journal of Applied Logic 6 (1): 1-23. 2008.
  •  9
    Execution architectures for program algebra
    with Alban Ponse
    Journal of Applied Logic 5 (1): 170-192. 2007.
  •  14
    Discourse between processes
    Notre Dame Journal of Formal Logic 21 (1): 131-134. 1980.
  •  19
    Note on paraconsistency and reasoning about fractions
    with Inge Bethke
    Journal of Applied Non-Classical Logics 25 (2): 120-124. 2015.
    We apply a paraconsistent strategy to reasoning about fractions
  •  17
    Logic of transition systems
    Journal of Logic, Language and Information 3 (4): 247-283. 1994.
    Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (in…Read more
  •  12
    The data type variety of stack algebras
    with J. V. Tucker
    Annals of Pure and Applied Logic 73 (1): 11-36. 1995.
    We define and study the class of all stack algebras as the class of all minimal algebras in a variety defined by an infinite recursively enumerable set of equations. Among a number of results, we show that the initial model of the variety is computable, that its equational theory is decidable, but that its equational deduction problem is undecidable. We show that it cannot be finitely axiomatised by equations, but it can be finitely axiomatised by equations with a hidden sort and functions. This…Read more