-
8Non-commutative propositional logic with short-circuit evaluationJournal of Applied Non-Classical Logics 31 (3-4): 234-278. 2021.Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is evaluated only if the first is insufficient to determine the value of the expression. Com...
-
22Logic of transition systemsJournal 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
-
19The data type variety of stack algebrasAnnals 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
-
15Process algebra with four-valued logicJournal 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
-
50A propositional logic with 4 values: true, false, divergent and meaninglessJournal of Applied Non-Classical Logics 5 (2): 199-217. 1995.
-
7Transformation of fractions into simple fractions in divisive meadowsJournal of Applied Logic 16 92-110. 2016.
-
40Effective Transformations on Probabilistic DataZeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (13-18): 219-226. 1979.
-
32Logic of transition systemsJournal 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
-
19Bochvar-McCarthy Logic and Process AlgebraNotre 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
-
52Degrees of sensible lambda theoriesJournal 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
-
26Note on paraconsistency and reasoning about fractionsJournal of Applied Non-Classical Logics 25 (2): 120-124. 2015.We apply a paraconsistent strategy to reasoning about fractions
-
University of AmsterdamRegular Faculty
Amsterdam, North Holland, Netherlands
Areas of Specialization
Logic and Philosophy of Logic |
Philosophy of Computing and Information |
Philosophy of Mathematics |
Areas of Interest
Philosophy of Action |
Philosophy of Religion |