Geometry.net Online Store

1. 03Cxx 03C52 Properties of classes of models; 03C55 Settheoretic model theory; 03C57 Effective and recursion-theoretic model theory See also 03D45 http://www.ams.org/msc/03Cxx.html

Home MathSciNet Journals Books ... Contact Us 201 Charles Street Providence, RI 02904 USA Phone: 401-455-4000 or 800-321-4AMS Or email us at ams@ams.org Open Positions Model theory 03C05 Equational classes, universal algebra [See also 03C07 Basic properties of first-order languages and structures 03C10 Quantifier elimination, model completeness and related topics 03C13 Finite structures [See also 03C15 Denumerable structures 03C20 Ultraproducts and related constructions 03C25 Model-theoretic forcing 03C30 Other model constructions 03C35 Categoricity and completeness of theories 03C40 Interpolation, preservation, definability 03C45 Classification theory, stability and related concepts 03C50 Models with special properties (saturated, rigid, etc.) 03C52 Properties of classes of models 03C55 Set-theoretic model theory 03C57 Effective and recursion-theoretic model theory [See also 03C60 Model-theoretic algebra [See also 03C62 Models of arithmetic and set theory [See also 03C64 Model theory of ordered structures; o-minimality 03C65 Models of other mathematical theories 03C68 Other classical first-order model theory 03C70 Logic on admissible sets 03C75 Other infinitary logic 03C80 Logic with extra quantifiers and operators [See also 03C85 Second- and higher-order model theory 03C90 Nonclassical models (Boolean-valued, sheaf, etc.)

2. HeiDOK 03C57 Effective and recursiontheoretic model theory ( 0 Dok. ) 03C60 model-theoretic algebra ( 0 Dok. ) 03C62 models of arithmetic and set theory ( 0 Dok http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03C&anzahl

3. List KWIC DDC22 510 And MSC+ZDM E-N Lexical Connection model theory 11U09 model theory 12L12 model theory abstract 03C95 model theory applications of 03C98 model theory Effective and recursiontheoretic http://www.math.unipd.it/~biblio/kwic/msc-cdd/dml2_11_36.htm

mechanics and problems of quantization # general quantum mechanics of deformable solids 74-XX mechanics of particles and systems 70-XX mechanics of solids # generalities, axiomatics, foundations of continuum mechanics type models; percolation theory # interacting random processes; statistical mechanics with other effects # coupling of solid mechanics, general relativity, laser physics) # dynamical systems in other branches of physics (quantum mechanics, regularization # collisions in celestial mechanics, structure of matter # statistical 82-XX mechanics; quantum logic # logical foundations of quantum mechanisms, robots mechanization of proofs and logical operations media and their use in instruction # audiovisual media with periodic structure # homogenization; partial differential equations in media, disordered materials (including liquid crystals and spin glasses) # random media. educational technology # educational material and media; filtration; seepage # flows in porous medical applications (general) medical epidemiology medical sciences # applications to biology and medical topics # physiological, cellular and

4. List KWIC DDC And MSC Lexical Connection effect manybody theory; quantum Hall 81V70 Effective and recursion-theoretic model theory 03C57 Effective constitutive equations 74Q15 http://www.mi.imati.cnr.it/~alberto/dml_11_13.htm

dynamics, statics, particle mechanics E region E$, $G$ and $H$ functions) # hypergeometric integrals and functions defined by them ($ e. PDE on finite-dimensional spaces for abstract space valued functions) # partial operator-differential equations (i. e. small categories in which all morphisms are isomorphisms) # groupoids (i. e.g. algebraic theories), structure, and semantics # theories ( e.g. bounded mean oscillation (BMOA), vanishing mean oscillation (VMOA)) # other spaces of holomorphic functions ( e.g. CR) structures # deformations of special ( e.g. function) spaces (=PDE in infinitely many variables) # partial differential equations on infinite-dimensional ( e.g. Hochschild, cyclic, dihedral, etc.) # (Co)homology of rings and algebras ( e.g. integral transforms) # transform methods ( e.g. Khnizhnik - Zamolodchikov equation) # moduli and deformations for ordinary differential equations ( e.g. Taylor, Lidstone series, but not Fourier series) # series expansions ( e.g. zeros of functions with bounded Dirichlet integral) # zeros of polynomials, rational functions, and other analytic functions ( e.g., branes) # string and superstring theories; other extended objects (

5. PlanetMath: 03C52, , Properties of classes of models. 03C55, -, Set-theoretic model theory. 03C57, -, Effective and recursion-theoretic model theory http://planetmath.org/browse/categories/03Cxx/

(more info) Math for the people, by the people. Encyclopedia Requests Forums Docs ... RSS Login create new user name: pass: forget your password? Main Menu sections Encyclop¦dia Papers Books Expositions meta Requests Orphanage Unclass'd Unproven ... Classification talkback Polls Forums Feedback Bug Reports downloads Snapshots PM Book information News Docs Wiki ChangeLog ... About Browsing MSC leaves only (Case insensitive substrings, use '-' to exclude) 03Cxx - Model theory Equational classes, universal algebra Basic properties of first-order languages and structures Quantifier elimination, model completeness and related topics Finite structures Denumerable structures Ultraproducts and related constructions Model-theoretic forcing Other model constructions Categoricity and completeness of theories Interpolation, preservation, definability Classification theory, stability and related concepts Models with special properties (saturated, rigid, etc.) Properties of classes of models Set-theoretic model theory Effective and recursion-theoretic model theory Model-theoretic algebra Models of arithmetic and set theory Model theory of ordered structures; o-minimality

6. Browse MSC2000 Effective and recursiontheoretic model theory See also 03D45, related model theory of ordered structures; o-minimality, related http://www.zblmath.fiz-karlsruhe.de/MATH/msc/zbl/msc/2000/03-XX/03Cxx/dir

Contact Search Browse Instructions ... Main Changes 75th anniversary Zentralblatt MATH Home Facts and Figures Partners and Projects Subscription Service Database Gateway Database Mirrors Reviewer Service Classification ... Serials and Journals database Miscellanea Links to the Mathematical World Display Text version Printer friendly page Internal Browse MSC2000 - by section and classification TOP MSC2000 - Mathematics Subject Classification Scheme 03-XX Mathematical logic and foundations Model theory Classification Topic X-ref Equational classes, universal algebra [See also related... Basic properties of first-order languages and structures related... Quantifier elimination, model completeness and related topics related... Finite structures [See also related... Denumerable structures related... Ultraproducts and related constructions related... Model-theoretic forcing related... Other model constructions related...

7. MSC 2000 : CC = Ore 03C25 modeltheoretic forcing; 03C55 Set-theoretic model theory; 03C57 Effective and recursion-theoretic model theory See also 03D45 http://portail.mathdoc.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=Ore

8. Zentralblatt MATH - MSC 2000 - Search And Browse 03C52 Properties of classes of models ZMATH. 03C55 Settheoretic model theory ZMATH. 03C57 Effective and recursion-theoretic model theory See also http://www.zentralblatt-math.org/msc/search/?pa=03Cxx

9. 03C < Mizar < Mizar TWiki Properties of classes of models. 03C55? Settheoretic model theory. 03C57? Effective and recursion-theoretic model theory, See also 03D45 http://wiki.mizar.org/cgi-bin/twiki/view/Mizar/03C

Skip to topic Skip to bottom Jump: Mizar Mizar Web Mizar Web Home Changes Index Search Webs Main Mizar Sandbox TWiki ... Test My links My home page edit Edit Attach ... Printable Mizar.03C r1.1 - 02 Nov 2006 - 20:44 - MarcoRiccardi topic end Skip to actions 03C Model theory Section P S Equational classes, universal algebra See also 08Axx, 08Bxx, 18C05 Basic properties of first-order languages and structures Quantifier elimination, model completeness and related topics Finite structures See also 68Q15, 68Q19 Denumerable structures Ultraproducts and related constructions Model-theoretic forcing Other model constructions Categoricity and completeness of theories Interpolation, preservation, definability Classification theory, stability and related concepts Models with special properties (saturated, rigid, etc.) Properties of classes of models Set-theoretic model theory Effective and recursion-theoretic model theory See also 03D45 Model-theoretic algebra See also 08C10, 12Lxx, 13L05 Models of arithmetic and set theory See also 03Hxx Model theory of ordered structures; o-minimality Models of other mathematical theories Other classical first-order model theory Logic on admissible sets Other infinitary logic Logic with extra quantifiers and operators See also 03B42, 03B44, 03B45, 03B48

10. 03Cxx 03C57, Effective and recursiontheoretic model theory See also 03D45. 03C60, model-theoretic algebra See also 08C10, 12Lxx, 13L05 http://www.mathematik.uni-osnabrueck.de/projects/msc2000/03Cxx.html

Model theory Equational classes, universal algebra [See also Basic properties of first-order languages and structures Quantifier elimination, model completeness and related topics Finite structures [See also Denumerable structures Ultraproducts and related constructions Model-theoretic forcing Other model constructions Categoricity and completeness of theories Interpolation, preservation, definability Classification theory, stability and related concepts Models with special properties (saturated, rigid, etc.) Properties of classes of models Set-theoretic model theory Effective and recursion-theoretic model theory [See also Model-theoretic algebra [See also Models of arithmetic and set theory [See also Model theory of ordered structures; o-minimality Models of other mathematical theories Other classical first-order model theory Logic on admissible sets Other infinitary logic Logic with extra quantifiers and operators [See also Second- and higher-order model theory Nonclassical models (Boolean-valued, sheaf, etc.) Abstract model theory Applications of model theory [See also None of the above, but in this section

11. Theodore A. Slaman: Bibliography 03B30 Foundations of classical theories (including reverse mathematics); 03C57 Effective and recursiontheoretic model theory; 03C62 models of arithmetic http://math.berkeley.edu/~slaman/papers/Publications_MSC.html

Theodore A. Slaman Home Bibliography Lectures Courses ... Links Bibliography Bibliography sorted by Mathematical Subject Classification Alternate Views Full Bibliography Bibserver Foundations of classical theories (including reverse mathematics) Effective and recursion-theoretic model theory Models of arithmetic and set theory Logic on admissible sets Complexity of computation Recursive functions and relations, subrecursive hierarchies Recursively (computably) enumerable sets and degrees Other Turing degree structures Other degrees and reducibilities Undecidability and degrees of sets of sentences Theory of numerations, effectively presented structures Recursive equivalence types of sets and structures, isols Hierarchies Computability and recursion theory on ordinals, admissible sets, etc. Higher-type and set recursion theory Applications of computability and recursion theory Computability and recursion theory Descriptive set theory Consistency and independence results Other aspects of forcing and Boolean-valued models Inner models, including constructibility, ordinal definability, and core models

12. MSC 2000 : CC = Effective 03C57 Effective and recursiontheoretic model theory See also 03D45; 03D45 theory of numerations, Effectively presented structures See also 03C57; http://math-doc.ujf-grenoble.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=Effecti

13. 361/369 (Total 5522) NO 122 03C70 Logic On Translate this page 117, 03C60, model-theoretic algebra See also 08C10, 12Lxx, 13L05. 116, 03C57, Effective and recursion-theoretic model theory See also 03D45 http://www.mathnet.or.kr/mathnet/msc_list.php?mode=list&ftype=&fstr=&page=361

14. General General Mathematics Mathematics For Nonmathematicians Properties of classes of models Settheoretic model theory Effective and recursion-theoretic model theory See also 03D45 model-theoretic algebra See also http://amf.openlib.org/2001/msc2000.xsd

15. MathGuide - OPAC Subject Catalog 03C52 Properties of classes of models; 03C55 Settheoretic model theory; 03C57 Effective and recursion-theoretic model theory; 03C60 model-theoretic algebra http://www.mathguide.de/cgi-bin/ssgfi/navigator2.pl/db=math/type=gok/pattern=all

Browse the GBV OPAC by MSC 2000 This is a browse interface to the union catalogue of the Common Library Network GBV based on the MSC 2000 classification. You can browse down to the individual notation, the links available will direct you to the appropriate place in the GBV OPAC, which uses a notation related to, but different from MSC. Note: Not all books available are contained in the online catalogue. Please use the Goettingen State University Library's Alphabetical Catalogue to search for monographs, dissertations and journals missing in the OPAC. Open all categories Close all categories Foundations 00-XX General Instructional exposition (textbooks, tutorial papers, etc.) Research exposition (monographs, survey articles) General mathematics General and miscellaneous specific topics General mathematics Mathematics for nonmathematicians (engineering, social sciences, etc.) Problem books Recreational mathematics Bibliographies External book reviews Dictionaries and other general reference works Formularies Philosophy of mathematics Methodology of mathematics, didactics

16. JSTOR Two-Dimensional Partial Orderings Recursive Model Theory For recursive model theory, it suggests that there really is no one notion of Effective matchmaking (recursiontheoretic aspects of a theorem of Philip http://links.jstor.org/sici?sici=0022-4812(198003)45:1<121:TPORMT>2.0.CO;2-E

17. The Computable Approach To Economics The key word in the Rabin quote is Effective, meaning a procedure whose execution is into set theory, proof theory, model theory and recursion theory. http://ideas.repec.org/p/wop/callce/_005.html

This file is part of IDEAS , which uses RePEc data Papers Articles Software Books ... Help! The Computable Approach to Economics Author info Abstract Publisher info Download info ... Statistics Author Info Kumaraswamy Velupillai (Center for Computable Economics, UCLA and Queen's University, Belfast.) Abstract Download Info To download: If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file . Note that these files are not on the IDEAS site. Please be patient as the files may be large. File URL: http://cce.sscnet.ucla.edu/papers/vela/approach/approach.doc Our checks indicate that this address may not be valid because: 500 Can't connect to cce.sscnet.ucla.edu:80 (connect: Unknown error) . If this is indeed the case, please notify liame2('org','openlib','m7i7','krichel') (Thomas Krichel) File Format: File Function: Download Restriction: no Publisher Info Paper provided by University of California at Los Angeles, Center for Computable Economics in its series

18. Recursion Theory - Wikipedia, The Free Encyclopedia This is the recursiontheoretic branch of learning theory. It is based on Gold s model of learning in the limit from 1967 and has developed since then more http://en.wikipedia.org/wiki/Recursion_theory

var wgNotice = ""; var wgNoticeLocal = ""; var wgNoticeLang = "en"; var wgNoticeProject = "wikipedia"; Recursion theory From Wikipedia, the free encyclopedia Jump to: navigation search For the branch of computer science called computability theory, see Computability theory (computer science) Recursion theory , also called computability theory , is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees . The field has grown to include the study of generalized computability and definability. In these areas, recursion theory overlaps with proof theory and effective descriptive set theory The basic questions addressed by recursion theory are "What does it mean for a function from the natural numbers to themselves to be computable?" and "Can noncomputable functions be classified into a hierarchy based on their level of noncomputability?". The answers to these questions have led to a rich theory that is still being actively researched. Recursion theorists in mathematical logic often study the theory of relative computability, reducibility notions and degree structures described in this article. This contrasts with the theory of subrecursive hierarchies formal methods and formal languages that is common in the study of computability theory in computer science . There is considerable overlap in knowledge and methods between these two research communities, however, and no firm line can be drawn between them.

19. Models And Computability Is Available From Bestprices.com Books! Effective model theory the number of models and their complexity B. Khoussainov and RA Shore; 9. Recursion theoretic memories 19541978 GE Sacks; 17. http://www.bestprices.com/cgi-bin/vlink/0521635500?id=nsession

20. OHSU, NCNM, And WSCC /Hill L54 Mathematical logic an introduction to model theory / AH Lightstone . R64 1967 theory of recursive functions and Effective computability. http://catalogs.ohsu.edu:2082/search/cQA9 .K77/cqa 9 k77/-3,-1,,E/browse

OHSU OHSU Library NCNM Library ONPRC Library ... CUSTOMER SUPPORT (Search History) KEYWORD: t104t in OHSU Marquam Hill Campus AUTHOR: Lü, Buwei, d. 235 B.C. LC SUBJECT: Aromatherapy MEDICAL SUBJECT: Insulin-Like Growth Factor II AUTHOR: Ho, Peng Yoke, 1926- (Clear Search History) (End Search Session) Search history function requires JavaScript AUTHOR TITLE BOOK SERIES TITLE MEDICAL SUBJECT LC SUBJECT KEYWORD CALL NO ISN RESOURCE NAME View Entire Collection OHSU Marquam Hill Campus NCNM Library Catalog OHSU Primate Center Library Journals in all OHSU, NCNM and WSCC libraries OHSU Library Electronic Resources Western States Chiropractic College Nearby CALL NOS are: Result page: Prev Next Mark Year : Information, mechanism and meaning [by] Donald M. MacKay. Information, mechanism and meaning [by] Donald M. MacKay. MacKay, Donald MacCrimmon,; OHSU STORAGE:AVAILABLE : International journal of mathematics and mathematical sciences [electronic resource]. International journal of mathematics and mathematical sciences [electronic resource]. : The International dictionary of applied mathematics. [W.F. Freiberger, editor-in-chief].

21. Models And Computability - Cambridge University Press Effective model theory the number of models and their complexity B. Khoussainov and RA Shore; 9. Recursion theoretic memories 1954–1978 GE Sacks; 17. http://www.cambridge.org/us/catalogue/catalogue.asp?isbn=0521635500

22. Logic Colloquium 1997 - Proceedings Shore Effective model theory the number of models and their complexity. (47, final version received) Sacks Recursion Theoretic Memories 19541978. http://www.amsta.leeds.ac.uk/events/logic97/proc.html

LOGIC COLLOQUIUM 1997 INFORMATION ON THE PROCEEDINGS Contents: Introduction Latest information for 'Models and Computability' Latest information for ... Guidelines for authors INTRODUCTION: There will be two volumes devoted to refereed invited articles from Logic Colloquium 1997. These will be 'Models and Computability' (ISBN: 0521635500) and 'Sets and Proofs' (ISBN: 0521635497), edited by S. Barry Cooper and John K. Truss, and published by Cambridge University Press in their London Mathematical Society Lecture Notes Series (nos. 259 and 258, respectively). The books were sent to CUP on November 27, 1998, for publication in March or April 1999. Current information on each article can be found below. Enquiries from authors should be sent to the appropriate editor ( Barry Cooper John Truss Up to contents: Back to LC97 homepage: MODELS AND COMPUTABILITY: Ulrich Berger Continuous functionals of dependent and transfinite types. (22, final version received) Cristian Calude Richard Coles Peter Hertling and Bakhadyr Khoussainov Degree-theoretic aspects of computably enumerable reals.

23. EconPapers: The Computable Approach To Economics The key word in the Rabin quote is Effective, meaning a procedure whose execution is into set theory, proof theory, model theory and recursion theory. http://econpapers.repec.org/paper/wopcallce/_5F005.htm

EconPapers Home About EconPapers Working Papers Journal Articles ... Format for printing EconPapers has moved to http://econpapers.repec.org! Please update your bookmarks. The Computable Approach to Economics Kumaraswamy Velupillai Additional contact information Kumaraswamy Velupillai: Center for Computable Economics, UCLA and Queen's University, Belfast. Working Papers from University of California at Los Angeles, Center for Computable Economics Abstract: New Economics Papers: this item is included in nep-cmp and nep-ind Downloads: (external link) http://cce.sscnet.uc ... pproach/approach.doc Our link check indicates that this URL is bad, the error code is: 500 Can't connect to cce.sscnet.ucla.edu:80 (connect: Unknown error) Related works: This item may be available elsewhere in EconPapers: Search for items with the same title. Access Statistics for this paper More papers in Working Papers from University of California at Los Angeles, Center for Computable Economics Contact information at EDIRC Series data maintained by Thomas Krichel ( This site is part of RePEc and all the data displayed here is part of the RePEc data set.

24. Models And Computability - Cambridge University Press Effective model theory the number of models and their complexity B. Khoussainov and RA Shore; 9. Recursion theoretic memories 1954–1978 GE Sacks; 17. http://www.cup.cam.ac.uk/us/catalogue/print.asp?isbn=9780521635509&print=y

25. DADES DEL SUMARI DE LONDON MATHEMATICAL SOCIETY LECTURE NOTE SERIES Títol Effective model theory The Number of models and Their Complexity Autor Khoussainov, B.; Shore, RA Títol Recursion Theoretic Memories 19541978 http://sumaris.cbuc.es/cgis/sumari.cgi?issn=00760552&idsumari=A1999N000000V00025

26. Tmecca : Models & Computability By Truss, John K. ( Cambridge University Press ) Translate this page Effective model theory The Number of models and Their Complexity, 193 Recursion Theoretic Memories 1954-1978, 367. Fields Definable in Simple Groups http://www.tmecca.co.kr/detail/detail_book.html?isbn=0521635500

27. Past Colloquium And Seminar Speakers RECURSION theory Seminar. Valentina Harizanov. Effective search problem Title What do the law of large numbers, computer learning, model theory, and http://www.gwu.edu/~math/colloquiahistory.html

Past Colloquium and Seminar Speakers Years: Department Colloquia and Seminars, Fall 1990 Joseph Bonin, Colloquium Organizer Friday, September 14. Mathematics Colloquium. Edward R. Scheinerman, Johns Hopkins University and George Washington University. Title: Circle Orders. Friday, September 14. Combinatorics Seminar. Edward R. Scheinerman, Johns Hopkins University and George Washington University. Title: More on Circle Orders: Failure of Compactness. Monday, September 17. Recursion Theory Seminar. William Gasarch, University of Maryland, College Park. Title: When Oracles Do Not Help. Friday, September 21. Mathematics Colloquium. Marc Lipman, Office of Naval Research. Title: Vertex-Transitive Graphs of Toughness Exactly One are Bipartite. Friday, September 21. Combinatorics Seminar. Rodica Simion, George Washington University. Title: Set Partition Statistics Applied to Permutations. Monday, September 24. Recursion Theory Seminar. William Gasarch, University of Maryland, College Park. Title: Friedberg-Munchuik Theorem for Inductive Inference. Friday, September 28. Recursion Theory Seminar. Chris Laskowski, University of Maryland, College Park. Title: Selected Topics in Model Theory, I

28. Cornell Math - Thesis Abstracts (Logic) Abstract We initiate the study of computable model theory of modal logic, by establishing Effective completeness theorems for a variety of modal logics. http://www.math.cornell.edu/Research/Abstracts/logic.html

Ph.D. Recipients and their Thesis Abstracts Logic Algebra Analysis Combinatorics Differential Equations / Dynamical Systems ... Topology Reba Schuller , August 2003 Advisor: Anil Nerode A Theory of Multitask Learning for Learning from Disparate Data Sources Abstract: Many endeavors require the integration of data from multiple data sources. One major obstacle to such undertakings is the fact that different sources may vary considerably in the way they choose to represent their data, even if their data collections are otherwise perfectly compatible. In practice, this problem is usually solved by a manual construction of translations between these data representations, although there have been some recent attempts at supplementing this with automated algorithms based on machine learning methods. This work addresses the problem of making classification predictions based on data from multiple sources, without constructing explicit translations between them. We view this problem as a special case of the problem of multitask learning: Both intuition and much empirical work indicate that learning can be improved by attacking multiple related tasks simultaneously; however, thus far, no theoretical work has been able to support this claim, and no concrete definition has been proposed for what it means for two learning tasks to be "related."

29. ScienceDirect - Journal Of Economic Behavior & Organization : Effectivity And Co Next, the same two recursion theoretic proof techniques, used in Section 2, .. Recursion theory, proof theory and model theory can also provide http://linkinghub.elsevier.com/retrieve/pii/S0167268102000045

Athens/Institution Login Not Registered? User Name: Password: Remember me on this computer Forgotten password? Home Browse My Settings ... Help Quick Search Title, abstract, keywords Author e.g. j s smith Journal/book title Volume Issue Page Volume 49, Issue 3 , November 2002, Pages 307-325 Abstract Full Text + Links PDF (110 K) Related Articles in ScienceDirect Algorithmic foundations of computable general equilibri... Applied Mathematics and Computation Algorithmic foundations of computable general equilibrium theory Applied Mathematics and Computation Volume 179, Issue 1 1 August 2006 Pages 360-369 K. Vela Velupillai Abstract A constructive and recursion theoretic analysis of the standard computable general equilibrium (CGE) model of economic theory is undertaken. It is shown, contrary to widely expressed views and textbook versions of the CGE model, that the standard CGE model is neither computable nor constructive in the strict mathematical senses. Abstract Full Text + Links PDF (176 K) Compact abelian groups of automorphisms of von Neumann ... ... Journal of Functional Analysis Compact abelian groups of automorphisms of von Neumann algebras Journal of Functional Analysis Volume 39, Issue 3

30. RePEc Mathematical logic itself is divided into set theory, proof theory, model theory and recursion theory. The study of computable objects and domains is the http://www.inomics.com/cgi/repec?handle=RePEc:wop:callce:_005

31. STOC: STOC '75, Computability Concepts For Programming ... These new recursion theoretic concepts which are appropriate to semantics also allow us Hartley Rogers, Jr., theory of recursive functions and Effective http://portal.acm.org/citation.cfm?id=800116.803757&coll=portal&dl=ACM&type=seri

32. Mathematical Preprints By Steffen Lempp Applications to and in model theory; Applications to reverse mathematics .. arising from finite complexity theory in terms of their recursion theoretic http://www.math.wisc.edu/~lempp/papers/list.html

Mathematical Preprints by Steffen Lempp (The preprints are listed by research area, within research area in alphabetical order of coauthor(s).) Research Areas Classical Computability Theory Computably enumerable degrees Lattice embeddings into the c. e. degrees Decidability of fragments of theories of the c. e. degrees ... Lecture Notes and Ph. D. Thesis Classical Computability Theory Computably enumerable degrees Lattice embeddings into the c. e. degrees Lattice embeddings into the r. e. degrees preserving and 1 , with Klaus Ambos-Spies and Manuel Lerman (published in Journal of the London Mathematical Society, 1994, ps download of paper Abstract: We show that a finite distributive lattice can be embedded into the r. e. degrees preserving least and greatest element iff the lattice contains a join-irreducible noncappable element. Lattice embeddings into the r. e. degrees preserving 1 , with Klaus Ambos-Spies and Manuel Lerman (published in "Logic and Philosophy of Science: Papers from the 9th International Congress of Logic, Methodology, and Philosophy of Science", 1994, ps download of paper , jpg download of Diagram 1 in preparation) Abstract: We show that the two nondistributive five-element lattices, M

33. FOM: Invitation To Soare So is model theory, proof theory, and set theory, philosophy of mathematics, whose natural formulation does not mention recursion theoretic concepts, http://cs.nyu.edu/pipermail/fom/1999-July/003255.html

FOM: Invitation to Soare Harvey Friedman friedman at math.ohio-state.edu Mon Jul 19 07:33:44 EDT 1999 Previous message: FOM: 52:Cardinals and Cones Next message: FOM: 53:Free Sets/Reverse Math Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Robert Soare has written a response to Simpson and me on the COMP-THY mailing list, which I saw through http://www.math.psu.edu/simpson/cta/. WELL, this has been a busy time... This week alone there have been two from Simpson and one from Harvey, another from Simpson before that. They have made all those comments about ME with more than the usual invective and disparagement. Gosh, fellas, I didn't know I merited all this attention. I am really flattered!! http://www.math.psu.edu/simpson/cta/ I call attention to "They have made all those comments about ME with more than the usual invective and disparagement." Speaking for myself, Soare is referring to my FOM posting, Open Criticism 10:56PM 7/14/99. Reading this over, I can't see what in that posting is "about ME (Soare) with more than the usual invective and disparagement." In fact, when I composed that posting, I was determined to add only light and no heat to this debate. FOM LIST OPEN SIMPSON AS MODERATOR SIMPSON AS SUBSCRIBER Soare wrote a revised Conclusion of 7/16/99, also available from http://www.math.psu.edu/simpson/cta/.

34. Invited Speakers We shall argue that logic and model theory is such a plat form. properties - which often combine proof theoretic and recursion theoretic arguments. http://www.math.uni-bonn.de/people/fotfs/II/invited_speakers.html

Invited Speakers Foundations of the Formal Sciences II Alexandru Baltag Anouk Barberousse Johan van Benthem Mariagnese Giusto ... Leon van der Torre Modal Logics for Games: tools for studying the dynamics of knowledge and belief Alexandru Baltag One of the main uses of modal logic has been to provide simple ways to express properties of knowledge and belief ; semantically, this corresponds to an understanding of Kripke structures in terms of epistemic uncertainty relations between ``possible worlds''. But modal (temporal and dynamic) logics were also used in computer science to express properties of actions, change and time ; this corresponds to a different interpretation of Kripke structures as ``transition systems'', involving transitions between successive ``states'' of a dynamical system. These two interpretations come together in logics that combine both epistemic (or doxastic) modalities and dynamic (or temporal) ones, in order to study the complex interaction between knowledge, beliefs and change Picture in normal large size top back to main page The diversity of models in statistical mechanics: Views about the structure of scientific theories Anouk Barberousse Picture in normal large size top back to main page The logical architecture of natural language Johan van Benthem I intend to discuss the spectrum of logical systems that is involved in natural language use, going all the way up from parsing to discourse understanding. In particular, I want to consider the different ways in which these systems must be used and combined.

35. Research - Alessandro Agostini We situate our games within a recursion theoretic setting, . and interactive gameoriented system based on a well known result in model theory, namely, http://dit.unitn.it/~agostini/data/pages/r2pub.htm

Research - Page 2 PUBLICATIONS You can read more about my publications by following this list with abstracts. If you'd like a copy of any of these, send me mail at dit.unitn.it, the userid is agostini. "Coordination through Inductive Meaning Negotiation." [PS,0K] [PDF,95K] . April 2002, 14 pages. Revised version to appear in: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI-06) This paper is on negotiation, precisely on the negotiation of meaning . We advance and discuss a formal paradigm of coordination and variants thereof, wherein meaning negotiation plays a major role in the process of convergence to a common agreement. Our model engages a kind of pairwise, model-theoretic coordination between knowledge-based agents, eventually able to communicate the meaning of their beliefs by expressions taken from the literals of a common first-order language. We focus on the framework of inductive inference , sometimes called ``formal learning theory,'' and argue that it offers a fresh and rigorous perspective on many current debates in Artificial Intelligence in the context of multiple individuals in interaction, including those on the semantic interoperability, the update semantics and belief revision, and the language creation, evolution and learning. BibTex (with G. Moro) "Identification of communities of peers by trust and reputation."

36. Proof Theory On The Eve Of Year 2000 Of course, such questions can partly be also addressed using tools from model theory instead. However, proof theory focuses on Effective solutions, http://www.ihes.fr/~carbone/papers/proofsurveyFeferman2000.html

Proof Theory on the eve of Year 2000 By Solomon Feferman An index of respondents with links to their answers is to be found below. Index by author: Anton Setzer Alasdair Urquhart Michael Beeson Gaisi Takeuti ... Troelstra*-2 Date: Fri, 3 Sep 1999 18:14:06 +0200 From: Anton Setzer Date: Mon, 6 Sep 1999 21:26:45 -0700 From: Michael Beeson To: Solomon Feferman Date: Tue, 7 Sep 1999 15:44:01 -0400 (EDT) From: Gaisi Takeuti To: Solomon Feferman Subject: Proof Theory Dear Sol, I am now concentrating in some specific problem. So I don't claim that I have a nice global view of proof theory. Nevertheless I have an impression that proof theory is doing very well in many diversified directions. I think that is healthy. Of course I would be happier if more people would work on Bounded Arithmetic related to complexity theory. Gaisi Date: Wed, 8 Sep 1999 13:56:03 -0700 (PDT) From: Sam Buss Date: Thu, 9 Sep 1999 15:45:33 -0400 (EDT) From: Neil Tennant Date: Tue, 14 Sep 1999 11:43:43 -0600 From: detlefsen.1@nd.edu To: Solomon Feferman Date: Tue, 14 Sep 1999 21:39:24 +0200 (MET DST) From: Sergei Tupailo

37. Frank Stephan's Publications Recursion theoretic properties of frequency computation and bounded queries. .. Applications of Kolmogorov Complexity to Computable model theory. http://www.comp.nus.edu.sg/~fstephan/publications.html

Frank Stephan's Publications Due to copy-right regulations, the readers should note, that the author does not have the right to update preprints in order to make them identical with the contents of a journal-publication. If you want to have the exact text of a journal publication instead of the one of the corresponding older technical report, you are kindly requested to look into your libary. Technical Report versions are marked with the report number in brackets. Many publications, in particular conference-proceedings, have appeared in the series Lecture Notes in Computer Science from Springer. Publications appeared in the following journals: Annals of Mathematics and Artificial Intelligence from Kluwer, Annals of Pure and Applied Logic from Elsevier, Archive for Mathematical Logic from Springer, IEEE Transactions on Computers from the IEEE Computer Society, Information and Computation from Academic Press, International Journal of Foundations of Computer Science from World Scientific, Journal of Automata, Languages and Combinatorics from Otto-von-Guericke-Universitaet Magdeburg, Journal of Computer and System Sciences from Elsevier

38. Mathematics And Computation » Publications Abstract Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. http://math.andrej.com/category/papers/

@import url( http://math.andrej.com/wp-content/themes/andrej/style.css ); Mathematics and Computation April 12, 2007 Implementing real numbers with RZ Filed under: RZ Talks Publications Computation ... Constructive math With Iztok Kavkler Abstract: RZ is a tool which translates axiomatizations of mathematical structures to program specifications using the realizability interpretation of logic. This helps programmers correctly implement data structures for computable mathematics. RZ does not prescribe a particular method of implementation, but allows programmers to write efficient code by hand, or to extract trusted code from formal proofs, if they so desire. We used this methodology to axiomatize real numbers and implemented the specification computed by RZ. The axiomatization is the standard domain-theoretic construction of reals as the maximal elements of the interval domain, while the implementation closely follows current state-of-the-art implementations of exact real arithmetic. Our results shows not only that the theory and practice of computable mathematics can coexist, but also that they work together harmoniously. Presented at Computability and Complexity in Analysis 2007 Download paper: rzreals.pdf

39. Examples Of English Collocations In Mathematical Texts Collected the group theory from matrix theory from category theory in model theory the NBG . logic recursiontheoretic * recursion-theoretical model-theoretic http://lpcs.math.msu.su/~pentus/ftp/mehmat/english.txt

40. The Journal Of Symbolic Logic, Volume 48 564569 BibTeX; Philipp Rothmaler Some model theory of Modules. I. Byerly Definability of RE Sets in a Class of Recursion Theoretic Structures. http://www.sigmod.org/dblp/db/journals/jsyml/jsyml48.html

The Journal of Symbolic Logic , Volume 48 Volume 48, Number 1, March 1983 Harrie C. M. de Swart : A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS. 1-20 BibTeX Henry A. Kierstead Jeffrey B. Remmel : Indiscernibles and Decidable Models. 21-32 BibTeX Menachem Magidor Saharon Shelah Jonathan Stavi : On the Standard Part of Nonstandard Models of Set Theory. 33-38 BibTeX G. P. Monro : On Generic Extensions Without the Axiom of Choice. 39-52 BibTeX G. C. Nelson : Logic of Reduced Power Structures. 53-59 BibTeX Bruno Poizat BibTeX Solomon Feferman : Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. 63-70 BibTeX William G. Fleissner : Sone of George and V = L. 71-77 BibTeX A. J. Dodd : Core Models. 78-90 BibTeX Stevo Todorcevic : Real Functions on the Family of All Well-Ordered Subsets of a Partially Ordered Set. 91-96 BibTeX Jean Porte : Antitheses in Systems of Relevant Implication. 97-99 BibTeX Iraj Kalantari Anne Leggett : Maximality in Effective Topology. 100-112 BibTeX Penelope Maddy : Proper Classes. 113-139

41. Andrew Arana | Publications One hope I have had for this work is that classical recursion theoretic `Effective argument for why True Arithmetic (TA), the complete theory of the http://www-personal.ksu.edu/~aarana/publications.html

Here you will find a list of my papers. If I don't have a link to download them here, send me an email about possible availability. For information on recent talks I've given, click here Published Critical note on Solomon Feferman's In The Light of Logic Mathematical Intelligencer Click here for a PDF of the note. m Reverse Mathematics 2001 , edited by Steve Simpson Lecture Notes in Logic 21, A.K. Peters Publishers / Association for Symbolic Logic, 2005, pp. 27-41. In this paper I begin by extending two results of Solovay; the first characterizes the possible Turing degrees of models of True Arithmetic (TA), the complete first-order theory of the standard model of PA, while the second characterizes the possible Turing degrees of arbitrary completions of P. I extend these two results to characterize the possible Turing degrees of m here for a PDF of the paper. The Journal of Symbolic Logic I extend an independence result proved in . My proof uses the Barwise-Kreisel Compactness Theorem. Click here for an abstract. Click

42. TAI 2001 - Abstracts We develop the algorithmic theory of statistic, sufficient statistic, as well as on the recursion theoretic counterpart, using an Effective version of http://www.cmi.univ-mrs.fr/~eforment/confs/tai2001/tai_abs.html

Abstracts Algorithmic statistics P. Gacs Subsequences and complexity J. Reimann Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit J. Schmidhuber The traditional theory of Kolmogorov complexity and algorithmic probability focuses on monotone Turing machines with one-way write-only output tape. This naturally leads to the universal enumerable Solomonoff-Levin measure. Here we introduce more general, nonenumerable but cumulatively enumerable measures (CEMs) derived from Turing machines with lexicographically nondecreasing output and random input, and even more general approximable measures and distributions computable in the limit. We obtain a natural hierarchy of generalizations of algorithmic probability and Kolmogorov complexity. Among other things we show that there are objects computable in the limit yet more random than Chaitin's ``number of wisdom'' Omega, that any approximable measure of x is small for any x lacking a short description, that there is no universal approximable distribution, that there is a universal CEM, and that any nonenumerable CEM of $x$ is small for any $x$ lacking a short enumerating program. We briefly mention consequences for universes sampled from such priors.

43. The Journal Of Symbolic Logic, Volume 48 564569 BibTeX Philipp Rothmaler Some model theory of Modules. E. Byerly Definability of R. E. Sets in a Class of Recursion Theoretic Structures. http://www.informatik.uni-trier.de/~ley/db/journals/jsyml/jsyml48.html

The Journal of Symbolic Logic , Volume 48 Volume 48, Number 1, March 1983 Harrie C. M. de Swart : A Gentzen- or Beth-Type System, a Practical Decision Procedure and a Constructive Completeness Proof for the Counterfactual Logics VC and VCS. 1-20 BibTeX Henry A. Kierstead Jeffrey B. Remmel : Indiscernibles and Decidable Models. 21-32 BibTeX Menachem Magidor Saharon Shelah Jonathan Stavi : On the Standard Part of Nonstandard Models of Set Theory. 33-38 BibTeX G. P. Monro : On Generic Extensions Without the Axiom of Choice. 39-52 BibTeX G. C. Nelson : Logic of Reduced Power Structures. 53-59 BibTeX Bruno Poizat BibTeX Solomon Feferman : Choice Principles, the Bar Rule and Autonomously Iterated Comprehension Schemes in Analysis. 63-70 BibTeX William G. Fleissner : Sone of George and V = L. 71-77 BibTeX A. J. Dodd : Core Models. 78-90 BibTeX Stevo Todorcevic : Real Functions on the Family of All Well-Ordered Subsets of a Partially Ordered Set. 91-96 BibTeX Jean Porte : Antitheses in Systems of Relevant Implication. 97-99 BibTeX Iraj Kalantari Anne Leggett : Maximality in Effective Topology. 100-112 BibTeX Penelope Maddy : Proper Classes. 113-139

44. PhD School - Computer Science Department - University Of Rome "La Sapienza" Research in this area features an interplay between proof theory, recursion theory, model theory, combinatorics, number theory etc. http://phd.di.uniroma1.it/past_events_2007.php

PhD School Past Events Past Events Sm@rt Speaker: Luca Trevisan Title: Pseudorandomness and Combinatorial Constructions Date: Monday, December 17, 2007; Time: 3:00pm Duration: about 60 min. Venue: DI, Via Salaria 113, Aula Seminari In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or unknown. In computer science, probabilistic algorithms are sometimes simpler and more efficient than the best known deterministic algorithms for the same problem. Despite this evidence for the power of random choices, the computational theory of pseudorandomness shows that, under certain complexity-theoretic assumptions, every probabilistic algorithm has an efficient deterministic simulation and a large class of applications of the probabilistic method can be converted into explicit constructions. In this survey talk we describe connections between the conditional "derandomization" results of the computational theory of pseudorandomness and unconditional explicit constructions of certain combinatorial objects such as error-correcting codes and "randomness extractors." Biographical Sketch Luca Trevisan is an associate professor of computer science at U.C. Berkeley. He received his Laurea (BSc) degree in 1993 and his Dottorato (Ph.D.) in 1997, both from the University of Rome La Sapienza. Before joining U.C. Berkeley in 2000, he was a post-doc at MIT and at DIMACS, and an assistant professor at Columbia University.

45. Mathematische Logik Und Theoretische Informatik Computable Numberings of Definable Relations in Models. 7. Januar 2003 Jan Reimann, Universität Heidelberg Effective Geometric Measure theory http://www.math.uni-heidelberg.de/logic/WS02/obersem_WS02.html

Arbeitsgruppe Mathematische Logik und Theoretische Informatik Oberseminar Wintersemester 2002/2003 (The talks are usually on Tuesday at 4 p.m. in Room 134 of building INF 294.) Mittwoch, 2. Oktober 2002, 10.15 h, INF 294, HS 134 Theodore A. Slaman, University of California Freitag, 11. Oktober 2002, 10.15 h, INF 294, HS 134 Sasha Rubin, University of Auckland Techniques proving non-automaticity Dienstag 22. Oktober 2002, 17.15 h, INF 294, HS 134 und Freitag 25. Oktober 2002, 9.15 h, INF 294, HS -104 Bakhadyr Khoussainov, University of Auckland Computably Enumerable Algebras, Abstract Data Types, and Specifications Mittwoch, 23. Oktober 2002, 17.15 h, INF 294, HS 134 Cristian S. Calude, University of Auckland Computing a Glimpse of Randomness 5. November 2002 Frank Stephan, Classes with Easily Learnable Subclasses 12. November 2002 Frank Stephan, Learning Algebraic Structures 19. November 2002 Frank Stephan, Freitag, 29. November 2002, 11.15 h, INF 294, HS 134 Valentina Harizanov, George Washington University, Washington D.C. Algorithmic Complexity of Countable Models 10. Dezember 2002

46. Blackwell Synergy - J Economic Surveys, Volume 21 Issue 3 Page 466-505, July 200 An Effective theory of policy is impossible for a ‘complex’ economy. .. On the other hand, the recursion theoretic fixedpoint tradition not only http://www.blackwell-synergy.com/doi/abs/10.1111/j.1467-6419.2007.00511.x

Skip to main content Email: Password: Register Forgotten Password Athens/Institution Login Synergy Home ... Help Journal Menu Table of Contents List of Issues Tools Email this article Add to favorite articles Export this citation Alert me when this article is cited: Email RSS (What is this?) Publication history Issue online: 15 Jun 2007 Home List of Issues Table of Contents Article Abstract Journal of Economic Surveys Volume 21 Issue 3 Page 466-505, July 2007 To cite this article: K. Vela Velupillai (2007) VARIATIONS ON THE THEME OF CONNING a IN MATHEMATICAL ECONOMICS doi:10.1111/j.1467-6419.2007.00511.x Prev Article Next Article Abstract VARIATIONS ON THE THEME OF CONNING a IN MATHEMATICAL ECONOMICS K. Vela Velupillai University of Trento and Girton College, Cambridge University of Trento and Girton College, Cambridge a I am invoking three meanings of this word, simultaneously: firstly, in the sense of one of the meanings given in The Shorter Oxford English Dictionary on Historical Principles argument or arguer against to swindle trick Longman's Concise English Dictionary confidence trick Leamer (1983) and Roth (1994) on econometrics and experimental economics, respectively.

47. Directorio - Lógica Y Fundamentos Buechler, Steven University of Notre Dame model theory. .. Kolmogorov complexity is a recursion theoretic characterisation of randomness. http://www.satd.uma.es/matap/svera/links/matnet12.html

Lógica y Fundamentos Restaurar marco Añade tu web Anterior Home ... Siguiente en todo el directorio Dmoz sólo en Filosofía/Lógica Top Directorio Español: Matemáticas : Lógica y conjuntos Descripción Genéricas: Acontecimientos Aplicaciones Asociaciones Bibliotecas ... Software Específicas: Álgebra Análisis An. Numérico Cálculo ... Topología Esta categoría en otros idiomas: Inglés Ciudad Futura - Lógica Matemática - Objetivos de la Lógica, definiciones y operaciones básicas. Grupo de Lógica Matemática y Teoría de Conjuntos. - Facultad de Ciencias, Universidad Nacional Autónoma de México. Integrantes, líneas de trabajo y artículos sobre lógica matemática y computacional y conjuntos. Introducción a la Lógica Matemática - Completo manual de lógica, lenguajes formales, computación y sistemas expertos. Lógica y teoría de conjuntos - Manuales de Lógica y teoría de conjuntos, Pruebas de consistencia, Análisis no estándar, Álgebra y Funciones de variable compleja (universidad de Valencia). Monografias.com - Lógica Matemática

48. Set Theory And Physics 26 G. Kreisel, A notion of mechanistic theory, Synthese 29(1974), 1126. 27 D. Stef anescu, Mathematical Models in Physics, University of Bucharest http://tph.tuwien.ac.at/~svozil/publ/set.htm

Set theory and physics K. Svozil University of Technology Vienna A-1040 Vienna, Austria e-mail: svozil@tph.tuwien.ac.at set.tex Abstract A short history of set theory, with emphasis on operationalism Physicists usually do not pay much attention to the particulars of set theory. They tend to have a pragmatic attitude towards the foundations of the formal sciences, combined with the suspicion that, as has been stated by Einstein ([ ], translated from German) ``insofar mathematical theorems refer to reality, they are not sure, and insofar they are sure, they do not refer to reality.'' Yet there are instances when foundational issues do In Cantorian (i.e., non-axiomatic) set theory, the ``definition'' of the concept of a set reads ([ ], translated from German [ ``A set is a collection into a whole of definite distinct objects of our intuition or of our thought. The objects are called the elements (members) of the set.'' As general as it is conceived, Cantorian set theory would provide a powerful mathematical framework for theoretical physics. Per definition, hardly any conceivable object does not fall within its domain. Indeed, how gratifying and ambitious, but also how challenging this conception, one can imagine from Hilbert's emphatic declaration (cf. [