Abstract is missing.
- Early Computer Science Adventures of a MathematicianFrank Harary. 1-4 [doi]
- Sequentially Continuity in Constructive MathematicsHajime Ishihara. 5-12 [doi]
- Recursive Functions: An Archeological LookPiergiorgio Odifreddi. 13-31 [doi]
- The Number of Graphs and Digraphs with a Fixed Diameter and ConnectivityIoan Tomescu. 33-46 [doi]
- Some Results for Some Conjectures in Addition ChainsHatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula. 47-54 [doi]
- A Highly Random NumberVerónica Becher, Sergio Daicz, Gregory J. Chaitin. 55-68 [doi]
- Dini's Theorem: A Constructive Case StudyDouglas S. Bridges. 69-80 [doi]
- Even Linear Simple Matrix Languages: Formal Language AspectsHenning Fernau. 81-96 [doi]
- Pseudo-BCK Algebras: An Extension of BCK AlgebrasGeorge Georgescu, Afrodita Iorgulescu. 97-114 [doi]
- P-Immune Sets with Holes Lack Self-Reducibility PropertiesLane A. Hemaspaandra, Harald Hempel. 115-124 [doi]
- Lex Ideals of Generalized MV-AlgebrasDaniel Hort, Jirí Rachunek. 125-136 [doi]
- Armstrong Systems on Ordered SetsJouni Järvinen. 137-149 [doi]
- Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum MatchingsVadim E. Levit, Eugen Mandrescu. 151-157 [doi]
- On Relax-ability of Word-Order by D-grammarsMartin Plátek, Tomás Holan, Vladislav Kubon. 159-173 [doi]
- On the Structure of Linear Cellular AutomataAdriana Popovici, Dan Popovici. 175-185 [doi]
- Monotonically Computable Real NumbersRobert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl. 187-201 [doi]
- Apartness as a Relation Between SubsetsPeter Schuster 0001, Luminita Vîta, Douglas S. Bridges. 203-214 [doi]
- How Large is the Set of Disjunctive Sequences?Ludwig Staiger. 215-225 [doi]
- A Loopless Generation of Bitstrings without p Consecutive OnesVincent Vajnovszki. 227-240 [doi]
- Greedy Algorithms for the Lower and Upper Chromatic NumbersVitaly I. Voloshin. 241-251 [doi]