Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Dacar, France - Department of Knowledge Technologies, Jozef Stefan Institute
d'Alembert's Lemma France Dacar, Jozef Stefan Institute
A modified version of the proof of BourbakiWitt theorem in Lang's Algebra
BourbakiWitt theorem for dcpos is constructively equivalent to BourbakiWitt theorem for ccpos
The Envelope-Folding Problem Paul J. Nahin's "When Least is Best"
The Cyclicity of a Hypergraph France Dacar1
Some remarks on Paul J. Nahin's "When Least is Best" (WLiB)
The proof of BourbakiWitt theorem in Lang's Algebra Here I reproduce, for easier reference, the proof of BourbakiWitt theorem as given in
The join-induction principle for closure operators on dcpos
Generative Structure of Entailment in Finite Constraint Networks
The Challenge Problem Paul J. Nahin's "When Least is Best"
Approximate construction of a regular nonagon in Albrecht Durer's Painter's Manual
Quadratrix of Hippias and Vi`ete's infinite product Contemplating the arc of the quadratrix of Hippias, from the point C = (0, c) to the
Compactness of a Topological Space Via Subbase Covers France Dacar, Jozef Stefan Institute
Characterizations of Compact Metric Spaces France Dacar, Jozef Stefan Institute