1 resultado para finite-time tracking
em University of Connecticut - USA
Filtro por publicador
- Repository Napier (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (4)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (2)
- Aquatic Commons (3)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (5)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (14)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (32)
- Boston University Digital Common (13)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (7)
- Cambridge University Engineering Department Publications Database (92)
- CentAUR: Central Archive University of Reading - UK (40)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (30)
- Cochin University of Science & Technology (CUSAT), India (7)
- Collection Of Biostatistics Research Archive (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (3)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Dalarna University College Electronic Archive (2)
- Deakin Research Online - Australia (67)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (1)
- Digital Commons - Michigan Tech (10)
- Digital Commons at Florida International University (5)
- Digital Peer Publishing (6)
- DigitalCommons@The Texas Medical Center (2)
- DigitalCommons@University of Nebraska - Lincoln (2)
- DRUM (Digital Repository at the University of Maryland) (2)
- Duke University (5)
- Greenwich Academic Literature Archive - UK (16)
- Helda - Digital Repository of University of Helsinki (7)
- Indian Institute of Science - Bangalore - Índia (105)
- Instituto Politécnico do Porto, Portugal (3)
- Massachusetts Institute of Technology (3)
- National Center for Biotechnology Information - NCBI (2)
- Publishing Network for Geoscientific & Environmental Data (174)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (57)
- Queensland University of Technology - ePrints Archive (111)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (57)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad Politécnica de Madrid (17)
- Universidade Complutense de Madrid (6)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (11)
- University of Connecticut - USA (1)
- University of Queensland eSpace - Australia (10)
- University of Washington (1)
Resumo:
A characterization of a property of binary relations is of finite type if it is stated in terms of ordered T-tuples of alternatives for some positive integer T. A characterization of finite type can be used to determine in polynomial time whether a binary relation over a finite set has the property characterized. Unfortunately, Pareto representability in R2 has no characterization of finite type (Knoblauch, 2002). This result is generalized below Rl, l larger than 2. The method of proof is applied to other properties of binary relations.