Cover Image
Read Now

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

Bibliographic Details
Other Authors: Calude, C.S. (Editor), Dinneen, M.J. (Editor), Sburlan, S. (Editor)
Format: eBook
Language:English
Published: London Springer London 2001, 2001
Edition:1st ed. 2001
Series:Discrete Mathematics and Theoretical Computer Science
Subjects:
Applied Mathematics
Discrete Mathematics
Mathematical Logic And Formal Languages
Engineering Mathematics
Combinatorics
Mathematical Logic
Algorithms
Applications Of Mathematics
Mathematical Logic And Foundations
Algorithm Analysis And Problem Complexity
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Table of Contents:
  • Invited papers
  • Early Computer Science Adventures of a Mathematician
  • Sequentially Continuity in Constructive Mathematics
  • Recursive Functions: An Archeological Look
  • The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity
  • Contributed papers
  • Some Results for Some Conjectures in Addition Chains
  • A Highly Random Number
  • Dini’s Theorem: A Constructive Case Study
  • Even Linear Simple Matrix Languages: Formal Language Aspects
  • Pseudo-BCK Algebras: An Extension of BCK Algebras
  • P-Immune Sets with Holes Lack Self-Reducibility Properties
  • Lex Ideals of Generalized MV-Algebras
  • Armstrong Systems on Ordered Sets
  • Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings
  • On Relax-ability of Word-Order by D-grammars
  • On the Structure of Linear Cellular Automata
  • Monotonically Computable Real Numbers
  • Apartness as a Relation Between Subsets
  • How Large is the Set of Disjunctive Sequences?
  • A Loopless Generation of Bitstrings without p Consecutive Ones
  • Greedy Algorithms for the Lower and Upper Chromatic Numbers

Similar Items