Algorithms for ordinal arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2741, Issue , 2003, Pages 243-258

  Manolios, Panagiotis ^a   Vroon, Daron ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SYSTEMS; FUNCTIONS; THEOREM PROVING;

COMPACT NOTATIONS; COMPUTING SYSTEM; EXPONENTIATIONS; THEOREM PROVING SYSTEMS;

THEOREM PROVING; ALGORITHMS;

COMPUTING SYSTEMS; EXPONENTIATION; ORDINAL ARITHMATIC; TERMINATION;

EID: 7044220131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_19     Document Type: Conference Paper

References (35)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998
2. A. Beckmann, S. R. Buss, and C. Pollett. Ordinal notations and well-orderings in bounded arithmetic. Annals of Pure and Applied Logic, pages 197–223, 2003
3. B. Brock, M. Kaufmann, and J. S. Moore. ACL2 theorems about commercial microprocessors. In M. Srivas and A. Camilleri, editors, Formal Methods in Computer-Aided Design (FMCAD’96), pages 275–293. Springer-Verlag, 1996
4. G. Cantor. Beiträge zur Begründung der transfiniten Mengenlehre. Mathematische Annalen, xlvi:481–512, 1895
5. G. Cantor. Beiträge zur Bgründung der transfiniten Mengenlehre. Mathematische Annalen, xlix:207–246, 1897
6. G. Cantor. Contributions to the Founding of the Theory of Transfinite Numbers. Dover Publications, Inc., 1952. Translated by Philip E. B. Jourdain
7. A. Church and S. C. Kleene. Formal definitions in the theory of ordinal numbers. Fundamenta mathematicae, 28:11–21, 1937
8. N. Dershowitz. Trees, ordinals, and termination. In Proceedings of the 4th International Joint Conference on Theory and Practice of Software Development (TAPSOFT), volume 668 of LNCS, pages 243–250. Springer-Verlag, April 1993
9. N. Dershowitz and M. Okada. Proof-theoritic techniques for term rewriting theory. In 3rd IEEE Symp. on Logic in Computer Science, pages 104–111, 1988
10. N. Dershowitz and E. M. Reingold. Ordinal arithmetic with list structures. In Logical Foundations of Computer Science, pages 117–126, 1992
11. K. Devlin. The Joy of Sets: Fundamentals of Contemporary Set Theory. Springer-Verlag, second edition, 1992
12. J. H. Gallier. What’s so special about Kruskal’s theorem and the ordinal Γ0? A survey of some results in proof theory. Annals of Pure and Applied Logic, pages 199–260, 1991
13. G. Gentzen. Die widerspruchsfreiheit der reinen zahlentheorie. Mathematische Annalen, 112:493–565, 1936. English translation in M. E. Szabo (ed.), The Collected Works of Gerhard Gentzen, pp. 132-213, North Holland, Amsterdam, 1969
14. D. A. Greve. Symbolic simulation of the JEM1 microprocessor. In Formal Methods in Computer-Aided Design–FMCAD, LNCS. Springer-Verlag, 1998
15. M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, July 2000
16. M. Kaufmann and J. S. Moore. ACL2 homepage. See URL http://www.cs.utexas.edu/users/moore/acl2
17. M. Kaufmann and J. S. Moore, editors. Proceedings of the ACL2 Workshop 2000. The University of Texas at Austin, Technical Report TR-00-29, November 2000
18. K. Kunen. Set Theory-an Introduction to Independence Proofs, volume 102 of Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1980
19. P. Manolios. Correctness of pipelined machines. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer-Aided Design–FMCAD 2000, volume 1954 of LNCS, pages 161–178. Springer-Verlag, 2000
20. P. Manolios. Mechanical Verification of Reactive Systems. PhD thesis, University of Texas at Austin, August 2001
21. P. Manolios, K. Namjoshi, and R. Sumners. Linking theorem proving and modelchecking with well-founded bisimulation. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification–CAV ’99, volume 1633 of LNCS, pages 369–379. Springer-Verlag, 1999
22. P. Manolios and D. Vroon. Ordinal arithmetic in ACL2, 2003. Submitted to the 4th International Workshop on the ACL2 Theorem Prover and Its Applications
23. I. Medina-Bulo, F. Palomo-Lozano, and J. A. Alonso-Jimenez. Implementation in ACL2 of well-founded polynomial orderings. In M. Kaufmann and J. S. Moore, editors, Proceedings of the ACL2 Workshop 2002. 2002
24. L. W. Miller. Normal functions and constructive ordinal notations. Journal of Symbolic Logic, 41:439–459, June 1976
25. J. S. Moore, T. Lynch, and M. Kaufmann. A mechanically checked proof of the AMD5K86 floating-point division program. IEEE Trans. Comp., 47(9):913–926, September 1998
26. H. Rogers Jr. Theory of Recursive Functions and Effective Computability. MIT Press, 1st paperback edition, 1987
27. J.-L. Ruiz-Reina, J.-A. Alonso, M.-J. Hidalgo, and F.-J. Martin. Multiset relations: A tool for proving termination. In Kaufmann and Moore [17]
28. D. M. Russinoff. A mechanically checked proof of IEEE compliance of a registertransfer-level specification of the AMD-K7 floating-point multiplication, division, and square root instructions. London Mathematical Society Journal of Computation and Mathematics, 1:148–200, December 1998
29. K. Schütte. Proof Theory. Springer-Verlag, 1977. translated by J. N. Crossley from the revised version of Beweistheorie, 1st edition, 1960
30. A. Setzer. Ordinal systems. In B. Cooper and J. Truss, editors, Sets and Proofs, pages 301–331. Cambridge University Press, 1999
31. A. Setzer. Ordinal systems part 2: One inaccessible. In Logic Colloquium ’98, volume 13 of ASL Lecture Notes in Logic, pages 426–448, 2000
32. R. Sumners. An incremental stuttering refinement proof of a concurrent program in ACL2. In Kaufmann and Moore [17]
33. M. Sustik. Proof of Dixon’s lemma using the ACL2 theorem prover via an explicit ordinal mapping, 2003. Submitted to the 4th International Workshop on the ACL2 Theorem Prover and Its Applications
34. A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge University Press, second edition, 2000
35. O. Veblen. Continuous increasing functions of finite and transfinite ordinals. Transactions of the American Mathematical Society, 9:280–292, 1908.