Which data types have \(\omega\)-complete initial algebra specifications?
From MaRDI portal
Publication:1318728
DOI10.1016/0304-3975(94)90057-4zbMath0795.68134OpenAlexW2086722576MaRDI QIDQ1318728
Publication date: 5 April 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://dare.uva.nl/personal/pure/en/publications/which-data-types-have-omegacomplete-initial-algebra-specifications(eb607f74-e47e-456a-894e-4485c03388b9).html
equational logicrecursively enumerablealgebraic specificationequational theoryinitial algebradata typesinitial model\(\omega\)- completeinductively complete
Cites Work
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Equational theory of positive numbers with exponentiation is not finitely axiomatizable
- Partial evaluation and \(\omega\)-completeness of algebraic specifications
- Proof by consistency
- Algebraic specifications of computable and semicomputable data types
- On a conjecture of Bergstra and Tucker
- Mixed computation: potential applications and problems for study
- CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
- Finite Axiomatizability using additional predicates
- Completeness of Proof Systems for Equational Specifications
- On algebraic specifications of computable algebras with the discriminator technique
- The λ-calculus is ω-incomplete
- The Logic of Equality
- An equational logic sampler
- Solution of the identity problem for integral exponential functions
- The Lattice Theory of Post Algebras
- An Equational Axiomatization for the Disjoint System of Post Algebras
- Definition of Post's Generalized Negative and Maximum in Terms of One Binary Operation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
