Norman H. Cohen
- Turing, A. M. On computable numbers, with and application to the Entscheidungsproblem. Proceedings of the London Mathematical Society 2--42 (1936--7), pp. 230--265.Google Scholar
- Gödel, Kurt. On formally undecidable propositions of the Principia Mathematica and related systems, I. Trans. by Elliot Mendelson. In The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, Martin Davis, ed., Raven Press, Hewlett, New York, 1965.Google Scholar
- Harel, David. And/or programs: A new approach to structured programming. ACM TOPLAS 2, No. 1 (January 1980), pp. 1--17. Google ScholarDigital Library
- Dijkstra, Edsger W. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, New Jersey, 1976. Google ScholarDigital Library
- Dijkstra, E. W. Go to statement considered harmful. CACM 11, No. 3 (March 1968), pp. 147--148. Google ScholarDigital Library
- Kleene, Stephen Cole. Mathematical Logic. John Wiley and Sons, New York, 1967.Google Scholar
- Hopcroft, John E., and Ullman, Jeffrey D. Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Massachusetts, 1969. Google ScholarDigital Library
- Rogers, Hartley, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967. Google ScholarDigital Library
- Mooers, Calvin N. Computer software and copyright. Computing Surveys 7, No. 1 (March 1975), pp. 45--72. Google ScholarDigital Library
- Whitehead, Alfred North, and Russell Bertrand. Principia Mathematica, vol. 2. Cambridge University Press, Cambridge, 1912.Google Scholar
Recommendations
Gödel spaces and perfect MV-algebras
The category of Gödel spaces GS (with strongly isotone maps as morphisms), which are dually equivalent to the category of Gödel algebras, is transferred by a contravariant functor H into the category M V ( C ) G of MV-algebras generated by perfect MV-...
Involutive symmetric Gödel spaces, their algebraic duals and logic
AbstractIt is introduced a new algebra called -algebra if is -algebra (i.e. an algebra from the variety generated by perfect MV-algebras) and is a Gödel algebra (i.e. Heyting algebra satisfying the identity
A discriminator variety of Gödel algebras with operators arising in quantum computation
In order to appropriately model the strong quantum computational logic of Cattaneo et al., we introduce an expansion of ^' quasi-MV algebras by lattice operations and a Godel-like implication. We call the resulting algebras Godel quantum computational ...
Comments