Combinatorics, Computability and Logic

Proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS’01)

Editors:

ISBN: 978-1-85233-526-7 (Print) 978-1-4471-0717-0 (Online)

Table of contents (20 chapters)

  1. Front Matter

    Pages i-x

  2. Invited Papers

    1. No Access

      Book Chapter

      Pages 1-4

      Early Computer Science Adventures of a Mathematician

    2. No Access

      Book Chapter

      Pages 5-12

      Sequentially Continuity in Constructive Mathematics

    3. No Access

      Book Chapter

      Pages 13-31

      Recursive Functions: An Archeological Look

    4. No Access

      Book Chapter

      Pages 33-46

      The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity

  3. Contributed papers

    1. No Access

      Book Chapter

      Pages 47-54

      Some Results for Some Conjectures in Addition Chains

    2. No Access

      Book Chapter

      Pages 55-68

      A Highly Random Number

    3. No Access

      Book Chapter

      Pages 69-80

      Dini’s Theorem: A Constructive Case Study

    4. No Access

      Book Chapter

      Pages 81-96

      Even Linear Simple Matrix Languages: Formal Language Aspects

    5. No Access

      Book Chapter

      Pages 97-114

      Pseudo-BCK Algebras: An Extension of BCK Algebras

    6. No Access

      Book Chapter

      Pages 115-124

      P-Immune Sets with Holes Lack Self-Reducibility Properties

    7. No Access

      Book Chapter

      Pages 125-136

      Lex Ideals of Generalized MV-Algebras

    8. No Access

      Book Chapter

      Pages 137-149

      Armstrong Systems on Ordered Sets

    9. No Access

      Book Chapter

      Pages 151-157

      Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings

    10. No Access

      Book Chapter

      Pages 159-173

      On Relax-ability of Word-Order by D-grammars

    11. No Access

      Book Chapter

      Pages 175-185

      On the Structure of Linear Cellular Automata

    12. No Access

      Book Chapter

      Pages 187-201

      Monotonically Computable Real Numbers

    13. No Access

      Book Chapter

      Pages 203-214

      Apartness as a Relation Between Subsets

    14. No Access

      Book Chapter

      Pages 215-225

      How Large is the Set of Disjunctive Sequences?

    15. No Access

      Book Chapter

      Pages 227-240

      A Loopless Generation of Bitstrings without p Consecutive Ones

    16. No Access

      Book Chapter

      Pages 241-251

      Greedy Algorithms for the Lower and Upper Chromatic Numbers

  4. Back Matter

    Pages 253-253