- //
Bitwise And to copy bits
exists in both operands. } In 1997,
Lorenz Halbeisen and
Norbert Hungerbühler
discovered a closed-form for the case k = 3 {\displaystyle...
- 16–18. ISBN 0-8218-4347-8. (online copy, p. 10, at
Google Books)
Lorenz Halbeisen,
Norbert Hungerbühler, Juan Läuchli: Mit
harmonischen Verhältnissen zu...
-
Advanced Mathematics,
Cengage Learning, p. 95, ISBN 978-0-495-56202-3.
Halbeisen,
Lorenz J. (2011),
Combinatorial Set Theory: With a
Gentle Introduction...
- Epsilon-induction
Rieger 2011, pp. 175, 178.
Urquhart 2003, p. 305. Lévy 2002, p. 73.
Halbeisen 2012, pp. 62–63.
Sangiorgi 2011, pp. 17–19, 26.
Rieger 2011, p. 179. Bernays...
- 1262–1268. doi:10.1164/rccm.200811-1731oc. ISSN 1073-449X. PMID 20167855.
Halbeisen,
Florian S.; Pedersen, Eva S.L.; Goutaki, Myrofora; Spycher, Ben D.; Amirav...
- ISSN 0954-4119. PMID 31232647. S2CID 195328808. Msallem, Bilal; Maintz, Michaela;
Halbeisen,
Florian S.; Meyer, Simon; Sigron,
Guido R.; Sharma, Neha; Cao, Shuaishuai;...
- of ∨ {\displaystyle \lor } and ∧ {\displaystyle \land } do not occur.
Halbeisen, Lorenz; Kraph,
Regula (2020). Gödel´s
theorems and zermelo´s axioms:...
- for the
axiom of Choice)"
Kunen 2007, p. 10
Ebbinghaus 2007, p. 136.
Halbeisen 2011, pp. 62–63. Fraenkel, Bar-Hillel & Lévy 1973
Kunen 1980, p. 10. Hatcher...
- them",
Burak Kaya,
lecture notes,
Nesin Mathematics Village,
Summer 2019.
Halbeisen, L. J. (2012).
Combinatorial Set Theory.
Springer Monographs in Mathematics...
-
University of
Chicago Press. OCLC 704158.
further reading Markus, Rita M.;
Halbeisen, MSG
Nicholas F.; Fuller, John F. (1987). Matthews,
James K.; Gustin,...
