Combinatorics, Computability and Logic

The conference was open to all areas of discrete mathematics and theoretical computer science, and the papers contained within this volume cover topics such as: abstract data types and specifications; algorithms and data structures; automata and formal languages; computability, complexity and constructive mathematics; discrete mathematics, combinatorial computing and category theory; logic, nonmonotonic logic and hybrid systems; molecular computing.

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

• 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