Completeness of the infinitary polyadic axiomatization
- 作者Isidore Fleischer
- 卷第39卷
- 期第1期
- 印刷ISSN0942-5616
- 电子ISSN1521-3870
- 文件大小270.60KB
- 发表时间1993
- DOI10.1002/malq.19930390122
- 页码197-200
Shortest division chains in imaginaryquadratic number fieldsHeinrich Rolletschek · 1990
Some New Lattice Constructions in High R. E. DegreesHeinrich Rolletschek · 1995
Complexity of certain decision problems about congruential languagesPaliath Narendran; Colm Ó'Dúnlaing; Heinrich Rolletschek · 1985
Computing Gretest Common Divisors and Factorizations in Quadratic Number FieldsErich Kaltofen and Heinrich Rolletschek · Mathematics of Computation · 1989
Computing greatest common divisors and factorizations in quadratic number fieldsKaltofen, Erich; Rolletschek, Heinrich · Mathematics of Computation · 1989
Closure properties of almost-finiteness classes in recursive function theoryRolletschek, Heinrich · The Journal of Symbolic Logic · 1983
On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian IntegersHeinrich Rolletschek · 1986