|
" Combinatorics, computability and logic : "
C.S. Calude, M.J. Dinneen and S. Sburlan, eds.
Document Type
|
:
|
BL
|
Record Number
|
:
|
714968
|
Doc. No
|
:
|
b537120
|
Main Entry
|
:
|
C.S. Calude, M.J. Dinneen and S. Sburlan, eds.
|
Title & Author
|
:
|
Combinatorics, computability and logic : : proceedings of the Third International Conference on Combinatorics, Computability and Logic, (DMTCS'01)\ C.S. Calude, M.J. Dinneen and S. Sburlan, eds.
|
Publication Statement
|
:
|
London: Springer, ©2001.
|
Series Statement
|
:
|
Discrete mathematics and theoretical computer science.
|
Page. NO
|
:
|
x, 251 p. ; 24 cm.
|
ISBN
|
:
|
1852335262
|
|
:
|
: 9781852335267
|
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.
|
Subject
|
:
|
Combinatorial analysis -- Congresses.
|
Subject
|
:
|
Computational complexity -- Congresses.
|
Subject
|
:
|
Logic, Symbolic and mathematical -- Congresses.
|
Added Entry
|
:
|
Cristian Calude
|
|
:
|
M J Dinneen
|
|
:
|
Silviu Sburlan
|
| |