Inductive definitions in COLD-K

This paper reports on the form and the logical semantics of inductive definitions in the wide-spectrum design language COLD-K. It is shown how and when predicate definitions of the form the smallest P satisfying property A(P) can be transformed into monotonic predicate functions with P as their least fixpoint.

[1]  Craig Smorynski,et al.  Arithmetic analogues of McAloon's unique Rosser sentences , 1989, Archive for Mathematical Logic.

[2]  Michiel Doorman.  The existence property in the presence of function symbols , 1988 .

[3]  Frans Voorbraak,et al.  The logic of actual obligation. An alternative approach to deontic logic , 1989 .

[4]  Jan A. Bergstra,et al.  Put and get, primitives for synchronous unreliable message passing , 1985 .

[5]  Frans Voorbraak,et al.  A Computationally Efficient Approximation of Dempster-Shafer Theory , 1988, Int. J. Man Mach. Stud..

[6]  H. van Ditmarsch.  Abstractie in wiskunde, expertsystemen en argumentatie , 1986 .

[7]  Albert Visser,et al.  Peano's Smart Children: A Provability Logical Study of Systems with Built-in Consistency , 1986, Notre Dame J. Formal Log..

[8]  Albert Visser,et al.  Explicit Fixed Points in Interpretability Logic , 1989, Stud Logica.

[9]  Georg Kreisel,et al.  HILBERT'S PROGRAMME , 1958 .

[10]  Albert Visser.  Kunnen wij elke machine verslaan?: Beschouwingen rondom Lucas' Argument , 1986 .

[11]  F. D. Vries,et al.  Applications of constructive logic to sheaf constructions in toposes , 1987 .

[12]  Albert Visser,et al.  The formalization of Interpretability , 1991, Stud Logica.

[13]  P. Rodenburg,et al.  Specification of the Fast Fourier Transform algorithm as a term rewriting system , 1987 .

[14]  D. de Jonh,et al.  COMPUTATIONS IN FRAGMENTS OF INTUITIONISTIC PROPOSITIONAL LOGIC , 1988 .

[15]  J. A. Bergstra,et al.  Module algebra for relational specifications , 1986 .

[16]  Erwin Engeler,et al.  Languages with expressions of infinite length , 1966 .

[17]  Frans Voorbraak,et al.  On the Justification of Dempster's Rule of Combination , 1988, Artif. Intell..

[18]  F. Voorbraak,et al.  Tensed intuitionistic logic , 1987 .

[19]  Mathematische Gesellschaft der Ddr.  Journal of information processing and cybernetics : EIK , 1987 .

[20]  F.-J. de Vries,et al.  A functional program for Gaussian Elimination , 1987 .

[21]  J.L.M. Vrancken.  Parallel Object Oriented Terms Rewriting : a first implementation in Pool2 , 1989 .

[22]  H. B. M. Jonkers,et al.  A semantic framework for the COLD-family of languages , 1986 .

[23]  Frans Voorbraak,et al.  A Simplification of the Completeness Proofs for Guaspari and Solovay's R , 1986, Notre Dame J. Formal Log..

[24]  G. R. Renardel de Lavalette,et al.  Choice in applicative theories , 1989 .

[25]  Gerard R. Renardel de Lavalette,et al.  Interpolation in fragments of intuitionistic propositional logic , 1987, Journal of Symbolic Logic.

[26]  Fer-Jan de Vries.  A functional program for the fast Fourier transform , 1988, ACM SIGPLAN Notices.

[27]  G. R. Renardel de Lavalette,et al.  Strictness analysis for POLYREC, a language with polymorphic and recursive types , 1988 .

[28]  Jan A. Bergstra,et al.  Process algebra semantics for queues , 1983 .

[29]  Fer-Jan de Vries,et al.  Intuitionistic Free Abelian Groups , 1988, Math. Log. Q..

[30]  J. C. Mulder,et al.  A modular approach to protocol verification using process algebra , 1986 .

[31]  Erik C. W. Krabbe.  Naess's Dichotomy of Tenability and Relevance , 1986 .

[32]  G. R. Renardel de Lavalette,et al.  Interpolation in natural fragments of intuitionistic propositional logic , 1986 .

[33]  Albert Visser,et al.  Preliminary notes on interpretability logic , 1988 .

[34]  M.F.J. Drossaers.  A perceptron network theorem prover for the propositional calculus , 1989 .

[35]  D. van Dalen,et al.  The war of frogs and mice, or the crisis of the Mathematische Annalen , 1987 .

[36]  P. H. Rodenburg,et al.  Manufacturing a cartesian closed category with exactly two objects out of a C-monoid , 1989, Stud Logica.

[37]  A. Visser,et al.  Evaluation, provably deductive equivalence in Heyting's arithmetic of substitution instances of propositional formulas , 1985 .

[38]  Albert Visser,et al.  A descending hierarchy of reflection principles , 1988 .

[39]  J. Vrancken,et al.  Parallel object-oriented term rewriting : the booleans , 1988 .