Skip to main content
SpringerLink
Log in
Book cover

Combinatorics, Computability and Logic

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

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. C. S. Calude

    1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. M. J. Dinneen

    1. Department of Computer Science, University of Auckland, Auckland, New Zealand

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. S. Sburlan

    1. Faculty of Mathematics and Computer Science, “Ovidius” University, Constanta, Romania

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Discrete Mathematics and Theoretical Computer Science (DISCMATH)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (20 papers)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  3. Contributed papers

    1. Some Results for Some Conjectures in Addition Chains

      • Hatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula
      Pages 47-54

    2. A Highly Random Number

      • Verónica Becher, Sergio Daicz, Gregory Chaitin
      Pages 55-68

    3. Dini’s Theorem: A Constructive Case Study

      • Douglas S. Bridges
      Pages 69-80

    4. Even Linear Simple Matrix Languages: Formal Language Aspects

      • Henning Fernau
      Pages 81-96

    5. Pseudo-BCK Algebras: An Extension of BCK Algebras

      • George Georgescu, Afrodita Iorgulescu
      Pages 97-114

    6. P-Immune Sets with Holes Lack Self-Reducibility Properties

      • Lane A. Hemaspaandra, Harald Hempel
      Pages 115-124

    7. Lex Ideals of Generalized MV-Algebras

      • Daniel Hort, Jiří Rachůnek
      Pages 125-136

    8. Armstrong Systems on Ordered Sets

      • Jouni Järvinen
      Pages 137-149

    9. Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings

      • Vadim E. Levit, Eugen Mandrescu
      Pages 151-157

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

      • Martin Plátek, Tomáš Holan, Vladislav Kuboň
      Pages 159-173

    11. On the Structure of Linear Cellular Automata

      • Adriana Popovici, Dan Popovici
      Pages 175-185

    12. Monotonically Computable Real Numbers

      • Robert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl
      Pages 187-201

    13. Apartness as a Relation Between Subsets

      • Peter Schuster, Luminiţa Vîţă, Douglas S. Bridges
      Pages 203-214

    14. How Large is the Set of Disjunctive Sequences?

      • Ludwig Staiger
      Pages 215-225

    15. A Loopless Generation of Bitstrings without p Consecutive Ones

      • Vincent Vajnovszki
      Pages 227-240
Back to top

Keywords

Editors and Affiliations

  • Department of Computer Science, University of Auckland, Auckland, New Zealand

    C. S. Calude, M. J. Dinneen

  • Faculty of Mathematics and Computer Science, “Ovidius” University, Constanta, Romania

    S. Sburlan

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation