PUBLICATIONS (Andrea Sorbi) [2] C. Bernardi and A. Sorbi. Classifying positive equivalence relations. J. Symbolic Logic, 48(3): , 1983.
|
|
|
- Shanon Fitzgerald
- 8 years ago
- Views:
Transcription
1 PUBLICATIONS (Andrea Sorbi) Research papers [1] A. Sorbi. Σ 0 n equivalence relations. Studia Logica, XLI(4): , [2] C. Bernardi and A. Sorbi. Classifying positive equivalence relations. J. Symbolic Logic, 48(3): , [3] A. Sorbi. Numerazioni positive, r.e. classi e formule. Boll. Un. Mat. Ital., 1-B(6): , [4] F. Montagna and A. Sorbi. Universal recursion theoretic properties of r.e. preordered structures. J. Symbolic Logic, 50(2): , [5] A. Sorbi. On quasi minimal e-degrees and total e-degrees. Proc. Amer. Math. Soc., 102(4): , [6] F. Montagna and A. Sorbi. Creativeness and completeness in recursion categories of partial recursive operators. J. Symbolic Logic, 54(3): , [7] A. Sorbi. On some filters and ideals of the Medvedev lattice. Arch. Math. Logic, 30:29 48, [8] A. Sorbi. Some remarks on the algebraic structure of the Medvedev lattice. J. Symbolic Logic, 55(2): , [9] A. Sorbi. Embedding Brouwer algebras in the Medvedev lattice. Notre Dame J. Formal Logic, 32(2): , [10] A. Sorbi. Comparing Π 0 2 sets of the Baire space by means of general recursive operators. Fund. Math., 138:1 12, [11] A. Sorbi. Some quotient lattices of the Medvedev lattice. Z. Math. Logik Grundlag. Math., 37: , [12] C. Bianchini and A. Sorbi. Reducibilities in some recursion categories of partial recursive operators. Z. Math. Logik Grundlag. Math., 38: , [13] S. Fontani, F. Montagna, and A. Sorbi. A note on relative efficiency of axiom systems. Math. Log. Q., 40: , [14] A. Sorbi. Enumeration degrees and Turing degrees. Technical Report 263, Dipartimento di Matematica, Università di Siena, pages. [15] C. Bianchini and A. Sorbi. A note on closed degrees of difficulty of the Medvedev lattice. Math. Logic Quarterly, 42: , [16] S. B. Cooper and A. Sorbi. Noncappable enumeration degrees below 0 e. J. Symbolic Logic, 61: , [17] F. Montagna, G. Simi, and A. Sorbi. Logic and probabilistic systems. Arch. Math. Logic, 35: , [18] A. Sorbi. The Medvedev lattice of degrees of difficulty. In S. B. Cooper, T. A. Slaman, and S. S. Wainer, editors, Computability, Enumerability, Unsolvability - Directions in Recursion Theory, London Mathematical Society Lecture Notes Series, pages Cambridge University Press, New York,
![e. preordered structures. J. Symbolic Logic, 50(2):397 406, 1985. [5] A. Sorbi. On quasi minimal e-degrees and total e-degrees. Proc. Amer. Math. Soc., 102(4):1005 1008, 1988. [6] F. Montagna and A.](/docs-images/44/16465820/images/page_1.jpg "Sorbi. Creativeness and completeness in recursion categories of partial recursive operators. J. Symbolic Logic, 54(3):1023 1041, 1989. [7] A. Sorbi. On some filters and ideals of the Medvedev lattice.")
2 [19] S. B. Cooper, A. Sorbi, and X. Yi. Cupping and noncupping in the enumeration degrees of Σ 0 2 sets. Ann. Pure Appl. Logic, 82(3): , [20] S. Goncharov and A. Sorbi. Generalized computable numerations and non-trivial Rogers semilattices. Algebra and Logic, 36(6): , [21] A. Sorbi. The enumeration degrees of the Σ 0 2 sets. In A. Sorbi, editor, Complexity, Logic and Recursion Theory, pages Marcel Dekker, New York, [22] T. A. Slaman and A. Sorbi. Quasi-minimal enumeration degrees and minimal Turing degrees. Annali di Matematica Pura ed Applicata, (IV), CLXXIV: , [23] A. Sorbi. Sets of generators and automorphism bases for the enumeration degrees. Ann. Pure Appl. Logic, 94(1 3): , [24] M. M. Arslanov and A. Sorbi. Relative splittings of 0 e in the 0 2 enumeration degrees. In S. Buss and P. Pudlak, editors, Logic Colloquium 98. Springer-Verlag, [25] A. Nies and A. Sorbi. Branching in the enumeration degrees of Σ :29 59, sets. Israel J. Math., [26] R. Shore and A. Sorbi. Jumps of Σ 0 2 high e-degrees and properly Σ0 2 e-degrees. In M. Arslanov and S. Lempp, editors, Recursion Theory and Complexity, De Gruyter Series in Logic and Its Applications, pages , Berlin, New York, W. De Gruyter. [27] S. Bereznyuk, R. Coles, and A. Sorbi. The distribution of properly Σ 0 2 J. Symbolic Logic, 65(1):19 32, enumeration degrees. [28] A. Nies and A. Sorbi. Structural properties and Σ (1): , enumeration degrees. J. Symbolic Logic, [29] A. Sorbi. Open problems in the enumeration degrees. In P. A. Cholak, S. Lempp, M. Lerman, and R. A. Shore, editors, Computability Theory and its Applications, volume 257 of Contemporary Mathematics, pages American Mathematical Society, Providence, [30] M. Arslanov, I. Kalimullin, and A. Sorbi. Density results in the 0 2 Logic, 40: , e-degrees. Arch. Math. [31] S. Lempp and A. Sorbi. Embedding finite lattices into the Σ 0 2 enumeration degrees. J. Symbolic Logic, 67(1):69 90, [32] A. Sorbi. Embeddings into the enumeration degrees. In S. Goncharov, editor, Proceedings of the International Conference Logic and Applications, honouring Yu. L. Ershov on his 60th birthday; and of the International Conference on Mathematical Logic, honouring A. L. Malt sev on his 90th birthday anniversary and the 275th anniversary of the Russian Academy of Sciences, May , pages , Novosibirsk, Novosibirsk State University. [33] S. Badaev, S. Goncharov, and A. Sorbi. Completeness and universality of arithmetical numberings. In S. B. Cooper and S. Goncharov, editors, Computability and Models. Perspectives East and West, pages Kluwer Academic/Plenum Publishers, New York, [34] S. Badaev, S. Goncharov, S. Podzorov, and A. Sorbi. Algebraic properties of Rogers semilattices of arithmetical numberings. In S. B. Cooper and S. Goncharov, editors, Computability and Models. Perspectives East and West, pages Kluwer Academic/Plenum Publishers, New York,
![Marcel Dekker, New York, 1997. [22] T. A. Slaman and A. Sorbi. Quasi-minimal enumeration degrees and minimal Turing degrees. Annali di Matematica Pura ed Applicata, (IV), CLXXIV:263 272, 1998. [23] A.](/docs-images/44/16465820/images/page_2.jpg "Sorbi. Sets of generators and automorphism bases for the enumeration degrees. Ann. Pure Appl. Logic, 94(1 3):263 272, 1998. [24] M. M. Arslanov and A. Sorbi.")
3 [35] S. Badaev, S. Goncharov, and A. Sorbi. Isomorphism types and theories of Rogers semilattices of arithmetical numberings. In S. B. Cooper and S. Goncharov, editors, Computability and Models. Perspectives East and West, pages Kluwer Academic/Plenum Publishers, New York, [36] S. Badaev, S. Goncharov, and A. Sorbi. Elementary properties of Rogers semilattices of arithmetical numberings. In R. Downey, M. Yasugi, Qiu Y. H. Ding, D., and S. P. Tung, editors, Proceedings of the 7th and 8th Asian Logic Conferences, pages World Scientific, Singapore, [37] J. Case, S. Jain, F. Montagna, G. Simi, and A. Sorbi. On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. In Warmuth M. K. Schölkopf B., editor, Learning Theory and Kernel Machines, 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003 Washington, DC, USA, August 2003, Proceedings, volume 2777 of Lecture Notes in Artificial Intelligence, pages Springer Verlag, Berlin, Heidelberg, New York, [38] S. B. Cooper, A. Li, A. Sorbi, and Y. Yang. There exists a maximal 3-c.e. enumeration degree. Israel J. Math., 137: , [39] S. Badaev, S. Goncharov, and A. Sorbi. Elementary theories for Rogers semilattices. Algebra and Logic, 44(3): , [40] J. Case, S. Jain, F. Montagna, G. Simi, and A. Sorbi. On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms. J. Comput. Syst. Sci., 71(3): , [41] S. B. Cooper, A. Li, A. Sorbi, and Y. Yang. Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symbolic Logic, 70(3): , [42] F. De Carli, A. Frosini, S. Rinaldi, and A. Sorbi. Some remarks on tiling recognizable languages. Pure Mathematics and Applications, 16(1 2):69 80, [43] S. Lempp, T. Slaman, and A. Sorbi. On extensions of embeddings into the enumeration degrees of the Σ 0 2 sets. J. Math. Logic, 5(2): , [44] S. Badaev, S. Goncharov, and A. Sorbi. On elementary theories and isomorphism types of Rogers semilattices. In M. M. Erimbetov, editor, Theory of Models in Kazakhstan, pages Eco Study, Almaty, [45] S. Badaev, S. Goncharov, and A. Sorbi. Isomorphism types of Rogers semilattices for families from different levels of the arithmetical hierarchy. Algebra and Logic, 45(6): , [46] M. B. Giorgi, A. Sorbi, and Y. Yang. Properly Σ 0 2 hierarchy. J. Symbolic Logic, 71(4): , enumeration degrees and the high/low [47] R. Sh. Omanadze and A. Sorbi. Strong enumeration reducibilities. Arch. Math. Logic, 45(7): , [48] T. F. Kent and A. Sorbi. Bounding nonsplitting enumeration degrees. J. Symbolic Logic, 72(4): , [49] M. L. Affatato, T. F. Kent, and A. Sorbi. Branching in the Σ 0 2 perspective. Arch. Math. Logic, 47(3): , enumeration degrees: a new [50] M. L. Affatato, T. F. Kent, and A. Sorbi. Undecidability of local structures of s-degrees and Q-degrees. Tbilisi Mathematical Journal, 1:15 32,
4 [51] S. Badaev, S. Goncharov, and A. Sorbi. Some remarks on completion of numberings. Siberian Math. J., 49(5): , [52] R. Sh. Omanadze and A. Sorbi. A characterization of the 0 2 Symbolic Logic, 73(4): , hyperhyperimmune sets. J. [53] A. Sorbi and S. Terwijn. Intermediate logics and factors of the Medvedev lattice. Ann. Pure Appl. Logic, 155(2):69 86, [54] F. De Carli, A. Frosini, S. Rinaldi, and A. Sorbi. Lattices of local two-dimensional languages. Theoret. Comput. Sci., 410(27 29): , [55] A. Lewis, A. Nies, and A. Sorbi. The first order theories of the Medvedev and Muchnik lattices. In Löwe B. Ambos-Spies, K. and W. Merkle, editors, Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009 Heidelberg, Germany, July 2009 Proceedings, volume 5635 of Lecture Notes in Computer Science, pages Springer Verlag, Berlin, Heidelberg, New York, [56] A. Sorbi. Strong positive reducibilities. In Chen J. and S. B. Cooper, editors, Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009 Changsha, China, May 2009 Proceedings, volume 5532 of Lecture Notes in Computer Science, pages Springer Verlag, Berlin, Heidelberg, New York, [57] A. Sorbi, G. Wu, and Y. Yang. High minimal pairs in the enumeration degrees. In Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009 Changsha, China, May 2009 Proccedings, volume 5532 of Lecture Notes in Computer Science, pages Springer Verlag, Berlin, Heidelberg, New York, [58] R. Sh. Omanadze and A. Sorbi. Immunity properties of the s-degrees. Georgian Math. J., 17(3): , [59] A. Sorbi, G. Wu, and Y. Yang. Diamond embeddings in the enumeration degrees. Math. Structures Comput. Sci., 20: , [60] I. O. Chitaia, Omanadze R. Sh., and A. Sorbi. Immunity properties and strong positive reducibilities. Arch. Math. Logic, 50(3 4): , [61] A. E. M. Lewis, R. A. Shore, and A. Sorbi. Topological aspects of the Medvedev lattice. Arch. Math. Logic, 50(3 4): , [62] C. Marini, G. Simi, A. Sorbi, and Sorrentino M. A note on algebras of languages. Theoret. Comput. Sci., 412: , [63] C. Milanesi, A. Sorbi, E. Paolucci, F. Antonucci, P. Menesatti, C. Costa, F. Pallottino, R. Vignani, A. Cimato, A. Ciacci, and M. Cresti. Pomology observations, morphometric analysis, ultrastructural study and allelic profiles of olivastra Seggianese endocarps from ancient olive trees (Olea europaea L.). Comptes Rendus Biologies, 334:39 49, [64] T. F. Kent, A. E. M. Lewis, and A. Sorbi. Empty intervals in the enumeration degrees. Ann. Pure Appl. Logic, 163(5): , [65] M. Manat and A. Sorbi. Positive undecidable numberings in the Ershov hierarchy. Algebra and Logic, 50(6): , January [66] D. Marsibilio and A. Sorbi. Bounded enumeration reducibility and its degree structure. Arch. Math. Logic, 51(1 2): ,
![Rinaldi, and A. Sorbi. Lattices of local two-dimensional languages. Theoret. Comput. Sci., 410(27 29):2701 2713, 2009. [55] A. Lewis, A. Nies, and A. Sorbi. The first order theories of the Medvedev and Muchnik lattices.](/docs-images/44/16465820/images/page_4.jpg "In Löwe B. Ambos-Spies, K. and W.")
5 [67] A. Sorbi and S. Terwijn. Intuitionistic logic and Muchnik degrees. Algebra Universalis, 67: , [68] S. A. Badaev, M. Manat, and A. Sorbi. Rogers semilattices of families of two embedded sets in the Ershov hierarchy. Math. Log. Quart., 58(4 5): , [69] C. Milanesi, L. Costantini, F. Antonucci, P. Menesatti, C. Costa, C. Faleri, A. Sorbi, R. Vignani, and M. Cresti. Morfometria geometrica non invasiva su semi archeologici di vite per risalire all origine di antiche varietà antropiche. Archeomatica, Anno III(4):30 32, December [70] D. Marsibilio and A. Sorbi. Singleton enumeration reducibility and arithmetic. J. Logic Comput., 23(6): , October [71] T. A. Slaman and A. Sorbi. A note on initial segments of the enumeration degrees. J. Symbolic Logic, 79(2): , June [72] U. Andrews, S. Lempp, J. S. Miller, K. M. Ng, L. San Mauro, and A. Sorbi. Universal computably enumerable equivalence relations. J. Symbolic Logic, 79(1):60 88, March [73] S.A. Badaev, M. Manat, and A. Sorbi. Friedberg numberings in the Ershov hierarchy. Arch. Math. Logic, [74] F. Montagna, G Simi, and A. Sorbi. Taking the Pirahã seriously. Commun. Nonlinear Sci. Numer. Simulat., 21:52 69, [75] A. Sorbi and S. Terwijn. Generalizations of the weak law of excluded middle. Notre Dame J. Form. Log., 56(2): , [76] H. Ganchev and A. Sorbi. Initial segments of the Σ 0 2 Symbolic Logic. enumeration degrees. To appear in J. Editorial work [77] A. Sorbi, editor. Complexity, Logic and Recursion Theory. Lecture Notes in Pure and Applied Mathematics. Marcel Dekker, N.Y., [78] S. B. Cooper, B. Löwe, and A. Sorbi, editors. Computation and Logic in the Real World, volume 4497 of Lecture Notes in Computer Science, Berlin, Heidelberg, New York, Springer Verlag. [79] S. B. Cooper, B. Kent, T. F. Löwe, and A. Sorbi, editors. Computation and Logic in the Real World, Technical Report of the Department of Mathematics and Computer Science Roberto Magari, n. 487, Siena, University of Siena. [80] R. Dillhage, T. Grubba, A. Sorbi, K. Weihrauch, and N. Zhong, editors. CCA 2007 Fourt International Conference in Computability and Complexity in Analysis, Informatik Berichte 338-6/2007, Hagen, FernUniversität in Hagen. [81] Löwe B. Cooper, S. B. and A. Sorbi, editors. New Computational Paradigms: A Logical Perspective on Changing Conceptions of What is Computable. Springer Verlag, New York, [82] P. Bonizzoni, S. B. Cooper, B. Löwe, and A. Sorbi, editors. Special Issue of Theoretical Computer Science C, arising from the 2007 Computability in Europe conference CiE 2007: Logic and Computation in the Real World, held in Siena in June Vol. 410,
![Morfometria geometrica non invasiva su semi archeologici di vite per risalire all origine di antiche varietà antropiche. Archeomatica, Anno III(4):30 32, December 2012. [70] D. Marsibilio and A.](/docs-images/44/16465820/images/page_5.jpg "Sorbi. Singleton enumeration reducibility and arithmetic. J. Logic Comput., 23(6):1267 1292, October 2013. [71] T. A. Slaman and A. Sorbi. A note on initial segments of the enumeration degrees. J. Symbolic Logic, 79(2):633 643, June 2014.")
6 [83] S. Buss, S. B. Cooper, B. Löwe, and A. Sorbi, editors. Special Issue of Annals of Pure and Applied Logic, arising from the 2007 Computability in Europe conference CiE 2007: Logic and Computation in the Real World, held in Siena in June 2007, volume 160, [84] S. B. Cooper, E. Mayordomo, and A. Sorbi, editors. Special Issue of Theory of Computing Systems, arising from the 2007 Computability in Europe conference CiE 2007: Logic and Computation in the Real World, held in Siena in June Vol. 45, [85] S. B. Cooper, B. Löwe, and A. Sorbi, editors. Special Issue of Journal of Logic and Computation, arising from the 2007 Computability in Europe conference CiE 2007: Logic and Computation in the Real World, held in Siena in June Vol. 19, [86] S. B. Cooper and A. Sorbi, editors. Computability in Context. Computation and Logic in the Real World. Imperial College Press, London,
![3. 2009. [84] S. B. Cooper, E. Mayordomo, and A. Sorbi, editors.](/docs-images/44/16465820/images/page_6.jpg "Special Issue of Theory of Computing Systems, arising from the 2007 Computability in Europe conference CiE 2007: Logic and Computation in the Real World, held in Siena in June 2007. Vol. 45, 4. 2009.")
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES
A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below
A SURVEY OF RESULTS ON THE D.C.E. AND n-c.e. DEGREES
A SURVEY OF RESULTS ON THE D.C.E. AND n-c.e. DEGREES STEFFEN LEMPP 1. Early history This paper gives a brief survey of work on the d.c.e. and n-c.e. degrees done over the past fifty years, with particular
Total Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees
Total Degrees and Nonsplitting Properties of Σ 0 2 Enumeration Degrees M. M. Arslanov, S. B. Cooper, I. Sh. Kalimullin and M. I. Soskova Kazan State University, Russia University of Leeds, U.K. This paper
Biinterpretability up to double jump in the degrees
Biinterpretability up to double jump in the degrees below 0 0 Richard A. Shore Department of Mathematics Cornell University Ithaca NY 14853 July 29, 2013 Abstract We prove that, for every z 0 0 with z
Global Properties of the Turing Degrees and the Turing Jump
Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman Department of Mathematics University of California, Berkeley Berkeley, CA 94720-3840, USA slaman@math.berkeley.edu Abstract
Sample Summarization of Multiversiversiversiversiversiversiversiversiversiversiversivers
Birthdate: February 5, 1943 Birthplace: New York, New York Curriculum Vitae Manuel Lerman Professor Emeritus Department of Mathematics University of Connecticut Storrs, Connecticut 06269-3009 telephone:
THE NON-ISOLATING DEGREES ARE UPWARDS DENSE IN THE COMPUTABLY ENUMERABLE DEGREES
THE NON-ISOLATING DEGREES ARE UPWARDS DENSE IN THE COMPUTABLY ENUMERABLE DEGREES S. BARRY COOPER, MATTHEW C. SALTS, AND GUOHUA WU ABSTRACT. The existence of isolated degrees was proved by Cooper and Yi
There is no degree invariant half-jump
There is no degree invariant half-jump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University
Totally < ω ω -computably enumerable degrees and m-topped degrees
Totally < ω ω -computably enumerable degrees and m-topped degrees Rod Downey and Noam Greenberg School of Mathematics, Statistics, and Computer Science Victoria University PO Box 600 Wellington New Zealand
Conjectures and Questions from Gerald Sacks s Degrees of Unsolvability
Conjectures and Questions from Gerald Sacks s Degrees of Unsolvability Richard A. Shore Department of Mathematics Cornell University Ithaca NY 14853 Abstract We describe the important role that the conjectures
THE DEGREES OF BI-HYPERHYPERIMMUNE SETS
THE DEGREES OF BI-HYPERHYPERIMMUNE SETS URI ANDREWS, PETER GERDES, AND JOSEPH S. MILLER Abstract. We study the degrees of bi-hyperhyperimmune (bi-hhi) sets. Our main result characterizes these degrees
A BASIS THEOREM FOR Π 0 1 CLASSES OF POSITIVE MEASURE AND JUMP INVERSION FOR RANDOM REALS ROD DOWNEY AND JOSEPH S. MILLER
A BASIS THEOREM FOR Π 0 1 CLASSES OF POSITIVE MEASURE AND JUMP INVERSION FOR RANDOM REALS ROD DOWNEY AND JOSEPH S. MILLER Abstract. We extend the Shoenfield jump inversion theorem to the members of any
Degree spectra and immunity properties
Mathematical Logic Quarterly, 28 March 2009 Degree spectra and immunity properties Barbara F. Csima 1, and Iskander S. Kalimullin 2, 1 Department of Pure Mathematics University of Waterloo Waterloo, ON,
JOINING UP TO THE GENERALIZED HIGH DEGREES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 138, Number 8, August 2010, Pages 2949 2960 S 0002-9939(10)10299-8 Article electronically published on March 29, 2010 JOINING UP TO THE GENERALIZED
NATURAL FACTORS OF THE MEDVEDEV LATTICE CAPTURING IPC
NATURAL FACTORS OF THE MEDVEDEV LATTICE CAPTURING IPC RUTGER KUYPER Abstract. Skvortsova showed that there is a factor of the Medvedev lattice which captures intuitionistic propositional logic (IPC). However,
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES
CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order
Degrees that are not degrees of categoricity
Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara
THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES
THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES ANDREW E.M. LEWIS 1. Introduction This will be a course on the Turing degrees. We shall assume very little background knowledge: familiarity with
COFINAL MAXIMAL CHAINS IN THE TURING DEGREES
COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the
Decidability and Definability in the Σ 0 2-Enumeration Degrees
Decidability and Definability in the Σ 0 2-Enumeration Degrees By Thomas F. Kent A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Mathematics)
EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES
EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a
Non-Archimedean Probability and Conditional Probability; ManyVal2013 Prague 2013. F.Montagna, University of Siena
Non-Archimedean Probability and Conditional Probability; ManyVal2013 Prague 2013 F.Montagna, University of Siena 1. De Finetti s approach to probability. De Finetti s definition of probability is in terms
Turing Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
Embeddability and Decidability in the Turing Degrees
ASL Summer Meeting Logic Colloquium 06. Embeddability and Decidability in the Turing Degrees Antonio Montalbán. University of Chicago Nijmegen, Netherlands, 27 July- 2 Aug. of 2006 1 Jump upper semilattice
ON INITIAL SEGMENT COMPLEXITY AND DEGREES OF RANDOMNESS
ON INITIAL SEGMENT COMPLEXITY AND DEGREES OF RANDOMNESS JOSEPH S. MILLER AND LIANG YU Abstract. One approach to understanding the fine structure of initial segment complexity was introduced by Downey,
TURING DEGREES OF NONABELIAN GROUPS
TURING DEGREES OF NONABELIAN GROUPS MALGORZATA DABKOWSKA, MIECZYSLAW DABKOWSKI, VALENTINA S. HARIZANOV, AND ADAM S. SIKORA Abstract. For a countable structure A, the (Turing) degree spectrum of A is the
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY
DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend
Libri di Teoria della Computabilità (Paradigma di Turing)
Libri di Teoria della Computabilità (Paradigma di Turing) Introduttivi Cooper S. B. (2003). Computability Theory. Chapman & Hall/CRC Mathematics, Boca Raton, London, New York, Washington, DC. Cutland N.
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES
Π 0 1 CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES ANDREW E.M. LEWIS Abstract. We investigate issues surrounding an old question of Yates as to the existence of a minimal degree with no
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE. 1. Introduction
ON COMPLETELY CONTINUOUS INTEGRATION OPERATORS OF A VECTOR MEASURE J.M. CALABUIG, J. RODRÍGUEZ, AND E.A. SÁNCHEZ-PÉREZ Abstract. Let m be a vector measure taking values in a Banach space X. We prove that
RANDOMNESS AND COMPUTABILITY: OPEN QUESTIONS JOSEPH S. MILLER AND ANDRÉ NIES
RANDOMNESS AND COMPUTABILITY: OPEN QUESTIONS JOSEPH S. MILLER AND ANDRÉ NIES Contents 1. Introduction 1 2. ML-randomness 3 2.1. Turing degrees 3 3. K-triviality and combinatorial properties 4 3.1. Traceability
Curriculum Vitae DENIS OSIN
Curriculum Vitae DENIS OSIN Department of Mathematics denis.osin@gmail.com The City College of CUNY www.sci.ccny.cuny.edu/ osin New York, NY 10031 (718) 545-0326 EDUCATION Ph.D. in Mathematics, Moscow
2.3. Proposition. There exists an enumeration operator W a such that χ A = W a (A ) for all A N.
THE ω-enumeration DEGREES IVAN N. SOSKOV Abstract. In the present paper we initiate the study of the partial ordering of the ω-enumeration degrees. This ordering is a semi-lattice which extends the semi-lattice
FIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC
FIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC DANIELE MARSIBILIO AND ANDREA SORBI Abstract. We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorphic
The Settling Time Reducibility Ordering and 0 2 Setting
THE SETTLING TIME REDUCIBILITY ORDERING AND 0 2 SETS BARBARA F. CSIMA Abstract. The Settling Time reducibility ordering gives an ordering on computably enumerable sets based on their enumerations. The
A single minimal complement for the c.e. degrees
A single minimal complement for the c.e. degrees Andrew Lewis Leeds University, April 2002 Abstract We show that there exists a single minimal (Turing) degree b < 0 s.t. for all c.e. degrees 0 < a < 0,
SECRET sharing schemes were introduced by Blakley [5]
![SECRET sharing schemes were introduced by Blakley [5]](/thumbs/24/4404980.jpg "SECRET sharing schemes were introduced by Blakley [5]")
206 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 1, JANUARY 2006 Secret Sharing Schemes From Three Classes of Linear Codes Jin Yuan Cunsheng Ding, Senior Member, IEEE Abstract Secret sharing has
EDWARD W. ODELL BIOGRAPHICAL DATA. EDUCATION Ph.D. Massachusetts Institute of Technology 1975 B.A. SUNY at Binghamton 1969
EDWARD W. ODELL BIOGRAPHICAL DATA EDUCATION Ph.D. Massachusetts Institute of Technology 1975 B.A. SUNY at Binghamton 1969 PROFESSIONAL EXPERIENCE 2005- John T. Stuart III Centennial Professor of Mathematics
Complexity Classes P and NP
Complexity Classes P and NP MATH 3220 Supplemental Presentation by John Aleshunas The cure for boredom is curiosity. There is no cure for curiosity Dorothy Parker Computational Complexity Theory In computer
CURRICULUM VITAE of Giuseppe Molteni
CURRICULUM VITAE of Giuseppe Molteni Personal information Address: Dipartimento di Matematica, Università di Milano, Via Saldini 50, I-20133 Milano (Italy) Phone number: (+39) 02 503 16144 e-mail: giuseppe.molteni1@unimi.it
EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES. Nataliya Golyan, Vera Golyan, Olga Kalynychenko
380 International Journal Information Theories and Applications, Vol. 18, Number 4, 2011 EFFECTIVE CONSTRUCTIVE MODELS OF IMPLICIT SELECTION IN BUSINESS PROCESSES Nataliya Golyan, Vera Golyan, Olga Kalynychenko
Tree sums and maximal connected I-spaces
Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and
List of Publications by Claudio Gentile
List of Publications by Claudio Gentile Claudio Gentile DiSTA, University of Insubria, Italy claudio.gentile@uninsubria.it November 6, 2013 Abstract Contains the list of publications by Claudio Gentile,
MIKAEL LINDSTRÖM LIST OF PUBLICATIONS 10.4.2014. Articles in international peer-reviewed journals
MIKAEL LINDSTRÖM LIST OF PUBLICATIONS 10.4.2014 Articles in international peer-reviewed journals 2. Mikael Lindström: On Schwartz convergence vector spaces, Math. Nachr. 117, 37-49, 1984. 3. Mikael Lindström:
The Theory of Concept Analysis and Customer Relationship Mining
The Application of Association Rule Mining in CRM Based on Formal Concept Analysis HongSheng Xu * and Lan Wang College of Information Technology, Luoyang Normal University, Luoyang, 471022, China xhs_ls@sina.com
CURRICULUM VITÆ Steffen Lempp Personal Data Office address: Department of Mathematics University of Wisconsin 480 Lincoln Drive Madison, WI
CURRICULUM VITÆ Steffen Lempp Personal Data Office address: Department of Mathematics University of Wisconsin 480 Lincoln Drive Madison, WI 53706-1388 Phone: (608) 263-1975 Fax: (608) 263-8891 Email: lempp@math.wisc.edu
Computer Science MS Course Descriptions
Computer Science MS Course Descriptions CSc I0400: Operating Systems Underlying theoretical structure of operating systems; input-output and storage systems, data management and processing; assembly and
PROCESS AND TRUTH-TABLE CHARACTERISATIONS OF RANDOMNESS
PROCESS AND TRUTH-TABLE CHARACTERISATIONS OF RANDOMNESS ADAM R. DAY Abstract. This paper uses quick process machines to provide characterisations of computable randomness, Schnorr randomness and weak randomness.
ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE
Illinois Journal of Mathematics Volume 46, Number 1, Spring 2002, Pages 145 153 S 0019-2082 ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE J. HUISMAN Abstract. Let C be a
A NOTE ON ACCELERATED TURING MACHINES
A NOTE ON ACCELERATED TURING MACHINES CRISTIAN S. CALUDE, LUDWIG STAIGER ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve
Teaching in School of Electronic, Information and Electrical Engineering
Introduction to Teaching in School of Electronic, Information and Electrical Engineering Shanghai Jiao Tong University Outline Organization of SEIEE Faculty Enrollments Undergraduate Programs Sample Curricula
Internet Traffic Prediction by W-Boost: Classification and Regression
Internet Traffic Prediction by W-Boost: Classification and Regression Hanghang Tong 1, Chongrong Li 2, Jingrui He 1, and Yang Chen 1 1 Department of Automation, Tsinghua University, Beijing 100084, China
Low upper bound of ideals, coding into rich Π 0 1 classes
Low upper bound of ideals, coding into rich Π 0 1 classes Antonín Kučera the main part is a joint project with T. Slaman Charles University, Prague September 2007, Chicago The main result There is a low
TURING DEGREES OF ISOMORPHISM TYPES OF ALGEBRAIC OBJECTS
J. London Math. Soc. Page 1 of 14 C 2006 London Mathematical Society doi:10.1112/jlms/jdl012 TURING DEGREES OF ISOMORPHISM TYPES OF ALGEBRAIC OBJECTS WESLEY CALVERT, VALENTINA HARIZANOV and ALEXANDRA SHLAPENTOKH
Antonino Freno. Curriculum Vitae. Phone (office): Office: +33 (0)3 59 35 87 27. antonino.freno@inria.fr; http://researchers.lille.inria.fr/~freno/.
Antonino Freno Curriculum Vitae Personal Information First name: Antonino Family name: Freno Date of birth: July 1, 1980 Place of birth: Reggio Calabria (RC) Italy Citizenship: Italian Phone (office):
Query Order and NP-Completeness 1 Jack J.Dai Department of Mathematics Iowa State University Ames, Iowa 50011 U.S.A. Jack H.Lutz Department of Computer Science Iowa State University Ames, Iowa 50011 U.S.A.
9 More on differentiation
Tel Aviv University, 2013 Measure and category 75 9 More on differentiation 9a Finite Taylor expansion............... 75 9b Continuous and nowhere differentiable..... 78 9c Differentiable and nowhere monotone......
Finite Projective demorgan Algebras. honoring Jorge Martínez
Finite Projective demorgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer March 11-13, 2011 Vanderbilt University (Nashville TN, USA) honoring Jorge Martínez
CURRICULUM VITAE. August 2008 now: Lecturer in Analysis at the University of Birmingham.
CURRICULUM VITAE Name: Olga Maleva Work address: School of Mathematics, Watson Building, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK Telephone: +44(0)121 414 6584 Fax: +44(0)121 414 3389
Degrees of Unsolvability
Degrees of Unsolvability Klaus Ambos-Spies Peter A. Fejer March 20, 2006 1 Introduction Modern computability theory began with Turing [Turing, 1936], where he introduced the notion of a function computable
Oracle Turing machines faced with the verification problem
Oracle Turing machines faced with the verification problem 1 Introduction Alan Turing is widely known in logic and computer science to have devised the computing model today named Turing machine. In computer
Formal Verification Problems in a Bigdata World: Towards a Mighty Synergy
Dept. of Computer Science Formal Verification Problems in a Bigdata World: Towards a Mighty Synergy Matteo Camilli matteo.camilli@unimi.it http://camilli.di.unimi.it ICSE 2014 Hyderabad, India June 3,
A Performance Comparison of Five Algorithms for Graph Isomorphism
A Performance Comparison of Five Algorithms for Graph Isomorphism P. Foggia, C.Sansone, M. Vento Dipartimento di Informatica e Sistemistica Via Claudio, 21 - I 80125 - Napoli, Italy {foggiapa, carlosan,
Analysis of Internet Topologies
Analysis of Internet Topologies Ljiljana Trajković ljilja@cs.sfu.ca Communication Networks Laboratory http://www.ensc.sfu.ca/cnl School of Engineering Science Simon Fraser University, Vancouver, British
ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
Virtual Enterprise Transactions: A Cost Model
Virtual Enterprise Transactions: A Cost Model A. D Atri 1 and A. Motro 2 Abstract A transaction is a bilateral exchange between two parties in which goods are delivered in return for payment. In virtual
Minimal R 1, minimal regular and minimal presober topologies
Revista Notas de Matemática Vol.5(1), No. 275, 2009, pp.73-84 http://www.saber.ula.ve/notasdematematica/ Comisión de Publicaciones Departamento de Matemáticas Facultad de Ciencias Universidad de Los Andes
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS
COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics
Wissenschaftliche Artikel (erschienen bzw. angenommen)
Schriftenverzeichnis I. Monographie [1] Convex variational problems. Linear, nearly linear and anisotropic growth conditions. Lecture Notes in Mathematics 1818, Springer, Berlin-Heidelberg- New York, 2003.
Lecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010
Lecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010 Richard A. Shore 1 Department of Mathematics Cornell University Ithaca NY 14853 January 3, 2012
arxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998
![arxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998](/thumbs/40/20740554.jpg "arxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998")
arxiv:cond-mat/9811359v1 [cond-mat.dis-nn] 25 Nov 1998 Energy Levels of Quasiperiodic Hamiltonians, Spectral Unfolding, and Random Matrix Theory M. Schreiber 1, U. Grimm, 1 R. A. Römer, 1 and J. X. Zhong
Homological Algebra Workshop 02-03-15/06-03-15
Homological Algebra Workshop 02-03-15/06-03-15 Monday: Tuesday: 9:45 10:00 Registration 10:00 11:15 Conchita Martínez (I) 10:00 11:15 Conchita Martínez (II) 11:15 11:45 Coffee Break 11:15 11:45 Coffee
arxiv:math/0510680v3 [math.gn] 31 Oct 2010
![arxiv:math/0510680v3 [math.gn] 31 Oct 2010](/thumbs/39/18240725.jpg "arxiv:math/0510680v3 [math.gn] 31 Oct 2010")
arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering
Miodrag Cristian Iovanov
Miodrag Cristian Iovanov Address: 3333 W 2nd St. #55-215 Los Angeles, CA 90004, USA email: iovanov@usc.edu, yovanov@gmail.com; miovanov@buffalo.edu web: http://yovanov.net Current position Assistant Professor
CHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
P NP for the Reals with various Analytic Functions
P NP for the Reals with various Analytic Functions Mihai Prunescu Abstract We show that non-deterministic machines in the sense of [BSS] defined over wide classes of real analytic structures are more powerful
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
The role of true finiteness in the admissible recursively enumerable degrees. Noam Greenberg
The role of true finiteness in the admissible recursively enumerable degrees Noam Greenberg Author address: Department of Mathematics, University of Notre Dame, Notre Dame, Indiana, 46556 E-mail address:
Relatively dense sets, corrected uniformly almost periodic functions on time scales, and generalizations
Wang and Agarwal Advances in Difference Equations (2015) 2015:312 DOI 10.1186/s13662-015-0650-0 R E S E A R C H Open Access Relatively dense sets, corrected uniformly almost periodic functions on time
GEOFF DIESTEL, PHD. Assistant Professor at Texas A&M-Central Texas(TAMUCT) from 2011-present.
GEOFF DIESTEL, PHD Contact Information 1001 Leadership Place gdiestel@ct.tamus.edu Founder s Hall, 217E 254.501.5872 Killeen, TX 76549 Education PhD in Mathematics University of Missouri, May 2006 Dissertation:
Publikationsliste. 1 Referierte Zeitschriftenartikel
Publikationsliste 1 Referierte Zeitschriftenartikel [1 ] An estimate for the maximum of solutions of parabolic equations with the Venttsel condition, Vestnik Leningrad. Univ. (Ser. Mat. Mekh. Astronom.,
Theory of Automated Reasoning An Introduction. Antti-Juhani Kaijanaho
Theory of Automated Reasoning An Introduction Antti-Juhani Kaijanaho Intended as compulsory reading for the Spring 2004 course on Automated Reasononing at Department of Mathematical Information Technology,
Siena Heights University. Undergraduate Catalog 2014-2016 Page 125
Mathematics Bachelor of Arts Degree I. Course Requirements for Major A. Program Requirements 28 semester hours 4. MAT 244 Statistical Analysis and Design 3 5. MAT 260 Discrete Mathematics 3 6. MAT 282
Degree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO
LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.
3515ICT Theory of Computation Turing Machines
Griffith University 3515ICT Theory of Computation Turing Machines (Based loosely on slides by Harald Søndergaard of The University of Melbourne) 9-0 Overview Turing machines: a general model of computation
About the inverse football pool problem for 9 games 1
Seventh International Workshop on Optimal Codes and Related Topics September 6-1, 013, Albena, Bulgaria pp. 15-133 About the inverse football pool problem for 9 games 1 Emil Kolev Tsonka Baicheva Institute
Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces
Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche
On an algorithm for classification of binary self-dual codes with minimum distance four
Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory June 15-21, 2012, Pomorie, Bulgaria pp. 105 110 On an algorithm for classification of binary self-dual codes with minimum
An example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
Lambda Calculus between Algebra and Topology. Antonino Salibra
Lambda Calculus between Algebra and Topology Antonino Salibra Thanks Special thanks to Laboratoire PPS (Univ. Paris Diderot) for supporting my research with financial support and very interesting collaborations
Asian Option Pricing Formula for Uncertain Financial Market
Sun and Chen Journal of Uncertainty Analysis and Applications (215) 3:11 DOI 1.1186/s4467-15-35-7 RESEARCH Open Access Asian Option Pricing Formula for Uncertain Financial Market Jiajun Sun 1 and Xiaowei
A Contribution to Expert Decision-based Virtual Product Development
A Contribution to Expert Decision-based Virtual Product Development László Horváth, Imre J. Rudas Institute of Intelligent Engineering Systems, John von Neumann Faculty of Informatics, Óbuda University,
BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL
The Fifth International Conference on e-learning (elearning-2014), 22-23 September 2014, Belgrade, Serbia BOOSTING - A METHOD FOR IMPROVING THE ACCURACY OF PREDICTIVE MODEL SNJEŽANA MILINKOVIĆ University
EXTRACTING INFORMATION IS HARD: A TURING DEGREE OF NON-INTEGRAL EFFECTIVE HAUSDORFF DIMENSION
EXTRACTING INFORMATION IS HARD: A TURING DEGREE OF NON-INTEGRAL EFFECTIVE HAUSDORFF DIMENSION JOSEPH S. MILLER Abstract. We construct a 0 2 infinite binary sequence with effective Hausdorff dimension 1/2
Sphere Packings, Lattices, and Kissing Configurations in R n
Sphere Packings, Lattices, and Kissing Configurations in R n Stephanie Vance University of Washington April 9, 2009 Stephanie Vance (University of Washington)Sphere Packings, Lattices, and Kissing Configurations
Master of Mathematical Finance: Course Descriptions
Master of Mathematical Finance: Course Descriptions CS 522 Data Mining Computer Science This course provides continued exploration of data mining algorithms. More sophisticated algorithms such as support
Curriculum Vitae NIKOLAOS GALATOS
Curriculum Vitae NIKOLAOS GALATOS School of Information Science Japan Advanced Institute of Science and Technology (JAIST) 1-1 Asahidai, Nomi Ishikawa 923-1292, Japan Telephone: (+81) 761-51-1203 Fax:
SURVEY ON DYNAMICAL YANG-BAXTER MAPS. Y. Shibukawa
SURVEY ON DYNAMICAL YANG-BAXTER MAPS Y. Shibukawa Department of Mathematics, Faculty of Science, Hokkaido University, Sapporo 060-0810, Japan e-mail: shibu@math.sci.hokudai.ac.jp Abstract In this survey,