1 resultado para Pecking order theory
em DRUM (Digital Repository at the University of Maryland)
Filtro por publicador
- ABACUS. Repositorio de Producción Científica - Universidad Europea (1)
- Aberystwyth University Repository - Reino Unido (3)
- Academic Archive On-line (Jönköping University; Sweden) (2)
- Academic Archive On-line (Stockholm University; Sweden) (2)
- Academic Research Repository at Institute of Developing Economies (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (10)
- Archive of European Integration (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (4)
- Aston University Research Archive (23)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (11)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (14)
- Boston University Digital Common (1)
- Brock University, Canada (10)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (16)
- Cambridge University Engineering Department Publications Database (9)
- CentAUR: Central Archive University of Reading - UK (32)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (27)
- Cochin University of Science & Technology (CUSAT), India (2)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (2)
- CORA - Cork Open Research Archive - University College Cork - Ireland (6)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (5)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (33)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (2)
- Digital Peer Publishing (2)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (4)
- Glasgow Theses Service (1)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (10)
- Indian Institute of Science - Bangalore - Índia (59)
- Instituto Politécnico de Viseu (2)
- Instituto Politécnico do Porto, Portugal (8)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (4)
- Massachusetts Institute of Technology (2)
- National Aerospace Laboratory (NLR) Reports Repository (1)
- National Center for Biotechnology Information - NCBI (3)
- QSpace: Queen's University - Canada (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (37)
- Queensland University of Technology - ePrints Archive (360)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório Científico do Instituto Politécnico de Santarém - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (16)
- Repositório Institucional da Universidade Federal do Rio Grande do Norte (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (54)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- SAPIENTIA - Universidade do Algarve - Portugal (7)
- SerWisS - Server für Wissenschaftliche Schriften der Fachhochschule Hannover (1)
- Universidad de Alicante (5)
- Universidad del Rosario, Colombia (4)
- Universidad Politécnica de Madrid (14)
- Universidade Complutense de Madrid (5)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (3)
- Universidade Metodista de São Paulo (4)
- Universidade Técnica de Lisboa (2)
- Universita di Parma (2)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Montréal (1)
- Université de Montréal, Canada (15)
- University of Connecticut - USA (1)
- University of Michigan (5)
- University of Queensland eSpace - Australia (14)
- University of Washington (4)
- WestminsterResearch - UK (3)
- Worcester Research and Publications - Worcester Research and Publications - UK (1)
Resumo:
In this work we consider several instances of the following problem: "how complicated can the isomorphism relation for countable models be?"' Using the Borel reducibility framework, we investigate this question with regard to the space of countable models of particular complete first-order theories. We also investigate to what extent this complexity is mirrored in the number of back-and-forth inequivalent models of the theory. We consider this question for two large and related classes of theories. First, we consider o-minimal theories, showing that if T is o-minimal, then the isomorphism relation is either Borel complete or Borel. Further, if it is Borel, we characterize exactly which values can occur, and when they occur. In all cases Borel completeness implies lambda-Borel completeness for all lambda. Second, we consider colored linear orders, which are (complete theories of) a linear order expanded by countably many unary predicates. We discover the same characterization as with o-minimal theories, taking the same values, with the exception that all finite values are possible except two. We characterize exactly when each possibility occurs, which is similar to the o-minimal case. Additionally, we extend Schirrman's theorem, showing that if the language is finite, then T is countably categorical or Borel complete. As before, in all cases Borel completeness implies lambda-Borel completeness for all lambda.